A Fast Algorithm for Optimally Increasing the Edge Connectivity
SIAM Journal on Computing
Efficient Collective Communication in Optical Networks
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Multihop All-to-All Broadcast on WDM Optical Networks
IEEE Transactions on Parallel and Distributed Systems
Optical Network Control: Architecture, Protocols, and Standards
Optical Network Control: Architecture, Protocols, and Standards
IP Over WDM: building the next-generation optical internet
IP Over WDM: building the next-generation optical internet
Architectural study of high-speed networks with optical bypassing
Architectural study of high-speed networks with optical bypassing
Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)
Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)
Computing finest mincut partitions of a graph and application to routing problems
Discrete Applied Mathematics
IEEE Journal on Selected Areas in Communications
Reliable collective communications with weighted SRLGs in optical networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
In this paper, we investigate the problem of all-to-all broadcast in optical networks, also known as gossiping. This problem is very important in the context of control plane design as it relates to status information dissemination. We present a routing and wavelength assignment (RWA) method to reduce the number of wavelengths such that the communication is conflict-free in a wavelength division multiplexing (WDM) optical environment without wavelength converters. Our approach utilizes the tap-and-continue capability of the optical nodes. The network topology is considered to be arbitrary as long as it is connected. Both cases of maximally and nonmaximally edge-connected graphs are studied. For the first case, we give a closed-form expression for the lower bound on the number of wavelengths, which is an elegant extension of the results in 7 for concurrent broadcast trees in optical networks. Furthermore, we show how to achieve this bound. The second case is more involved and requires a specific procedure to achieve the minimum number of wavelengths. For this case, we provide an attractive method for the RWA algorithm that attempts to minimize the number of wavelengths. Our solution for this case is within a constant factor that is strictly less than 2 from the optimal solution. The proposed algorithm uses the concept of "cactus" representation of all minimum edge-cuts in a graph in a novel recursive approach.