Resilient Routing Layers for recovery in packet networks

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2005, Pages 238-247

  Hansen, Audun Fosselie ^a,b   Kvalbein, Amund ^a   Čičić, Tarik ^a   Gjessing, Stein ^a   Lysne, Olav ^a  

^a SIMULA RESEARCH LABORATORY   (Norway)

^b TELENOR RESEARCH   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK TOPOLOGIES; NETWORK TRAFFIC; RESILIENT ROUTING LAYERS (RRL); STATE INFORMATION;

ALGORITHMS; DATA TRANSFER; INFORMATION ANALYSIS; PACKET NETWORKS; PARAMETER ESTIMATION; TOPOLOGY;

ROUTERS;

EID: 27544502693     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2005.81     Document Type: Conference Paper

References (31)

1. http://www.cs.washington.edu/research/networking/rocketfuel/.
2. D. Awduche et al. RSVP-TE: Extensions to RSVP for LSP tunnels. In IETF, RFC 3209, Dec. 2001.
3. R. Bartos and M. Raman. A scheme for fast restoration in MPLS networks. In Proc. of the Twelfth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), pages 488-493, 2000.
4. R. Bartos and M. Raman. A heuristic approach to service restoration in MPLS networks. In Proc. ICC, pages 117-121, June 2001.
5. A. Bremler-Barr, Y. Afek, H. Kaplan, E. Cohen, and M. Merritt. Restoration by path concatenation: Fast recovery of MPLS paths. In Proc. ACM Symposium on Principles of Distributed Computing, pages 43-52, 2001.
6. T. Bu and D. Towsley. On distinguishing between internet power law topology generators. In IEEE INFOCOM, pages 638-647, New York, June 2002.
7. T. Cicic, A. Kvalbein, A. F. Hansen, and S. Gjessing. Resilient Routing Layers and p-Cycles: Tradeoffs in Network Fault Tolerance. In to appear at High Performance Switching and Routing (HPSR2005), Hong Kong, May 2005.
8. W. D. Grover and D. Stamatelakis. Cycle-oriented distributed preconfiguration: Ring-like speed with mesh-like capacity for self-planning network restoration. In Proc. ICC, volume 1, pages 537-543, June 1998.
9. W. D. Grover and D. Stamatelakis. Self-organizing closed path configuration of restoration capacity in broadband mesh transport networks. In Proc. CCBR'98, 1998.
10. H. Huang and J. Copeland. A series of Hamiltonian cycle-based solutions to provide simple and scalable mesh optical network resilience. IEEE Communications Magazine, 40:46-51, Nov. 2002.
11. A. Itai and M. Rodeh. The multi-tree approach to reliability in distributed networks. Inform. Computation, 79:43-59, 1988.
12. C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian. Delayed Internet routing convergence. IEEE/ACM Transactions on Networking, 9(3):293-306, June 2001.
13. C. Labovitz et al. Origins of Internet routing instability. In Proceedings of IEEE/INFOCOM, Mar. 1999.
14. M. H. Macgregor and W. Groover. Optimized k-shortest-paths algorithm for facility restoration. Software-practice and experience, 24(9):823-834, 1994.
15. M. Medard, S. G. Finn, and R. A. Barry. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Transactions on Networking, 7(5):641-652, Oct. 1999.
16. A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: An approach to universal topology generation. In IEEE MASCOTS, pages 346-353, Aug. 2001.
17. K. Menger. Zur allgemeinen kurventheorie. Fund. Math., 10:95-115, 1927.
18. F. Otel. On fast computing bypass tunnel routes in MPLS-based local restoration. In Proceedings of 5th IEEE International Conference on High Speed Networks and Multimedia Communications, pages 234-238, Jeju, Korea, 2002.
19. P. Pan et al. Fast reroute extensions to RSVP-TE for LSP tunnels. In IETF, Internet Draft, Aug. 2004.
20. E. Rosen et al. Multiprotocol label switching architecture. In IETF, RFC 3031, Jan. 2001.
21. A. Sack and W. D. Grover. Hamiltonian p-cycles for fiber-level protection in homogeneous and semi-homogeneous optical networks. IEEE Network, 18:49-56, Mar. 2004.
22. V. Sharma and F. Hellstrand. Framework for multi-protocol label switching (MPLS)-based recovery. In IETF, RFC 3469, Feb. 2003.
23. D. Stamatelakis and W. D. Grover. Rapid span or node restoration in IP networks using virtual protection cycles. In Proc. CCBR'99, Ottawa, Nov. 1999.
24. D. Stamatelakis and W. D. Grover. IP layer restoration and network planning based on virtual protection cycles. IEEE Journal on selected areas in communications, 18(10), Oct. 2000.
25. J. W. Suurballe. Disjoint paths in a network. Networks, pages 125-145, 1974.
26. J. W. Suurballe and R. E. Tarjan. A quick method for finding shortest pairs of disjoint paths. Networks, 14:325-336, 1984.
27. I. Theiss and O. Lysne. FROOTS - fault handling in up*/down* routed networks with multiple roots. In Proceedings of the International Conference on High Performance Computing (HiPC 2003), 2003.
28. B. M. Waxman. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9):1617-1622, Dec. 1988.
29. M. A. Weiss. Data Structures and Algorithm Analysis. Benjamin/Cummings, 1992.
30. J. S. Whalen and J. Kenney. Finding maximal link disjoint paths in a multigraph. In Proc. IEEE GLOBECOM '90, 1990.
31. G. Xue et al. Delay reduction in redundant trees for preplanned protection against single link/node failure in 2-connected graphs. In IEEE GLOBECOM2002: (Optical Networking Symposium), pages 2691-2695, 2002.