By Topic

On the isochronous paths selection problem in an interconnected WDM network

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)
Nen-Fu Huang ; Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Guan-Hsiung Liaw ; Chung-Ching Chiou

In this paper, a new wavelength division multiplexing (WDM) interconnection architecture for supporting both isochronous and asynchronous traffic is proposed. Based on this architecture, the problem of allocating an isochronous bandwidth is investigated. We show that given a set of established isochronous connections and a set of new isochronous requests, the problem of using a minimal amount of an isochronous bandwidth to serve this isochronous traffic, including the established connections and new requests, is NP-hard. On the other hand, given a limited isochronous bandwidth, the goal is to establish a maximal number of isochronous connections. An efficient isochronous paths selection algorithm, based on the concept of paths merging and splitting, is also proposed for this problem. The proposed algorithm is evaluated by simulation. Simulation results show that for a limited isochronous bandwidth, the proposed algorithm can achieve high performance in terms of isochronous slots utilization, call blocking rate, and the number of successfully established isochronous connections

Published in:

Journal of Lightwave Technology  (Volume:14 ,  Issue: 3 )