Pre-provisioning networks to support fast restoration with minimum over-build

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2004, Pages 154-164

  Alicherry, Mansoor ^a   Bhatia, Randeep ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BYPASS TUNNELS; LABEL SWITCH PATHS (LSP); MULTI-PROTOCOL-LABEL-SWITCHING (MPLS);

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; FAILURE ANALYSIS; GRAPH THEORY; NETWORK PROTOCOLS; QUALITY OF SERVICE; TELECOMMUNICATION SERVICES;

TELECOMMUNICATION NETWORKS;

EID: 8344219733     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. L. Calvignac et al. A method for an Optimized Online Placement of MPLS Bypass Tunnels. Internet Draft, draft-leroux-mpls-bypass-placement-00.txt, February 2002.
2. C. Chekuri, A. Gupta, A. Kumar, J. Naor and D. Raz Building Edge-Failure Resilient Networks. Proceedings of the Ninth Conference on Integer Programming and Combinatorial Optimization (IPCO) 2002, pp 439-456.
3. H. Choi, S. Subramaniam and H. Choi On Double-Link Failure Recovery in WDM Optical Networks. Proceedings IEEE INFOCOM 2002.
4. M. Clouqueur and W. D. Grover Availability analysis of span-restorable mesh networks. IEEE Journal of Selected Areas in Communications, vol. 20, no 4. pp 810-821, May 2002
5. B. S. Davie, Y. Rekhter MPLS: Technology and Applications. Morgan Kaufmann, 2000.
6. G. Ellinas and T. E. Stern Automatic protection switching for link failures in optical networks with bi-directional links. Proc. Globecom 96, pp. 152156.
7. W. D. Grover Case studies of survivable ring, mesh and mesh-arc hybrid networks. Proc. Globecom 92, pp. 633-638.
8. W. D. Grover and D. Stamatelakis Cycle-oriented distributed preconfiguration: Ring-like speed with mesh-like capacity for self-planning network reconfiguration. Proc. ICC, 1998, pp. 537-543.
9. D. Haskin and R. Krishnan A Method for Setting an Alternative Label Switched Path to Handle Fast Reroute. Internet Draft, draft-haskin-mpls-fast- reroute-05.txt, Nov. 2000.
10. F. Jaeger A survey of the double cycle cover conjecture. Cycles in Graphs, Annals of Discrete Mathematics 115: North-Holland, 1985.
11. S. Kini et al. Shared Backup Label Switched Path Restoration. Internet Draft, draft-kini-restoration-shared-backup-01.txt, May 2001.
12. M. S. Kodialam and T. V. Lakshman Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration. Proceedings IEEE INFOCOM 2000, pp 902-911.
13. M. S. Kodialam and T. V. Lakshman Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels Using Aggregated Link Usage Information. Proceedings IEEE INFOCOM 2001, pp 376-385.
14. M. Medard, S. G. Finn, and R. A. Barry WDM Loop-back Recovery in Mesh Networks. Proceedings IEEE INFOCOM 1999, vol. 2, pp. 752-759.
15. M. Medard, R. A. Barry, S. G. Finn, W. He and S. Lumetta Generalized Loop-back Recovery in Optical Mesh Networks. IEEE/ACM Transactions on Networking, Volume 10, Issue 1, Feb 2002 Pages: 153-164
16. P. Pan et al. Fast Reroute Techniques in RSVP-TE. Internet Draft, draft-ietf-mpls-rsvp-lsp-fastreroute-02.txt, February 2003.
17. D. A. Schupke, A. Autenrieth and T. Fischer Survivability of Multiple Fiber Duct Failures. Third International Workshop on the Design of Reliable Communication Networks (DRCN), Budapest, Hungary, October 7-10, 2001
18. J. Shi and J. P. Fonseka Hierarchical self-healing rings. IEEE/ACM Transaction on Networking, vol. 3, pp. 690-697, Dec. 1995.
19. C. Thomassen On the Complexity of Finding a Minimum Cycle Cover of a Graph. SIAM Journal of Computing, Volume 26, Number 3, pp 675-677, June 1997.
20. J. P. Vasseur et al. Traffic Engineering Fast Reroute: Bypass Tunnel Path Computation for Bandwidth Protection. Internet Draft, draft-vasseur-mpls- backup-computation-02.txt, August 2003