A Fault-Tolerant Multipoint Cycle Routing Algorithm (MCRA)

  • David Lastine
  • Suresh Sankaran
  • Arun K. Somani
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 66)


In this paper we propose a new efficient fault tolerant multipoint routing algorithm for optical networks. The routing for a multipoint request is accomplished by finding a bidirectional cycle simple or nonsimple including all nodes that are participating in the multipoint session. Each link can be used only once. Use of a cycle ensures that a single link (or node in case of simple cycle) failure does not interrupt the session except the failed node if it was part of the multipoint session. Determining the smallest cycle with a given set of Multi-point (MP) nodes is a NP-Complete problem. Therefore, we explore heuristic algorithms to determine an appropriate cycle to route multipoint connections. We allow non-simple cycles to route requests as they use fewer resources than simple cycles in some cases. We also provide an ILP formulation for routing multipoint request and compare its results with the output of our best heuristic algorithm. On Arpanet for over 80% of the time, our best heuristic is able to find a cycle that is within 1.2 times that of the optimal.


Cycle routing algorithm Multipoint Communication Multicasting Fault Tolerant Routing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Zhang, F., Zhong, W.: Performance Evaluation of Optical Multicast Protection Approaches for Combined Node and Link Failure Recovery. Journal of Lightwave Technology 27(18), 4017–4025 (2009)CrossRefGoogle Scholar
  2. 2.
    Khalil, A., Hadjiantonis, A., Ellinas, G., Ali, M.: Pre-planned multicast protection approaches in wdm mesh networks. In: 31st European Conference on Optical Communication, ECOC 2005, 25-29, vol. 1, pp. 25–26 (2005)Google Scholar
  3. 3.
    Ramamurthy, S., Sahasrabuddhe, L., Mukherjee, B.: Survivable WDM mesh networks. Journal of Lightwave Technology 21(4), 870 (2003)CrossRefGoogle Scholar
  4. 4.
    Singhal, N., Sahasrabuddhe, L., Mukherjee, B.: Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks. Journal of Lightwave Technology 21, 11–21 (2003)Google Scholar
  5. 5.
    YuQing, G., Beijing, C.: Protecting Dynamic Multicast Sessions in Optical WDM Mesh NetworksGoogle Scholar
  6. 6.
    Wen-De Zhong, F.: Applying p-Cycles in Dynamic Provisioning of Survivable Multicast Sessions in Optical WDM Networks. In: Conference on Optical Fiber Communication and the National Fiber Optic Engineers Conference, OFC/NFOEC 2007, pp. 1–3 (2007)Google Scholar
  7. 7.
    Feng, T., Lu, R., Zhang, W.: Intelligent p-Cycle Protection for Multicast Sessions in WDM Networks. In: Proc. ICC, vol. 8, pp. 5165–5169 (2008)Google Scholar
  8. 8.
    Zhang, F., Zhong, W., Jin, Y.: Optimizations of p-Cycle-Based Protection ofOptical Multicast Sessions. Journal of Lightwave Technology 26(19), 3298–3306 (2008)CrossRefGoogle Scholar
  9. 9.
    Zhang, F., Zhong, W.: Performance evaluation of p-cycle based protection methods for provisioning of dynamic multicast sessions in mesh WDM networks. Photonic Network Communications 16(2), 127–138 (2008)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Wen-De Zhong, F.: p-Cycle based tree protection of optical multicast traffic for combined link and node failure recovery in WDM mesh networks. IEEE Communications Letters 13(1), 40–42 (2009)CrossRefGoogle Scholar

Copyright information

© ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering 2012

Authors and Affiliations

  • David Lastine
    • 1
  • Suresh Sankaran
    • 1
  • Arun K. Somani
    • 1
  1. 1.Department of Electrical and Computer EngineeringIowa State UniversityAmesUSA

Personalised recommendations