Label switched path restoration under two random failures

Conference Record / IEEE Global Telecommunications Conference

Volumn 1, Issue , 2001, Pages 30-34

  Banerjee, Gargi ^a   Sidhu, Deepinder ^a  

^a UNIVERSITY OF MARYLAND BALTIMORE COUNTY   (United States)

Author keywords

Alternate routing; Bandwidth sharing; Link failures; MPLS; Restoration; TE

Indexed keywords

BANDWIDTH; FAILURE ANALYSIS; QUALITY OF SERVICE; RANDOM PROCESSES; ROUTERS; TELECOMMUNICATION LINKS;

LABEL SWITCHED PATHS (LSP);

SWITCHING NETWORKS;

EID: 0035687687     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Shared backup label switched path restoration
2. Dynamic routing of bandwidth guaranteed tunnels with restoration
3. QoS routing mechansims and OSPF extensions
4. A method for setting an alternative label switched paths to handle fast reroute
5. A framework for MPLS-based recovery
6. Notes on path computation in constraint-based routing
7. Requirements for traffic engineering over MPLS
8. A quick method for finding shortest pairs of disjoint paths
9. Disjoint paths in a network