Reroute sequence planning for protected traffic flows in GMPLS networks

IEEE International Conference on Communications

Volumn 5, Issue , 2002, Pages 2702-2706

  Józsa, Balázs Gábor ^a  

^a ERICSSON RESEARCH   (Hungary)

Author keywords

GMPLS; Path optimization; Protection; Rerouting; Sequence planning

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; INTERNET; NETWORK PROTOCOLS; OPTIMIZATION; PROBLEM SOLVING; ROUTERS;

PROTECTED TRAFFIC FLOWS;

TELECOMMUNICATION TRAFFIC;

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

References (8)

1. Generalized multi-protocol label switching (GMPLS) architecture
2. LSP modification using CR-LDP
3. Handbook of Combinatorics
4. On the solution of the reroute sequence planning problem
5. Reducibility among combinatorial problems
6. Reroute sequence planning for label switched paths in multiprotocol label switching networks
7. An efficient algorithm for global path optimization in MPLS networks