✦ LIBER ✦

Two-stage cut saturation algorithm for designing all-optical networks

✍ Scribed by Gaoxi Xiao; Yiu-Wing Leung; Kwok-Wak Hung

Book ID: 114558246
Publisher: IEEE
Year: 2001
Tongue: English
Weight: 301 KB
Volume: 49
Category: Article
ISSN: 0090-6778
DOI: 10.1109/26.930640

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-cut algorithm for solving a

A branch-and-cut algorithm for solving an intraring synchronous optical network design problem

✍ Lee, Youngho; Sherali, Hanif D.; Han, Junghee; Kim, Seong-in 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 2 views

In this paper, we deal with a network design problem arising from the deployment of synchronous optical networks (SONET), a standard of transmission using optical fiber technology. The problem is to find an optimal clustering of traffic demands in the network such that the total number of node assig

Two-stage EDA-based approach for all opt

Two-stage EDA-based approach for all optical WDM mesh network survivability under SRLG constraints

✍ Jianyong Sun 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 910 KB

An Autonomic Virtual Topology Design and

An Autonomic Virtual Topology Design and Two-Stage Scheduling Algorithm for Light-Trail WDM Networks

✍ Gumaste, A.; Das, T.; Mathew, A.; Somani, A. 📂 Article 📅 2011 🏛 The Optical Society 🌐 English ⚖ 452 KB