Abstract
In this article we consider the problem of minimizing the congestion in logically rearrangeable multihop lightwave networks. Namely, we consider a network in which each node is equipped with a small number of transmitters and receivers, and tuning a transmitter at nodei and a receiver at nodej to the same wavelength creates a logical link (i, j) through which traffic could be sent. For a given traffic matrix-the matrix of flows between nodes—the objective is to find the best connectivity diagram and the corresponding flow assignment so that the maximal flow on any link is minimized. We develop a tabu search heuristic that yields a suboptimal connectivity diagram and an optimal flow assignment on it. Computational experiments are conducted on some benchmark data sets, on a real-world traffic matrix, and on some randomly generated problems of larger dimension. The results are compared with known results from the literature and with a known greedy approach. The results suggest that a tabu search—based heuristic is a promising approach for handling this NP-hard combinatorial problem. In addition, we discuss the performance of the method in view of different patterns of input data.
Similar content being viewed by others
References
Banerjee, S., and Mukherjee, B. (1993). Algorithms for optimized node arrangments in shufflenet based multihop lightwave networks.Proceedings of Infocom '93. San Francisco: Intocom.
Banerjee, S., Mukherjee, B., and Sarkar, D. (1994). Heuristic algorithms for constructing optimized structures of linear multihop lightwave networks.IEEE Transactions on Communications, 1811–1826.
Bienstock, D., and Günlük, O. (1995). Computational experience with a difficult mixed-integer multicommodity flow problem.Mathematical Programming, 68, 213–237.CPLEX 3.0 (1994). CPLEX Optimization, Inc., Incline Village, NV.
Fratta, L., Gerla, M., and Kleinrock, L. (1993). The flow deviation method: An approach to store-and-forward computer-communication network design.Networks, 3, 97–133.
Glover, F. (1989). Tabu search: part i.ORSA Journal on Computing, 1(3), 190–206.
Glover, F. (1990). Tabu search: part ii.ORSA Journal on Computing, 2(1), 4–32.
Glover, F. (1995). Tabu search fundamentals and uses. Research Report, College of Business and Administration, University of Colorado, Boulder, CO 80309.
Labourdette, J.-F. (1991). Rearranging techniques for multihop lightwave networks and application to distributed ATM switching systems. Ph.D. thesis and Tech. Report CU/CTR/TR 244-91-25, Center for Telecommunications Research, Columbia University, New York.
Labourdette, J.-F. (1995). Traffic optimization and multihop reconfiguration management of multiwavelength Lightwave networks. Working paper, submitted for publication.
Labourdette, J.-F., and Acampora, A. (1991). Logically rearrangeable multihop lightwave networks.IEEE Transactions on Communications, 39, 1223–1230.
Mukherjee, B. (1992). WDM-based local lightwave networks part II: Multihop systems.IEEE Network Magazine, July, 20–32.
Mukherjee, B., Rammamurthy, S., Banerjee, D., and Mukherjee, A. (1994). Some principles for designing a wide-area optical network.Proceedings Infocom '94. Toronto, Canada: Intocom.
Yener, B., and Boult, E. (1994). A study of upper and lower bounds for minimum congestion routing in lightwave networks.Proceedings of Infocom '94. Toronto, Canada: Infocom.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Skorin-Kapov, J., Labourdette, JF. On minimum congestion routing in rearrangeable multihop lightwave networks. J Heuristics 1, 129–145 (1995). https://doi.org/10.1007/BF02430369
Issue Date:
DOI: https://doi.org/10.1007/BF02430369