Premium
Traffic grooming in bidirectional WDM ring networks
Author(s) -
Bermond JeanClaude,
Muñoz Xavier,
Sau Ignasi
Publication year - 2011
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20410
Subject(s) - traffic grooming , multiplexer , wavelength division multiplexing , mathematics , combinatorics , ring network , ring (chemistry) , graph , upper and lower bounds , shortest path problem , unitary state , multiplexing , discrete mathematics , topology (electrical circuits) , computer science , telecommunications , computer network , network topology , physics , wavelength , mathematical analysis , chemistry , optoelectronics , organic chemistry , political science , law
We study the minimization of ADMs (Add‐Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all‐to‐all unitary requests. We precisely formulate the problem in terms of graph decompositions, and state a general lower bound for all the values of the grooming factor C and N , the size of the ring. We first study exhaustively the cases C = 1, C = 2, and C = 3, providing improved lower bounds, optimal constructions for several infinite families, as well as asymptotically optimal constructions and approximations. We then study the case C > 3, focusing specifically on the case C = k ( k + 1)/2 for some k ≥ 1. We give optimal decompositions for several congruence classes of N using the existence of some combinatorial designs. We conclude with a comparison of the cost functions in unidirectional and bidirectional WDM rings. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 58(1), 20–35 2011