|
|
|
Volumn 2, Issue , 2001, Pages 699-708
|
|
Approximating optimal spare capacity allocation by successive survivable routing
a
|
|
Author keywords
Approximation algorithm; Multi commodity flow; Network optimization; Network survivability; Online algorithm; Simulated annealing; Spare capacity allocation; Survivable routing
|
|
Indexed keywords
ADAPTIVE ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
FAILURE ANALYSIS;
FAULT TOLERANT COMPUTER SYSTEMS;
INTEGER PROGRAMMING;
MATHEMATICAL MODELS;
MATRIX ALGEBRA;
ROUTERS;
SIMULATED ANNEALING;
TELECOMMUNICATION SERVICES;
TELECOMMUNICATION TRAFFIC;
FAULT TOLERANT NETWORK DESIGN;
NETWORK SURVIVABILITY;
SEAMLESS COMMUNICATION SERVICES;
SIMULATED ANNEALING ALGORITHM;
SPARE CAPACITY ALLOCATION;
SPARE PROVISION MATRIX;
SUCCESSIVE SURVIVABLE ROUTING;
SURVIVABLE ROUTING;
NETWORK PROTOCOLS;
|
|
EID: 0035000852
PISSN: 0743166X
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (143)
|
|
References (35)
|
