ON THE ISOCHRONOUS PATHS SELECTION PROBLEM IN AN INTERCONNECTED WDM NETWORK

In this paper, a new wavelength division multiplexing (WDM) interconne ction architecture for supporting both isochronous and asynchronous tr affic is proposed. Based on this architecture, the problem of allocati ng an isochronous bandwidth is investigated, We show that given a set of established isochronous connections and a set of new isochronous re quests, the problem of using a minimal amount of an isochronous bandwi dth to serve this isochronous traffic, including the established conne ctions and new requests, is NP-hard, On the other hand, given a limite d isochronous bandwidth, the goal is to establish a maximal number of isochronous connections. An efficient isochronous paths selection algo rithm, based on the concept of paths merging and splitting, is also pr oposed for this problem, The proposed algorithm is evaluated by simula tion, Simulation results show that for a limited isochronous bandwidth , the proposed algorithm can achieve high performance in terms of isoc hronous slots utilization, call blocking rate, and the number of succe ssfully established isochronous connections.