Abstract
In wavelength routed optical networks, the number of wavelength channels is limited due to several constraints and each wavelength as well as each lightpath support traffic in the Gbps range. On the other hand, the traffic requested by an individual connection is still in the Mbps range. Therefore, to utilize the network resources (such as bandwidth and transceivers) effectively, several low-speed traffic streams have to be efficiently groomed or multiplexed into one or more high-speed lightpaths. The grooming problem of a static demand is considered as an optimization problem. In this work, we have investigated the traffic grooming problem with the objective of maximizing the network throughput for wavelength-routed mesh networks and map this problem to the clique partitioning problem. We have proposed an algorithm to handle general multi-hop static traffic grooming based on the clique partitioning concept. The efficiency of our approach has been established through extensive simulation on different sets of traffic demands with different bandwidth granularities for different network topologies and compared the approach with existing algorithms.
Similar content being viewed by others
References
Alsuwaiyel M.H.: Algorithms Design Techniques and Analysis. World Scientific Publishing Ltd, Singapore (2000)
Awwad, O., Al-fuqaha, A.I., Guizani, M.: Genetic approach for traffic grooming, routing, and wavelength assignment in WDM optical networks with sparse grooming resources. In: IEEE ICC 2006, pp. 2447–2452 (2006)
De, T., Pal, A., Sengupta, I.: Routing and wavelength assignment in all optical networks based on clique partitioning. In: ICDCN 2008, LNCS 4904, pp. 452–463 (2008)
Hu, J.Q., Leida, B.: Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks. In: IEEE INFOCOM 2004, pp. 495–501 (2004)
Huang S., Dutta R., Rouskas G.N.: Traffic grooming in path, star, and tree networks: complexity, bounds and algorithms. IEEE J. Sel. Areas Commun. 24(4), 66–82 (2006)
Konda, V.R., Chow, T.Y.: Algorithm for traffic grooming in optical networks to minimize the number of transceiver. In: IEEE Workshop High Performance Switching and Routing, pp. 218–221 (2001)
Lee, S., Lee, T.J., Chung, M.Y., Choo, H.: Traffic grooming algorithm using shortest EDPs table in WDM mesh networks. In: ICCS 2005, LNCS 3516, pp. 559–567 (2005)
Li, D., Sun, Z., Jia, X., Makki, S.: Traffic grooming for minimizing wavelength usage in WDM networks. In: IEEE ICCCN 2002, pp. 460–465 (2002)
Mohan G., SivaRam Murthy C.: WDM optical networks: concepts, design and algorithms. Prentice Hall, India (2001)
Pal, A., Patel, U.: Routing and wavelength assignment in wavelength division multiplexing networks. In: IWDC 2004, LNCS 3326, pp. 391–396 (2004)
Prathombutr P., Stach J., Park E.K.: An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives. J. Telecommun. Syst. 28(3–4), 369–386 (2005)
Xin, C., Qiao, C.: Performance analysis of multi-hop traffic grooming in mesh WDM optical networks. In: IEEE ICC 2003, pp. 237–242 (2003)
Xin, C., Wang, B.: Logical topology design for dynamic traffic grooming in mesh WDM optical networks. In: IEEE ICC 2005, pp. 1792–1796 (2005)
Xin, C., Ye, Y., Dixit, S., Qiao, C.: An agent-based traffic grooming and management mechanism for IP over optical networks. In: IEEE ICCCN 2002, pp. 425–430 (2002)
Xin C., Qiao C., Dixit S.: Traffic grooming in mesh WDM optical networks—performance analysis. IEEE J. Sel. Areas Commun. 22(9), 1658–1669 (2004)
Yao W., Ramamurthy B.: A link bundled auxiliary graph model for constrained dynamic traffic grooming in WDM mesh networks. IEEE J. Sel. Areas Commun. 23(8), 1542–1555 (2005)
Yao, W., Li, M., Ramamurthy, B.: Performance analysis of sparse traffic grooming in WDM mesh networks. In: IEEE ICC 2005, pp. 1766–1770 (2005)
Yoon, Y.R., Lee, T.J., Chung, M.Y., Choo, H.: Traffic grooming based on shortest path in optical WDM mesh networks. In: ICCS 2005, LNCS 3516, pp. 1120–1124 (2005)
Zang H., Jue J.P., Mukherjee B.: A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. SPIE Opt. Netw. Mag. 1(1), 47–60 (2000)
Zhu K., Mukherjee B.: Traffic grooming in an optical WDM mesh network. IEEE J. Sel. Areas Commun. 20(1), 122–133 (2002)
Zhu, H., Zang, H., Mukherjee, B.: Design of WDM mesh networks with sparse grooming capability. In: IEEE Globecom 2002, vol. 3, pp. 2696–2700 (2002)
Zhu H., Zang H., Zhu K., Mukherjee B.: A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE/ACM Trans. Netw. 11(2), 285–299 (2003)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
De, T., Pal, A. & Sengupta, I. Traffic grooming, routing, and wavelength assignment in an optical WDM mesh networks based on clique partitioning. Photon Netw Commun 20, 101–112 (2010). https://doi.org/10.1007/s11107-010-0250-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11107-010-0250-6