Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding


International Conference on Broadband Communications, Networks and Systems (BROADNETS 2010)

Publication Version

Accepted Manuscript

Link to Published Version

Publication Date


Journal or Book Title

Broadband Communications, Networks, and Systems

First Page


Last Page




Conference Title

International Conference on Broadband Communications, Networks and Systems (BROADNETS 2010)

Conference Date

October 25-27, 2010


Athens, Greece


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.


This is a post-peer-review, pre-copyedit version of a proceeding published as Lastine D., Sankaran S., Somani A.K. (2012) A Fault-Tolerant Multipoint Cycle Routing Algorithm (MCRA). In: Tomkos I., Bouras C.J., Ellinas G., Demestichas P., Sinha P. (eds) Broadband Communications, Networks, and Systems. BROADNETS 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 66. Springer, Berlin, Heidelberg. The final authenticated version is available online at DOI: 10.1007/978-3-642-30376-0_23. Posted with permission.

Copyright Owner

ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering



File Format


Published Version


Article Location