Abstract

The survivable logical topology routing problem in an IP-over-WDM optical network is to map each link (u,v) in the logical topology (at the IP layer) into a lightpath between the nodes u and v in the physical topology (at the optical layer) such that failure of a physical link does not cause the logical topology to become disconnected. It is assumed that both the physical and logical topologies are at least two-edge connected. For this problem, two lines of investigation have been pursued in the literature: one pioneered by Modiano and Narula-Tam [Proc. IEEE INFOCOM, 2001, p. 348] and the other pioneered by Kurant and Thiran [Proc. Int. Conf. on Broadband Networks (BROADNETS), 2004, p. 44]. Since then there has been a great deal of research on this problem. Most of the works have not considered limitations imposed on the routings by physical capacity limits and other metrics in addition to survivability. In this paper, we first introduce two concepts: weakly survivable routing and strongly survivable routing. We then provide mathematical programming formulations for two problems. The first problem is to design a survivable lightpath routing that maximizes the logical demand satisfaction before and after a physical link failure. The second problem is to add spare capacities to the physical links to guarantee routability of all logical link demands before and after a physical link failure. We conclude with heuristics that mitigate the computational complexity of the mathematical programming formulations and with simulation results comparing these heuristics with the mathematical programming formulations.

© 2014 Optical Society of America

Full Article  |  PDF Article
OSA Recommended Articles
Cross-Layer Network Survivability Under Multiple Cross-Layer Metrics

Zhili Zhou, Tachun Lin, Krishnaiyan Thulasiraman, Guoliang Xue, and Sartaj Sahni
J. Opt. Commun. Netw. 7(6) 540-553 (2015)

Design and Dimensioning of Logical Survivable Topologies Against Multiple Failures

Brigitte Jaumard and Hai Anh Hoang
J. Opt. Commun. Netw. 5(1) 23-36 (2013)

k-Connected Network Partitioning Under Shared Risk Link Groups

M. Masud Hasan, Farid Farahmand, and Jason P. Jue
J. Opt. Commun. Netw. 7(8) 695-706 (2015)

References

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Figures (9)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Tables (16)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Equations (41)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription