A heuristic approach to service restoration in MPLS networks

IEEE International Conference on Communications

Volumn 1, Issue , 2001, Pages 117-121

  Bartoš, Radim ^a   Raman, Mythilikanth ^a  

^a University of New Hampshire   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FAILURE ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; HEURISTIC METHODS; ROUTERS; TELECOMMUNICATION LINKS;

MULTIPROTOCOL LABEL SWITCHING (MPLS);

SWITCHING NETWORKS;

EID: 0034864198     PISSN: 05361486     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICC.2001.936285     Document Type: Article

References (8)

1. MultiProtocol label switching architecture
2. A scheme for fast restoration in MPLS networks
3. The multi-tree approach to reliability in distributed networks
4. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs