Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set

Zhili Zhou, Tachun Lin, Krishnaiyan Thulasiraman, Guoliang Xue, Sartaj Sahni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

The survivable logical topology mapping 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 2-edge connected. Generating a survivable routing is an NP-complete problem. For this problem two lines of investigations have been pursued in the literature: the mathematical programming based approach initiated by Modiano et al., and the structural approach initiated by Kurant and Thiran and pursued further by Thulasiraman et al. The mathematical programming approach is not scalable for large networks, though it gives considerable insight into certain important aspects of the problem. The structural approach requires contraction and expansion of logical graphs and computing link-disjoint lightpaths between pairs of nodes in the physical topology. In this paper, we propose a novel approach based on the concept of protecting spanning tree set of the logical topology. The basic idea is to identify a set of spanning trees of the logical topology and a routing of the logical links such that at least one of these trees remains connected after a physical link failure. Given a set of trees of the logical topology we first present three optimization problems with varying degrees of difficulty relating to this approach and discuss their Integer Linear Programming formulations. We then consider the general case when both the tree set and a survivable routing are to be determined. For this general case we present a heuristic approach. We incorporate in this heuristic a method to augment the logical topology with additional links to guarantee a survivable routing. This approach has several interesting features. It only requires a shortest path algorithm and an algorithm to generate appropriate spanning trees. It also provides a framework for generating a survivable routing for the SRLG failure case. Contractions of graphs and disjoint path generation are not required that greatly reduces the computation time. We provide results of extensive simulations conducted to evaluate our new approach.

Original languageEnglish (US)
Title of host publicationInternational Congress on Ultra Modern Telecommunications and Control Systems and Workshops
Pages650-656
Number of pages7
DOIs
StatePublished - 2012
Event2012 4th International Congress on Ultra Modern Telecommunications and Control Systems, ICUMT 2012 - St. Petersburg, Russian Federation
Duration: Oct 3 2012Oct 5 2012

Other

Other2012 4th International Congress on Ultra Modern Telecommunications and Control Systems, ICUMT 2012
CountryRussian Federation
CitySt. Petersburg
Period10/3/1210/5/12

Fingerprint

Wavelength division multiplexing
Topology
Mathematical programming
Trees (mathematics)
Fiber optic networks
Linear programming
Telecommunication links
Computational complexity

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Zhou, Z., Lin, T., Thulasiraman, K., Xue, G., & Sahni, S. (2012). Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set. In International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (pp. 650-656). [6459748] https://doi.org/10.1109/ICUMT.2012.6459748

Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set. / Zhou, Zhili; Lin, Tachun; Thulasiraman, Krishnaiyan; Xue, Guoliang; Sahni, Sartaj.

International Congress on Ultra Modern Telecommunications and Control Systems and Workshops. 2012. p. 650-656 6459748.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhou, Z, Lin, T, Thulasiraman, K, Xue, G & Sahni, S 2012, Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set. in International Congress on Ultra Modern Telecommunications and Control Systems and Workshops., 6459748, pp. 650-656, 2012 4th International Congress on Ultra Modern Telecommunications and Control Systems, ICUMT 2012, St. Petersburg, Russian Federation, 10/3/12. https://doi.org/10.1109/ICUMT.2012.6459748
Zhou Z, Lin T, Thulasiraman K, Xue G, Sahni S. Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set. In International Congress on Ultra Modern Telecommunications and Control Systems and Workshops. 2012. p. 650-656. 6459748 https://doi.org/10.1109/ICUMT.2012.6459748
Zhou, Zhili ; Lin, Tachun ; Thulasiraman, Krishnaiyan ; Xue, Guoliang ; Sahni, Sartaj. / Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set. International Congress on Ultra Modern Telecommunications and Control Systems and Workshops. 2012. pp. 650-656
@inproceedings{bce47afff83644d5b6f688febbdb60ce,
title = "Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set",
abstract = "The survivable logical topology mapping 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 2-edge connected. Generating a survivable routing is an NP-complete problem. For this problem two lines of investigations have been pursued in the literature: the mathematical programming based approach initiated by Modiano et al., and the structural approach initiated by Kurant and Thiran and pursued further by Thulasiraman et al. The mathematical programming approach is not scalable for large networks, though it gives considerable insight into certain important aspects of the problem. The structural approach requires contraction and expansion of logical graphs and computing link-disjoint lightpaths between pairs of nodes in the physical topology. In this paper, we propose a novel approach based on the concept of protecting spanning tree set of the logical topology. The basic idea is to identify a set of spanning trees of the logical topology and a routing of the logical links such that at least one of these trees remains connected after a physical link failure. Given a set of trees of the logical topology we first present three optimization problems with varying degrees of difficulty relating to this approach and discuss their Integer Linear Programming formulations. We then consider the general case when both the tree set and a survivable routing are to be determined. For this general case we present a heuristic approach. We incorporate in this heuristic a method to augment the logical topology with additional links to guarantee a survivable routing. This approach has several interesting features. It only requires a shortest path algorithm and an algorithm to generate appropriate spanning trees. It also provides a framework for generating a survivable routing for the SRLG failure case. Contractions of graphs and disjoint path generation are not required that greatly reduces the computation time. We provide results of extensive simulations conducted to evaluate our new approach.",
author = "Zhili Zhou and Tachun Lin and Krishnaiyan Thulasiraman and Guoliang Xue and Sartaj Sahni",
year = "2012",
doi = "10.1109/ICUMT.2012.6459748",
language = "English (US)",
isbn = "9781467320153",
pages = "650--656",
booktitle = "International Congress on Ultra Modern Telecommunications and Control Systems and Workshops",

}

