The channel assignment algorithm on RP(k) networks

Authors:
Fang’ai Liu;Xinhua Wang;Liancheng Xu
Affiliations:
Computer Science Department, ShanDong Normal University, Jinan, China;Computer Science Department, ShanDong Normal University, Jinan, China;Computer Science Department, ShanDong Normal University, Jinan, China
Venue:
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Year:
2005

Citing 7
Cited 0

On Embedding Between 2D Meshes of the Same Size

IEEE Transactions on Computers
Off-line permutation embedding and scheduling in multiplexed optical networks with regular topologies

IEEE/ACM Transactions on Networking (TON)
Distributed Path Reservation Algorithms for Multiplexed All-Optical Interconnection Networks

IEEE Transactions on Computers
Optical networks: a practical perspective

Optical networks: a practical perspective
Converter Placement Supporting Broadcast in WDM Optical Networks

IEEE Transactions on Computers
Performance of multi-hop commmunications using logical topologies on optical torus networks

Journal of Parallel and Distributed Computing
Optimal Routing and Channel Assignments for Hypercube Communication on Optical Mesh-like Processor Arrays

MPPOI '98 Proceedings of the The Fifth International Conference on Massively Parallel Processing Using Optical Interconnections

Quantified Score

Hi-index	0.00

Visualization

Abstract

Embedding and channel assignment is a key topic in optical interconnection networks. Based on RP(k) network, a scheme to embed a hypercube into RP(k) is given and the wavelength assignment of realizing the Hypercube communication on RP(k) network is discussed in this paper. By introducing the reverse order of Hypercube, an algorithm to embed the n-Dimension Hypercube into RP(k) is designed, which multiplexes at most max{2, $\lfloor5 * {N} / 96 \rfloor\}$ wavelengths. An algorithm to embed the n-Dimension Hypercube into the ring network is also proposed, with its congestion equal to $\lfloor{ N} / 3 + {N} / 12 \rfloor$. It is a better improvement than the known result, which is equal to $\lfloor{N} / 3 + { N} / 4 \rfloor$. The analyses prove that it is easier to realize the Hypercube communication on RP(k) network.