Dynamic traffic grooming in WDM mesh networks using a novel graph model
Authors:
- Hui ZangHZHui Zang
- Keyao ZhuKZKeyao Zhu
- B. MukherjeeBMB. Mukherjee
- 22 December 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 2681-2685
Abstract
We employ a new, generic graph model for dynamic traffic grooming in WDM mesh networks. The novelty of this model is that, by only manipulating the edges of an auxiliary graph created by the model and the weights of these edges, the model can achieve various objectives using different grooming policies, while taking into account various constraints. Based on the auxiliary graph, we develop a dynamic traffic-grooming algorithm. Different grooming policies can be implemented by different weight functions assigned to the edges in the auxiliary graph. We propose four fixed grooming policies and an adaptive grooming policy (AGP), and our results show that AGP outperforms the fixed grooming policies.Keywords
This publication has 3 references indexed in Scilit:
- Traffic grooming in an optical WDM mesh networkIEEE Journal on Selected Areas in Communications, 2002
- An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM ringsIEEE/ACM Transactions on Networking, 2000
- Cost-effective traffic grooming in WDM ringsIEEE/ACM Transactions on Networking, 2000