Routing a permutation in the hypercube by two sets of edge disjoint paths
Journal of Parallel and Distributed Computing
Adaptive wavelength routing in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
All-to-all routing and coloring in weighted trees of rings
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
All-to-all optical routing in optimal chordal rings of degree four
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient collective communication in optical networks
Theoretical Computer Science
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Multiwavelength Optical Networks: A Layered Approach
Multiwavelength Optical Networks: A Layered Approach
Optical WDM Networks: Principles and Practice
Optical WDM Networks: Principles and Practice
Uniform Multi-hop All-to-All Optical Routings in Rings
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Efficient access to optical bandwidth
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
A general approach for all-to-all routing in multihop WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Multi-hop all-to-all optical routings in Cartesian product networks
Information Processing Letters
Routing and wavelength assignment for hypercube in array-based WDM optical networks
Journal of Parallel and Distributed Computing
On conflict-free all-to-all broadcast in one-hop optical networks of arbitrary topologies
IEEE/ACM Transactions on Networking (TON)
Wavelength assignment for all-to-all broadcast in WDM optical linear array with limited drops
Computer Communications
Hypercube communications on optical chordal ring networks with chord length of three
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Routing and wavelength assignment for 3-ary n-cube in array-based optical network
Information Processing Letters
Review: A comparison of wavelength reservation protocols for WDM optical networks
Journal of Network and Computer Applications
Reliable collective communications with weighted SRLGs in optical networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Wavelength-division multiplexing (WDM) optical networks provide huge bandwidth by allowing multiple data streams transmitted simultaneously along the same optical fiber, with each stream assigned a distinct wavelength. A key issue on WDM optical networks is to minimize the number of wavelengths for communications. All-to-all broadcast (gossiping) is a fundamental communication application on computer/communication networks. It is known that the minimum numbers of wavelengths for realizing gossiping in one-hop of optical routing on the ring and the two-dimensional torus of N nodes are cN^2 and cN^{3/2}, c\approx 1/8, respectively. These numbers can be too large even for moderate values of N. One approach to reduce the number of wavelengths is to realize gossiping in multihops of routing. We give routing algorithms which realize gossiping in k{\hbox{-}}\rm hops (k\geq 2) by O(N^{1+1/k}) wavelengths on the ring, O(N^{1+1/(2k)}) wavelengths on the 2D torus, and O(N^{1+1/(3k)}) wavelengths on the 3D torus on a simple multihop routing model. We also discuss the multihop routing for gossiping on a merge model. We give the upper bounds on the numbers of wavelengths for gossiping in two-hops and three-hops for the ring, 2D torus, and 3D torus on the merge model.