Abstract
In this paper, we propose a fault tolerant mechanism on the optical network design with edge-disjoint P-cycles (EDPC). EDPC is a special type of traditional P-cycles, that is, no common edges are allowed to exist between any two P-cycles. Previously published schemes for computing P-cycles are time consuming and do not survive multiple link failures when P-cycles have common edges. Instead of using the complex ILP, a heuristic method based on link state routing which is compatible to the traditional open shortest path first (OSPF) network protocol is proposed to speed up the construction of EDPC. The results show that the EDPC method can tolerate more link failures and improve the restoration efficiency for traditional P-cycles with the decrease of two working units for every two P-cycles.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Grover, W.D., Stamatelakis, D.: Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration. In: Proc. IEEE International Conf. Commun., pp. 537–543 (June 1998)
Stamatelakis, D., Grover, W.D.: IP layer restoration and network planning based on virtual protection cycles. IEEE JSAC Special Issue on Protocols and Architectures for Next Generation Optical WDM Networks 18(10), 1938–1949 (2000)
Ellinas, G., Halemariam, G., Stern, T.: Protection cycle in mesh WDM network. IEEE Journal on Selected Areas in Communications 18(10), 1924–1937 (2000)
Ho, P.-H., Mouftah, H.T.: A framework for service-guaranteed shared protection in WDM mesh network. IEEE Communications Magazine 40(2), 97–103 (2002)
Xue, G., Gottapu, R.: Efficient Construction of Virtual P-Cycles Protecting All Cycle-Protectable Working Links. In: Workshop on High Performance Switching and Routing, pp. 305–309 (June 2003)
Sack, A., Grover, W.D.: Hamiltonian p-Cycles for Fiber-Level Protection in Homogeneous and Semi-Homogeneous Optical Networks. IEEE Network, Special Issue on Protection, Restoration, and Disaster Recovery 49-56 (2004)
Grover, W.D., Doucette, J., Clouqueur, M., Leung, D., Stamatelakis, D.: New Options and Insights for Survivable Transport Networks. IEEE Communications Magazine 40(1), 34–41 (2002)
Médard, M., Barry, R.A., Finn, S.G., He, W., Lumetta, S.S.: Generalized Loop-Back Recovery in Optical Mesh Networks. IEEE Trans. Networking 10, 153–164 (2002)
Medard, M., Finn, S.G., Barry, R.A., Gallager, R.G.: Redundant Trees for Prepalnned Recovery in Arbitrary Vertex-Redundant Graphs. IEEE/ACM Transactions on Networking 7(5), 641–652 (1999)
Tarjan, R.E.: Depth First Search and linear graph algorithm. SIAM Journal on Computing 1, 146–160 (1972)
Qiao, C., Xu, D.: Distributed partial information management (DPIM) schemes for survivable network. IEEE INFOCOM, 301-311 (2002)
Sahasrabuddhe, L., Ramamurthy, S., Mukherjee, B.: Fault management in IP-over-WDM network: WDM protection versus IP restoration. IEEE Journal on Selected Areas in Communications 20, 21–33 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sue, CC., Chen, YC., Shieh, MS., Kuo, SY. (2004). Dependable WDM Networks with Edge-Disjoint P-Cycles. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_94
Download citation
DOI: https://doi.org/10.1007/978-3-540-30566-8_94
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24128-7
Online ISBN: 978-3-540-30566-8
eBook Packages: Computer ScienceComputer Science (R0)