✦ LIBER ✦

Traffic grooming on general topology WDM networks

✍ Scribed by Li, D.; Sun, Z.; Jia, X.; Makki, K.

Book ID: 114449196
Publisher: The Institution of Electrical Engineers
Year: 2003
Tongue: English
Weight: 359 KB
Volume: 150
Category: Article
ISSN: 1350-2425
DOI: 10.1049/ip-com:20030272

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Virtual topology reconfiguration on opti

Virtual topology reconfiguration on optical WDM networks considering traffic grooming

✍ Ilker Akgun; Feza Buzluca 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 712 KB

Traffic grooming in WDM networks

✍ Modiano, E. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 85 KB

Logical topology design for dynamic traf

Logical topology design for dynamic traffic grooming in WDM optical networks

✍ Chunsheng Xin; Bin Wang; Xiaojun Cao; Li, J. 📂 Article 📅 2006 🏛 Optical Society of America 🌐 English ⚖ 319 KB

Resilient traffic grooming for WDM netwo

Resilient traffic grooming for WDM networks

✍ Jaekel, Arunita; Bari, Ataul; Bandyopadhyay, Subir 📂 Article 📅 2008 🏛 Optical Society of America 🌐 English ⚖ 125 KB

Dynamic multicast traffic grooming in WD

Dynamic multicast traffic grooming in WDM networks

✍ Xiao-jun Cheng; Ning Ge; Chong-xi Feng 📂 Article 📅 2006 🏛 SP Higher Education Press 🌐 English ⚖ 369 KB

Traffic grooming in bidirectional WDM ri

Traffic grooming in bidirectional WDM ring networks

✍ Jean-Claude Bermond; Xavier Muñoz; Ignasi Sau 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB

## Abstract 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 valu