Abstract
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. The number of SONET ADMs required by a set of traffic streams (lightpaths) in a ring is determined by the routing and the wavelength assignment of the traffic streams. We consider both the arc version where the route of each traffic stream is given as input, and the chord version, where the routing is to be decided by the algorithm. The goal in both cases is to assign wavelengths so as to minimize the total number of used SONET ADMs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cǎlinescu G, Frieder O, Wan P-J (2002) Minimizing electronic line terminals for automatic ring protection in general WDM optical networks. IEEE J Selected Area Commun 20: 183–189
Cǎlinescu G, Wan P-J (2002) Traffic partition in WDM/SONET rings to minimize SONET ADMs. J Comb Optim 6: 425–453
Eilam T, Moran S, Zaks S (2002) Lightpath arrangement in survivable rings to minimize the switching cost. IEEE J Selected Area Commun 20: 172–182
Epstein L, Levin A (2009) Better bounds for minimizing SONET ADMs. Journal of Computer and Systems Sciences 75(2): 122–136
Epstein L, Levin A (2005) The chord version for SONET ADMs minimization. Theor Comput Sci 349(3): 337–346
Flammini M, Shalom M, Zaks S (2009) On minimizing the number of ADMs in a general topology optical network. Discret Appl Math 157(12): 2701–2717
Flammini M, Shalom M, Zaks S (2007) On minimizing the number of ADMs—Tight bounds for an algorithm without preprocessing. J Parallel Distrib Comput 67(4): 448–455
Gerstel O, Lin P, Sasaki G (1998) Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings. Proc INFOCOM 1: 94–101
Hurkens CAJ, Schrijver A (1989) On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J Discrete Math 2(1): 68–72
Liu L, Li X, Wan P-J, Frieder O (2000) Wavelength assignment in WDM rings to minimize SONET ADMs. Proc INFOCOM 2: 1020–1025
Schrijver A (2003) Combinatorial optimization polyhedra and efficiency. Springer, Berlin
Shalom M, Zaks S (2007) A 10/7 + ε approximation for minimizing the number of ADMs in SONET rings. IEEE/ACM Trans Netw 15(6): 1593–1602
Wan P-J, Cǎlinescu G, Liu L, Frieder O (2000) Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE J Selected Areas Commun 18: 1995–2003
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by R. Weismantel.
Rights and permissions
About this article
Cite this article
Epstein, L., Levin, A. & Menahem, B. Minimization of SONET ADMs in ring networks revisited. Computing 87, 3–19 (2010). https://doi.org/10.1007/s00607-009-0072-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-009-0072-5