|
Volumn 3, Issue , 1995, Pages 1290-1299
|
Logarithmically scalable routing algorithms in large opticalnetworks
|
Author keywords
[No Author keywords available]
|
Indexed keywords
BLOCKING PROBABILITY;
GRAPH THEORY;
QUALITY CONTROL;
AMOUNT OF INFORMATION;
APPROXIMATE ANALYSIS;
CALL BLOCKING PROBABILITIES;
FIXED NETWORKS;
HIERARCHICAL APPROACH;
NETWORK CAPACITY;
NETWORK LOAD;
QUASI-DYNAMICS;
SCALABLE ROUTING;
SHORTEST PATH ALGORITHMS;
ROUTING ALGORITHMS;
|
EID: 33749800649
PISSN: 0743166X
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/INFCOM.1995.516009 Document Type: Conference Paper |
Times cited : (5)
|
References (12)
|