By Topic

An efficient hierarchical optical path network design algorithm based on a traffic demand expression in a cartesian product space

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Isao Yagyu ; Dept. of Electr. Eng. & Comput. Sci., Nagoya Univ., Nagoya ; Hiroshi Hasegawa ; Ken-ichi Sato

We propose a hierarchical optical path network design algorithm. In order to efficiently accommodate wavelength paths in each waveband path, we define a source-destination Cartesian product space that allows the 'closeness' among wavelength paths to be assessed. By grouping 'close' wavelength paths, found by searching for clusters in the space, we iteratively create waveband paths that efficiently accommodate the wavelength paths. Numerical experiments demonstrate that the proposed algorithm offers lower total network cost than the conventional algorithms. The results also show that the hierarchical optical path network is effective even when traffic demand is relatively small.

Published in:

IEEE Journal on Selected Areas in Communications  (Volume:26 ,  Issue: 6 )