Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Routing and wavelength assignment for hypercube in array-based WDM optical networks|
|Citation:||Journal of Parallel and Distributed Computing, 2010; 70(1):59-68|
|Publisher:||Academic Press Inc Elsevier Science|
|Yawen Chen and Hong Shen|
|Abstract:||Hypercube is one of the most versatile and efficient communication patterns shared by a large number of computational problems. As the number of edges in hypercube grows logarithmically with the size of networks, the complexity of network topologies can be significantly reduced to realize hypercube in optical networks by taking advantage of the parallel transmission characteristic of optical fibers. In this paper, we study the routing and wavelength assignment for realizing hypercube on WDM optical networks including linear arrays and rings with the consideration of communication directions. Specifically, we analyze this problem for both bidirectional and unidirectional hypercubes. For each case, we identify a lower bound on the number of wavelengths required, and design the embedding scheme and wavelength assignment algorithm that uses a provably near-optimal number of wavelengths. In addition, we extend the results to meshes and tori. By our embedding schemes, many algorithms, originally designed based on hypercubes, can be applied to optical networks, and the wavelength requirements can be easily derived using our obtained results.|
|Keywords:||Graph embedding; Hypercube; Optical network; Routing and wavelength assignment (RWA); Wavelength division multiplexing (WDM)|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.