DocumentCode
2989614
Title
An Efficient Hierarchical Optical Path Network Design Algorithm based on a Traffic Demand Expression in a Cartesian Product Space
Author
Yagyu, Isao ; Hasegawa, Hiroshi ; Sato, Ken-Ichi
fYear
2006
fDate
24-28 Sept. 2006
Firstpage
1
Lastpage
2
Abstract
We propose a hierarchical optical path network design algorithm that employs neighboring optical path grouping based on a traffic demand expression in a Cartesian product space. Simulation results prove that the proposed algorithm is more effective current alternatives.
Keywords
Algorithm design and analysis; Clustering algorithms; Costs; IP networks; Iterative algorithms; Optical design; Optical fiber networks; Spine; Telecommunication traffic; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Optical Communications, 2006. ECOC 2006. European Conference on
Conference_Location
Cannes, France
Print_ISBN
978-2-912328-39-7
Electronic_ISBN
978-2-912328-39-7
Type
conf
DOI
10.1109/ECOC.2006.4801091
Filename
4801091
Link To Document