✦ LIBER ✦

Capacity assignment in computer communication networks with unreliable links

✍ Scribed by Debashis Saha; Amitava Mukherjee; Sourav K Dutta

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 372 KB
Volume: 17
Category: Article
ISSN: 0140-3664
DOI: 10.1016/0140-3664(94)90030-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Capacity assignment algorithm for packet

Capacity assignment algorithm for packet-switching network with unreliable links

✍ Tokumi Yokohira; Masashi Sugano; Takeshi Nishida; Hideo Miyahara 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 586 KB

Link capacity assignment in dynamic hier

Link capacity assignment in dynamic hierarchical networks

✍ Richard E. Nance; Robert L. Moose Jr. 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 949 KB

On the capacity assignment problem in pa

On the capacity assignment problem in packet-switching computer networks

✍ E.D. Sykas 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 903 KB

Topological design of a centralized comm

Topological design of a centralized communication network with unreliable links and node outage costs

✍ Amitava Dutta; Rakesh Kawatra 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 737 KB

Routing and capacity assignment in backb

Routing and capacity assignment in backbone communication networks under time varying traffic conditions

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

Reliable communication in networks with

Reliable communication in networks with Byzantine link failures

✍ Andrzej Pelc 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 925 KB

We consider the problem of communication between nodes of a network whose links are subject to arbitrary failures: A failed link may not only stop transmitting messages but may corrupt them in any possible way. We characterize networks allowing communication in spite of at most 1 failures. Also, for