Browse > Article

Lightpaths Routing for Single Link Failure Survivability in IP-over-WDM Networks  

Javed, Muhammad (Department of Computer Science at University of Oklahoma)
Thulasiraman, Krishnaiyan (Department of Computer Science at University of Oklahoma)
Xue, Guoliang(Larry) (School of Computing and Informatics at Arizona State University(ASU))
Publication Information
Abstract
High speed all optical network is a viable option to satisfy the exponential growth of internet usage in the recent years. Optical networks offer very high bit rates and, by employing technologies like internet protocol over wavelength division multiplexing(IP-over-WDM), these high bit rates can be effectively utilized. However, failure of a network component, carrying such high speed data traffic can result in enormous loss of data in a few seconds and persistence of a failure can severely degrade the performance of the entire network. Designing IP-over-WDM networks, which can withstand failures, has been subject of considerable interest in the research community recently. Most of the research is focused on the failure of optical links in the network. This paper addresses the problem of designing IP-over-WDM networks that do not suffer service degradation in case of a single link failure. The paper proposes an approach based on the framework provided by a recent paper by M. Kurant and P. Thiran. The proposed approach can be used to design large survivable IP-over-WDM networks.
Keywords
Internet protocol over wavelength division multiplexing(IP-over-WDM); lightpath routing; optical networks; survivability;
Citations & Related Records

Times Cited By Web Of Science : 0  (Related Records In Web of Science)
Times Cited By SCOPUS : 1
연도 인용수 순위
1 I. Chlamtac, A. Ganz, and G. Karmi, 'Lightpath communications an approach to high bandwidth optical WDM,' IEEE Trans. Commun., vol. 40, no. 7, pp. 1171-1182, July 1992   DOI   ScienceOn
2 R. Ramaswami and K. Sivarajan, Optical Networks: A Practical Perspective. Morgan Kaufmann, 1998
3 M. Blesa and C. Blum, 'Ant colony optimization for the maximum edge-disjoint paths problem,' Springer-Verlag Berlin Heidelberg, vol. 3005/2004,pp. 160-169,2004
4 P. Raghavan and C. Thompson, 'Randomized rounding: A technique for provably good algorithms and algorithmic proofs,' Combinatorica, vol. 7, no.4,pp. 365-375, Dec. 1987   DOI
5 K. Mehlhorn and S. Naher, LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University, 1999
6 L. Sahasrabuddhe, S. Ramamurthy, and B. Mukherjee, 'Fault management in IP-over- WDM networks: WDM protection versus IP restoration,' IEEE J. Sel. Areas Commun., vol. 20, no. I, pp. 21-33, Jan. 2002   DOI   ScienceOn
7 A. Fumagalli and L. Valcarenghi, 'IP restoration vs. WDM protection: Is there an optimal choice?,' IEEE Network, vol. 14, no. 6, pp. 34-41, Nov./Dec. 2000
8 T. Tholey, 'Solving the 2-disjoint paths problem in nearly linear time,' Theory of Computing Systems, vol. 31, no. I, pp. 51-78, Feb. 2006
9 M. Kurant and P. Thiran, 'On survivable routing of mesh topologies in IP-over- WDM networks,' in Proc. IEEE INFOCOM 2005, vol. 2, Mar. 2005, pp. 1106-1116
10 M. Javed, K. Thulasiraman, M. Gaines, and G. Xue, 'Survivability aware routing of logical topologies: On Thiran-Kurant approach, evaluation and enhancements,' in Proc. IEEE Globecom 2006, Nov. 2006, pp. 1-6
11 O. Crochat, J. L. Boudec, and O. Gerstel, 'Protection interoperability for WDM optical networks,' IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 384-395, June 2000   DOI   ScienceOn
12 L. Fleischer, 'Approximation fractional multicommodity flow independent of the number of commodities,' SIAM J. Discrete Math, vol. 13, no. 4, pp. 505-520, 2000   DOI   ScienceOn
13 N. Garg and J. Konemann, 'Faster and simpler algorithms for multicommodity flow and other fractional packing problems,' in Proc. IEEE Symposium on Foundations of Computer Science 1998, Nov. 1998, pp. 300-309
14 M. Kurant and P. Thiran, 'Survivable routing of mesh topologies in IP-over-WDM networks by recursive graph contraction,' IEEE J. Sel. Areas Commun., vol. 25, no. 5, pp. 922-933, June 2007   DOI   ScienceOn
15 K. Thulasiraman and M. Swamy, GRAPHS: Theory and Algorithms. Wiley-Inter-science, 1992
16 Approximation Algorithms for Disjoint Paths Problems, Thesis by Jon Michael Kleinberg
17 E. Modiano and A. Narula-Tam, 'Survivable lightpath routing: A new approach to the design of WDM-based networks,' IEEE J. Sel. Areas Commun., vol. 20, no. 4, pp. 800-809, May 2002   DOI   ScienceOn
18 P. Mateti and N. Deo, 'On algorithms for enumerating all circuits of a graph,' SIAM Journal on Computing, vol 5, no. 1, pp. 90-99, Mar. 1976   DOI