![]() |
Volumn 2005, Issue , 2005, Pages 187-192
|
Achieving Maximum throughput with a Minimum number of label switched paths in MPLS networks
|
Author keywords
Flow decomposition; Maximum throughput; MPLS; Traffic engineering
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
COMPUTER SIMULATION;
NETWORK PROTOCOLS;
PROBLEM SOLVING;
TELECOMMUNICATION LINKS;
TELECOMMUNICATION TRAFFIC;
THROUGHPUT;
FLOW DECOMPOSITION;
MAXIMUM THROUGHPUTS;
MULTI PROTOCOL LABEL SWITCHING (MPLS);
TRAFFIC ENGINEERING;
TELECOMMUNICATION NETWORKS;
|
EID: 33748364146
PISSN: 10952055
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ICCCN.2005.1523841 Document Type: Conference Paper |
Times cited : (4)
|
References (10)
|