✦ LIBER ✦

Tree-forming reversible routes in communication networks

✍ Scribed by Alistair A.R. Cockburn

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 1015 KB
Volume: 16
Category: Article
ISSN: 0169-7552
DOI: 10.1016/0169-7552(89)90075-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Routing in packet-switched communication

Routing in packet-switched communication networks

✍ Hasan Pirkul; Ali Amiri 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 868 KB

Route selection in backbone data communi

Route selection in backbone data communication networks

✍ Sridhar Narasimhan; Hasan Pirkul; Prabuddha De 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 961 KB

Routing optimization in packet switching

Routing optimization in packet switching communication networks

✍ Z. Flikop 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 506 KB

Minimizing number of wavelengths in mult

Minimizing number of wavelengths in multicast routing trees in WDM networks

✍ Deying Li; Xiufeng Du; Xiaodong Hu; Lu Ruan; Xiaohua Jia 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

Primary and secondary route selection in

Primary and secondary route selection in backbone communication networks

✍ Ali Amiri; Hasan Pirkul 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 752 KB

Optimal routings in communication networ

Optimal routings in communication networks with linearly bounded forwarding index

✍ Manoussakis, Yannis; Tuza, Zsolt 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB 👁 1 views

In a given graph with n vertices, a routing is defined as a set of n(n -1) routes, one route connecting each ordered pair of vertices. The load of a vertex is the number of routes going through it. The forwarding index of the graph is the minimum of the largest load taken over all routings. We const