Abstract
Traffic grooming techniques are used to combine low-speed data streams onto high-speed lightpaths with the objective of minimizing the network cost, or maximizing the network throughput. In this article, we present a complete suite of efficient Integer Linear Program (ILP) formulations for logical topology design and traffic grooming on mesh WDM networks. Our formulations can be easily modified to implement different objective functions and, contrary to previous formulations, our ILP formulation can be used to generate optimal solutions for practical sized networks with hundreds of requests. Our first set of formulations addresses the complete logical topology design traffic grooming problem, including RWA and traffic routing. The second set uses the simplifying assumption that RWA is not an issue. The last two sets address optimal traffic grooming alone, where the logical topology is already specified. We have studied these formulations, using simulation with networks having up to 30 nodes, and with hundreds and, in some cases, over a thousand low-speed data streams and have shown that the formulations are able to generate optimal solutions within a reasonable amount of time.
Similar content being viewed by others
References
Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)
Bandyopadhyay S.: Dissemination of Information in Optical networks. Springer, Heidleberg (2008)
Chen, B., Rouskas, G.N., Dutta, R.: A framework of hierarchical traffic grooming in wdm networks of general topology. In: Proceedings of IEEE/Create-Net BroadNets 2005, pp. 167–176, (2005)
Dutta R., Rouskas G.N.: A survey of virtual topology design algorithms for wavelength routed optical networks. Opt. Netw. Mag. 1(1), 73–89 (2000)
Dutta, R., Huang, S., Rouskas, G.N.: On optimal traffic grooming in elemental network topologies. In: Proceeding of Opticomm, pp. 13–24, October 2003
Dutta R., Rouskas G.N.: On optimal traffic grooming in wdm rings. IEEE J. Sel. Areas Commun. 20(1), 110–121 (2002)
Dutta R., Rouskas G.: Traffic grooming in wdm networks: past and future. IEEE Netw. 16(6), 46–56 (2002)
Gerstel, O., Lin, P., Sasaki, G.: Combined wdm and sonet network design. In: Proceeding of INFOCOM, pp. 734–743, (1999)
Gerstel O., Ramaswami R., Sasaki G.: Cost-effective traffic grooming in wdm rings. IEEE/ACM Trans. Netw. 8(5), 618–630 (2000)
Hu J.Q., Leida B.: Traffic grooming, routing, and wavelength assignment in optical wdm mesh networks. IEEE INFOCOM 1, 495–501 (2004)
Hu, J.Q., Modiano, E.: Chapter traffic grooming in WDM networks. In: Optical WDM Networks: Principles and Practice, Vol. II. Kluwer Academic Publication, Dordrecht (2004)
Ilog cplex 9.1. Documentation. http://www.columbia.edu/dano/resources/cplex91_man/index.html.
Jaekel, A., Bari, A., Bandyopadhyay, S.: Strategies for traffic grooming over logical topologies. In: Fifth International Symposium on Parallel and Distributed Processing and Applications (ISPA-07), vol. 4742, pp. 797–808. Springer LNCS, New York (2007)
Jaekel, A., Bari, A., Chen, Y., Bandyopadhyay S.: New techniques for efficient traffic grooming in wdm mesh networks. In: Proceedings of IEEE ICCCN, (2007)
Jarray A., Jaumard B.: Exact ilp solution for the grooming problem in wdm ring networks. IEEE Int. Conf. Commun.(ICC 2005) 3, 1708–1712 (2005)
Konda, V.R., Chow, T.Y.: Algorithm for traffic grooming in optical networks to minimize the number of transceivers. In: IEEE Workshop on High Performance Switching and Routing, pp. 218–221. May (2001)
Lee K., Shayman, M.A.: Optical network design with optical constraints in ip over wdm networks. In: Proceeding of ICCCN, October 2004
Lee K., Shayman A.M.: Rollout algorithms for logical topology design and traffic grooming in multihop wdm networks. IEEE Glob. Telecommun. Conf. (GLOBECOM) 4, 2113–2117 (2005)
Modiano E., Lin P.J.: Traffic grooming in wdm networks. IEEE Commun. Mag. 39(7), 124–129 (2001)
Mukherjee B.: Optical Communication Networks. McGraw-Hill, New York (1997)
Mukherjee B.: Wdm optical communication networks: progress and challenges. IEEE J. Sel. Areas Commun. 18(10), 1810–1824 (2000)
Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Ramamurthy R., Mukherjee B.: Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks. IEEE/ACM Trans. Netw. 10(3), 351–367 (2002)
Ramaswami R., Sivarajan K.N. (2002). Optical networks : a practical perspective. Morgan Kaufmann Publishers, San Francisco
Rouskas, G., Dutta, R.: Chapter design of logical topologies for wavelength routed networks. In: Optical WDM networks: principles and practice, pp. 79–102. Kluwer, Dordercht (2000)
Sahasrabudhe L., Ramamurthy S., Mukherjee B.: Fault management in ip-over-wdm networks: Wdm protection versus ip restoration. IEEE JSAC 20(1), 21–33 (2002)
Sridharan M., Salapaka M.V., Somani A.: A practical approach to operating survivable wdm networks. IEEE JSAC 20(1), 34–46 (2002)
Zang H., Jue J. P., Mukherjee B.: A review of routing and wavelength assignment approaches for wavelength- routed optical wdm networks. Opt. Netw. Mag. 18(10), 47–60 (2000)
Zang K., Mukherjee B.: A review of traffic grooming in wdm optical networks: architectures and challenges. Opt. Netw. Mag. 4(2), 55–64 (2003)
Zhang, Y., Wu, J., Yang, O.W.W., Savoie, M.: Lagrangian-relaxation based mesh traffic grooming for network profit optimization. In: IEEE Workshop on High Performance Switching and Routing (HPSRć605), pp. 406–410. (2005)
Zhu K., Mukherjee B.: Traffic grooming in an optical wdm mesh network. IEEE J. Sel. Areas Commun. 20(1), 122–133 (2002)
Zhu K., Zang H., Mukherjee B.: A comprehensive study on next-generation optical grooming switches. IEEE J. Sel. Areas Commun. 21(7), 1173–1186 (2003)
Zhu K., Zhu H., Mukherjee B.: Traffic Grooming in Optical WDM Mesh Networks. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jaekel, A., Bari, A., Chen, Y. et al. Strategies for optimal logical topology design and traffic grooming. Photon Netw Commun 19, 223–232 (2010). https://doi.org/10.1007/s11107-009-0227-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11107-009-0227-5