✦ LIBER ✦

Design and Operation of Survivable Networks

✍ Scribed by Wayne Grover; David Tipper

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 54 KB
Volume: 13
Category: Article
ISSN: 1064-7570
DOI: 10.1007/s10922-005-1844-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Design of Survivable Networks: A survey

✍ Hervé Kerivin; A. Ridha Mahjoub 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 218 KB

Multiobjective design of survivable IP n

Multiobjective design of survivable IP networks

✍ Peter Broström; Kaj Holmberg 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 488 KB

Design of survivable IP-over-optical net

Design of survivable IP-over-optical networks

✍ Sylvie Borne; Eric Gourdin; Bernard Liau; A. Ridha Mahjoub 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 738 KB

Multi-hour design of survivable classica

Multi-hour design of survivable classical IP networks

✍ W. Ben-Ameur 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

Design of survivable WDM networks for ca

Design of survivable WDM networks for carrying ATM traffic

✍ N. Sreenath; P. Phanibhushan Rao; G. Mohan; C. Siva Ram Murthy 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 330 KB

Wavelength-division multiplexed networks using wavelength-routing are considered to be potential candidates for the next generation of wide-area backbone networks. In these networks, messages are carried in all-optical form using lightpaths. ATM is a widespread architecture and it is natural to exte

Constrained length connectivity and surv

Constrained length connectivity and survivable networks

✍ Walid Ben Ameur 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB

Some problems related to constrained length connectivity are addressed in this paper. Let S S S l l l (x x x, y y y) be the minimum number of vertices that should be removed to destroy all the paths of length at most l l l between two vertices x x x and y y y. Let I I I l l l (x x x, y y y) be the m