Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem

• Published in: Theoretical computer science Vol. 384; no. 2; pp. 250 - 262
• Main Authors: Shalom, Mordechai, Zaks, Shmuel
• Format: Journal Article Conference Proceeding
• Language: English
• Published: Amsterdam Elsevier B.V 01.10.2007; Elsevier
• Subjects: Add-Drop multiplexer (ADM); Applied sciences; Combinatorics; Combinatorics. Ordered structures; Computer science; control theory; systems; Designs and configurations; Exact sciences and technology; Geometry; Graph theory; Mathematics; Miscellaneous; Optical networks; Sciences and techniques of general use; SONET; Theoretical computing; Wavelength assignment; Wavelength division multiplexing (WDM); Optical networks; Add-Drop multiplexer (ADM); Wavelength assignment; Wavelength division multiplexing (WDM); SONET; Costs; Necessary and sufficient condition; Multiplexer; Node; Traffic; Assignment; Design; Trade; Optical fiber network; Maximum; Bandwidth; Computer; Division; Polygon; Communication; Architecture; Computer theory; Minimization; Wavelength division multiplexing; Joint; Wavelength; Necessary condition; Sufficient condition; Ring
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2007.04.021

SONET ADMs are dominant cost factors in WDM/SONET rings. Whereas most previous papers on the topic concentrated on the number of wavelengths assigned to a given set of lightpaths, recent papers argue that the number of ADMs is a more realistic cost measure. The minimization of this cost factor has been investigated in recent years, where single-hop and multi-hop communication models, with arbitrary traffic and uniform traffic loads have been investigated. As a first attempt to understand the trade-off between the number of wavelengths and the number of ADMs, we concentrate on the all-to-all, uniform traffic instance with multi-hop, splittable communication. We look for a solution which makes full use of the bandwidth and uses the minimum possible number of ADMs. We develop an architecture based on successive nested polygons and present a necessary and sufficient condition for a solution in this architecture to be feasible. This architecture leads to a solution using O ( W log W + N ) ADMs where W is the number of wavelengths used, and N is the number of nodes in the ring. This is a substantial improvement compared to N W ADMs for the basic architecture in [O. Gerstel, P. Lin, G. Sasaki, Combined wdm and sonet network design, in: INFOCOM’99, Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, 1999, pp. 734–743], and optimal for W = O ( N / log N ) . We further improve this result to O ( W log W ¯ + N ) ADMs, where W ¯ = o ( W ) . This architecture constitutes a solution for the traffic grooming problem, which is the subject of many recent works.