TY - GEN

T1 - Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set

AU - Zhou, Zhili

AU - Lin, Tachun

AU - Thulasiraman, Krishnaiyan

AU - Xue, Guoliang

AU - Sahni, Sartaj

PY - 2012

Y1 - 2012

N2 - The survivable logical topology mapping 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 2-edge connected. Generating a survivable routing is an NP-complete problem. For this problem two lines of investigations have been pursued in the literature: the mathematical programming based approach initiated by Modiano et al., and the structural approach initiated by Kurant and Thiran and pursued further by Thulasiraman et al. The mathematical programming approach is not scalable for large networks, though it gives considerable insight into certain important aspects of the problem. The structural approach requires contraction and expansion of logical graphs and computing link-disjoint lightpaths between pairs of nodes in the physical topology. In this paper, we propose a novel approach based on the concept of protecting spanning tree set of the logical topology. The basic idea is to identify a set of spanning trees of the logical topology and a routing of the logical links such that at least one of these trees remains connected after a physical link failure. Given a set of trees of the logical topology we first present three optimization problems with varying degrees of difficulty relating to this approach and discuss their Integer Linear Programming formulations. We then consider the general case when both the tree set and a survivable routing are to be determined. For this general case we present a heuristic approach. We incorporate in this heuristic a method to augment the logical topology with additional links to guarantee a survivable routing. This approach has several interesting features. It only requires a shortest path algorithm and an algorithm to generate appropriate spanning trees. It also provides a framework for generating a survivable routing for the SRLG failure case. Contractions of graphs and disjoint path generation are not required that greatly reduces the computation time. We provide results of extensive simulations conducted to evaluate our new approach.

AB - The survivable logical topology mapping 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 2-edge connected. Generating a survivable routing is an NP-complete problem. For this problem two lines of investigations have been pursued in the literature: the mathematical programming based approach initiated by Modiano et al., and the structural approach initiated by Kurant and Thiran and pursued further by Thulasiraman et al. The mathematical programming approach is not scalable for large networks, though it gives considerable insight into certain important aspects of the problem. The structural approach requires contraction and expansion of logical graphs and computing link-disjoint lightpaths between pairs of nodes in the physical topology. In this paper, we propose a novel approach based on the concept of protecting spanning tree set of the logical topology. The basic idea is to identify a set of spanning trees of the logical topology and a routing of the logical links such that at least one of these trees remains connected after a physical link failure. Given a set of trees of the logical topology we first present three optimization problems with varying degrees of difficulty relating to this approach and discuss their Integer Linear Programming formulations. We then consider the general case when both the tree set and a survivable routing are to be determined. For this general case we present a heuristic approach. We incorporate in this heuristic a method to augment the logical topology with additional links to guarantee a survivable routing. This approach has several interesting features. It only requires a shortest path algorithm and an algorithm to generate appropriate spanning trees. It also provides a framework for generating a survivable routing for the SRLG failure case. Contractions of graphs and disjoint path generation are not required that greatly reduces the computation time. We provide results of extensive simulations conducted to evaluate our new approach.

UR - http://www.scopus.com/inward/record.url?scp=84874571802&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874571802&partnerID=8YFLogxK

U2 - 10.1109/ICUMT.2012.6459748

DO - 10.1109/ICUMT.2012.6459748

M3 - Conference contribution

AN - SCOPUS:84874571802

SN - 9781467320153

SP - 650

EP - 656

BT - International Congress on Ultra Modern Telecommunications and Control Systems and Workshops

ER -