A 10/7 + ∊ Approximation for Minimizing the Number of ADMs in SONET Rings

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Mordechai Shalom Articles by Shmuel Zaks

First International Conference on Broadband Networks (BROADNETS'04)

San Jose, California, USA

October 25-October 29

ISBN: 0-7695-2221-1

	ASCII Text	x
	Mordechai Shalom, Shmuel Zaks, "A 10/7 + ∊ Approximation for Minimizing the Number of ADMs in SONET Rings," Broadband Networks, International Conference on, pp. 254-262, First International Conference on Broadband Networks (BROADNETS'04), 2004.

	BibTex	x
	@article{ 10.1109/BROADNETS.2004.1, author = {Mordechai Shalom and Shmuel Zaks}, title = {A 10/7 + ∊ Approximation for Minimizing the Number of ADMs in SONET Rings}, journal ={Broadband Networks, International Conference on}, volume = {0}, year = {2004}, isbn = {0-7695-2221-1}, pages = {254-262}, doi = {http://doi.ieeecomputersociety.org/10.1109/BROADNETS.2004.1}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Broadband Networks, International Conference on TI - A 10/7 + ∊ Approximation for Minimizing the Number of ADMs in SONET Rings SN - 0-7695-2221-1 SP254 EP262 A1 - Mordechai Shalom, A1 - Shmuel Zaks, PY - 2004 KW - null VL - 0 JA - Broadband Networks, International Conference on ER -

Mordechai Shalom, Technion, Israel

Shmuel Zaks, Technion, Israel

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/BROADNETS.2004.1

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, more recent papers argue that the number of ADMs is a more realistic cost measure. Some of these works discuss various heuristic algorithms for this problem, and the best known result is a 3/2 approximation in [Traffic partition in wdm/sonet rings to minimize sonet adms]. Through the study of the re-lation between this problem and the problem of finding maximum disjoint rings in a given set of lightpaths we manage to shed more light onto this problem and to develop a 10/7 + ∊ approximation for it.

Citation:

Mordechai Shalom, Shmuel Zaks, "A 10/7 + ∊ Approximation for Minimizing the Number of ADMs in SONET Rings," broadnets, pp.254-262, First International Conference on Broadband Networks (BROADNETS'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.