Routing restorable bandwidth guaranteed connections using maximum 2-route flows

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2002, Pages 113-121

  Kar, Koushik ^a   Kodialam, Murali ^b   Lakshman, T V ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MINIMUM INTERFERENCE ROUTING; MULTI PROTOCOL LABEL SWITCHED NETWORKS; RESTORABLE ROUTING;

ALGORITHMS; BANDWIDTH; NETWORK PROTOCOLS; OPTICAL COMMUNICATION; PACKET NETWORKS; ROUTERS;

DATA COMMUNICATION SYSTEMS;

EID: 0036346336     PISSN: 0743166X     EISSN: None     Source Type: Journal    
DOI: 10.1109/INFCOM.2002.1019252     Document Type: Article

References (14)

1. On multi-route maximum flows in networks networks
2. Dynamic establishment of protection paths in WDM networks, part I
3. Quality of service based routing: A performance perspective
4. Optical network design and routing
5. Faster and simpler algorithms for multicommodity flow and other fractional packing problems
6. Solving minimum cost flow problem by successive approximation
7. Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications
8. Traffic engineering extensions to OSPF
9. A method for obtaining the maximum multi-route flows in a network
10. Dynamic routing of bandwidth guaranteed tunnels with restoration
11. Framework for MPLS based recovery
12. A quick method for finding shortest pairs of disjoint paths