✦ LIBER ✦

Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks

✍ Scribed by Żotkiewicz, M.; Ben-Ameur, W.; Pióro, M.

Book ID: 117887473
Publisher: IEEE
Year: 2010
Tongue: English
Weight: 159 KB
Volume: 14
Category: Article
ISSN: 1089-7798
DOI: 10.1109/lcomm.2010.08.100653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for finding an optimal set of

Algorithms for finding an optimal set of short disjoint paths in a communication network

✍ Torrieri, D. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 461 KB

A localized algorithm for finding disjoi

A localized algorithm for finding disjoint paths in wireless sensor networks

✍ Ronghui Hou; Haoshan Shi 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 77 KB

Finding Edge-disjoint Paths in Networks:

Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm

✍ Maria J. Blesa; Christian Blum 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 935 KB

An adaptive stabilizing algorithm for fi

An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks

✍ Rachid Hadid; Mehmet Hakan Karaata 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 938 KB

Network structure and spare path capacit

Network structure and spare path capacity reduction for path failure restoration method using diversity coding

✍ Tokuhiro Kitami 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

Efficient Algorithms for Finding the Max

Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

✍ Wun-Tat Chan; Francis Y.L. Chin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 366 KB

In a rectangular grid, given two sets of nodes, S S sources and T T sinks , of size 2 Ž . each, the disjoint paths DP problem is to connect as many nodes in S S to the Ž nodes in T T using a set of ''disjoint'' paths. Both edge-disjoint and ¨ertex-disjoint . cases are considered in this paper. Note