A 10/7 + ε approximation for minimizing the number of ADMs in SONET rings

Proceedings - First International Conference on Broadband Networks, BroadNets 2004

Volumn , Issue , 2004, Pages 254-262

  Shalom, Mordechai ^a   Zaks, Shmuel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ADD/DROP MULTIPLEXERS (ADM); BLOCKING PROBABILITIES; LIGHTPATHS; OPTICAL CHANNELS;

APPROXIMATION THEORY; BANDWIDTH; COSTS; ELECTRONIC EQUIPMENT; MATHEMATICAL MODELS; OPTICAL COMMUNICATION; THEOREM PROVING; WIRELESS TELECOMMUNICATION SYSTEMS;

WAVELENGTH DIVISION MULTIPLEXING;

EID: 19544379852     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BROADNETS.2004.1     Document Type: Conference Paper

References (11)

1. G. Cǎlinescu and P.-J. Wan. Traffic partition in wdm/sonet rings to minimize sonet adms. In 15th International Parallel and Distributed Processing Symposium, 2001.
2. T. Eilam. Cost Vs. Quality, Tradeoffs in Communication Networks. PhD thesis, Faculty of Computer Science, TechnionIsrael Institute of Technology, Feb 2000.
3. T. Eilam, S. Moran, and S. Zaks. Lightpath arrangement in survivable rings to minimize the switching cost. IEEE Journal of Selected Area on Communications, 20(1):172-182, Jan 2002.
4. L. Epstein and A. Levin. Better bounds for minimizing sonet adms. To appear in WAOA, Workshop on Approximation and Online Algorithms, Sep 2004.
5. O. Gerstel, P. Lin, and G. Sasaki. Wavelength assignment in a wdm ring to minimize cost of embedded sonet rings. In Infocom'98, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, volume 1, pages 69-77, 1998.
6. O. Gerstel, P. Lin, and G. Sasaki. Combined wdm and sonet network design. In INFOCOM'99, Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, volume 2, pages 734-43, 1999.
7. C. A. J. Hurkens and A. Schrijver. 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 Journal Of Discrete Mathematics, 2(1):68-722, Feb 1989.
8. S. Khanna. A polynomial time approximation scheme for the sonet ring loading problem. Bell Labs Technical Journal, pages 36-41, Spring 1997.
9. L. Liu, X. Li, P.-J. Wan, and O. Frieder. Wavelength assignment in a wdm rings to minimize sonet adms. In INFOCOM'2000, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Tel-Aviv, Israel, pages 1020-1025, 2000.
10. P. Wan, G. Cǎlinescu, L.-W. Liu, and O. Frieder. Grooming of arbitrary traffic in sonet/wdm rings. IEEE Journal of Selected Area on Communications, 18(10): 1995-2003, 2000.
11. G. Wilfong and P. Winkler. Ring routing and wavelength translation. In Proceedings of the ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98, San Francisco, California, pages 333-341, Jan 1998.