|
|||||
|
|
Routing and wavelength assignment for 3-ary n-cube communication patterns in linear array optical networks for n communication rounds |
|
| Authors: | Cui Yu Xiaofan Yang Jing Zhang Li He |
| Affiliation: | 1. College of Computer Science, Chongqing University, Chongqing, 400044, PR China;2. School of Electronic and Information Engineering, Southwest University, Chongqing, 400715, PR China;3. College of Computer Science, Chongqing University of Posts and Telecommunications, Chongqing, 400065, PR China |
| Abstract: | k-ary n-cubes are a class of communication patterns that are employed by a number of typical parallel algorithms. This paper addresses the implementation of parallel algorithms with bidirectional 3-ary n-cube communication patterns on a bidirectional linear array WDM optical networks when the information is transmitted one dimension after another. By giving an embedding scheme ?, we prove the optimal number of wavelengths under ? and design a routing and wavelength assignment strategy of it. |
| Keywords: | Combinatorial problems Interconnection networks WDM optical networks Linear array 3-ary n-cube Routing and wavelength assignment Congestion about dimensions |
| 本文献已被 ScienceDirect 等数据库收录！ | |