Traffic grooming on general topology WDM networks

Traffic grooming on general topology WDM networks

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IEE Proceedings - Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The authors consider the traffic grooming problem on general topology WDM networks. The problem is: given a set of t connections, their routes and the grooming factor g, find an optimal wavelength assignment and grooming such that the number of wavelengths required in the network is minimised. This problem is first formulated as an integer linear programming problem, and then a heuristic is proposed to solve it. The simulation results show that increasing the grooming factor can considerably decrease the number of wavelengths required in the system.


    1. 1)
      • E. Modiano , P.J Lin . Traffic grooming in WDM networks. IEEE Commun. Mag. , 124 - 129
    2. 2)
      • Gerstel, O., Lin, P., Sasaki, G.: `Wavelength assignment in a WDM ring to minimise the cost of embedded SONET rings', Proceedings of INFOCOM, 1998, p. 94–101.
    3. 3)
      • Gerstel, O., Lin, P., Sasaki, G.: `Combined WDM and SONET network design', Proceedings of INFOCOM, 1999, p. 734–743.
    4. 4)
      • E. Modiano , A. Chiu . Traffic grooming algorithms for minimizing electronic multiplexing costs in unidirectional SONET/WDM ring networks. J. Lightwave Technol. , 1 , 2 - 12
    5. 5)
      • J. Simmons , A. Saleh . Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic. J. Lightwave Technol. , 1 , 48 - 57
    6. 6)
      • Chow, T.Y., Lin, P.J.: ‘The ring grooming problem’,
    7. 7)
      • X. Zhang , C. Qiao . An effective and comprehensive approach to traffic grooming and wavelength assignment in SONET/WDM rings. IEEE/ACM Trans. Netw. , 5 , 608 - 617
    8. 8)
      • R. Berry , E. Modiano . Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic. IEEE J. Sel. Areas Commun. , 1961 - 1971
    9. 9)
      • O. Gerstel , R. Ramaswami . Cost effective grooming in WDM rings. IEEE/ACM Trans. Netw. , 5 , 618 - 630
    10. 10)
      • Modiano, E., Berry, R.: `Using grooming cross-connects to reduce ADM costs in SONET/WDM ring networks', Proceedings of OFC 2001, Mar. 2001, Anaheim, CA, USA.
    11. 11)
      • Liu, L.W., Li, X.Y., Wan, P. J., Frieder, O.: `Wavelength assignment in WDM rings to minimise SONET ADMs', Proceedings of IEEE INFOCOM 2000, p. 1020–1025.
    12. 12)
      • Wang, J., Vemuri, V.R., Cho, W.H., Mukherjee, B.: `Improved approaches for cost-effective traffic grooming in WDM ring networks: nonuniform traffic and bi-directional ring', Proceedings of IEEE INFOCOM 2000, p. 1295–1299.
    13. 13)
      • Konda, V. R., Chow, T.Y.: `Algorithm for traffic grooming in optical networks to minimise the number of transceiver', Presented at IEEE Workshop on High performance switching and routing, 2001.
    14. 14)
      • D. Hochbaum . (1997) Approximation algorithms for NP-hard problems.
    15. 15)
      • A. Schrijver . (1998) Theory of linear and integer programming.
    16. 16)
      • S. Subramaniam , K.M. Sivalingam , S. Subramaniam . (2000) Blocking performance of wavelength-routing networks, Optical WDM networks: Principles and practice.
    17. 17)

Related content

This is a required field
Please enter a valid email address