DocumentCode :
2422858
Title :
Upgrading and protecting traffic in an optical network by bottleneck-cut identification
Author :
Zhu, K. ; Sahasrabuddhe, L. ; Mukherjee, B.
Author_Institution :
Dept. of Comput. Sci., California Univ., Davis, CA, USA
Volume :
4
fYear :
2000
fDate :
7-10 March 2000
Firstpage :
87
Abstract :
An optical network can be cost-effectively upgraded by enhancing the capacity of links in the "bottleneck-cut". The "bottleneck-cut" information is also important for network protection. We develop and evaluate an algorithm for finding the "bottleneck-cut".
Keywords :
Internet; matrix algebra; optical fiber subscriber loops; telecommunication traffic; bottleneck-cut identification algorithm; bottleneck-cut optical fibre networks; fibre link capacity; network protection; optical network; traffic protection; traffic upgrade; Computer networks; Computer science; Heuristic algorithms; IP networks; Intelligent networks; Network topology; Optical computing; Optical fiber networks; Protection; Telecommunication traffic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Optical Fiber Communication Conference, 2000
Conference_Location :
Baltimore, MD, USA
Print_ISBN :
1-55752-630-3
Type :
conf
DOI :
10.1109/OFC.2000.869424
Filename :
869424
Link To Document :
بازگشت