Reroute sequence planning for label switched paths in multiprotocol label switching networks

IEEE Symposium on Computers and Communications - Proceedings

Volumn , Issue , 2001, Pages 319-325

  Jozsa B G ^a   Magyar, G ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; GLOBAL OPTIMIZATION; HEURISTIC METHODS; NETWORK PROTOCOLS; RESOURCE ALLOCATION; ROUTERS; TELECOMMUNICATION LINKS; TOPOLOGY;

LABEL SWITCHED PATHS (LSP); MULTIPROTOCOL LABEL SWITCHING (MPLS);

SWITCHING NETWORKS;

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

References (13)

1. MPLS and traffic engineering in IP networks
2. Requirements for Traffic engineering over MPLS
3. Constraint-based LSP setup using LDP
4. Traffic engineering with MPLS in the internet
5. An efficient algorithm for global path optimization in MPLS networks
6. LSP modification using CR-LSP
7. On Some combinatorial questions in finite-dimensional spaces
8. Discrepancy theory
9. On some geometric methods in scheduling theory: A survey