A low bound for broadcast in optical networks of bounded treewidth using fewest converters
Wavelengths and converters are shared by communication requests in optical networks. The usage of converters increases the utilization of wavelengths and allows more requests to succeed. The Converters Usage Problem (CUP) is to determine the minimum number of converter so that each node can send messages to all the others (broadcasting). In this paper, we study the CUP in sparse conversion networks with bounded treewidth. A converter wavelength-dominates a node if there is a uniform wavelength path between them. The Minimal Wavelength Dominating Set Problem (MWDSP) is to locate the minimum number of converters so that all the other nodes in the network are wavelength-dominated. We use a linear complexity dynamic programming algorithm to solve the MWDSP for networks with bounded treewidth. One such solution provides a low bound for the optimal solution to the CUP. © 2007 IEEE.
Publication Source (Journal or Book title)
Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference
Yi, T., Ding, G., & Oporowski, B. (2007). A low bound for broadcast in optical networks of bounded treewidth using fewest converters. Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference, 142-149. https://doi.org/10.1109/PCCC.2007.358889