✦ LIBER ✦

Designing reliable networks with short paths

✍ Scribed by S. L. Hantler; D. Milch

Publisher: Springer US
Year: 1993
Tongue: English
Weight: 504 KB
Volume: 1
Category: Article
ISSN: 1018-4864
DOI: 10.1007/bf02136154

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Designing reliable tree networks with tw

Designing reliable tree networks with two cable technologies

✍ Luis Gouveia; Eric Janssen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 957 KB

In this paper we introduce a minimal spanning tree problem with generalized hop constraints and primary connectivity constraints. The problem is concerned with reliability requirements in a centralized network design problem where two different cable technologies are available. The problem is shown

Designing reliable communication network

Designing reliable communication networks in a planned failure environment

✍ Inder M. Soi; K.K. Aggarwal 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 267 KB

Design of reliable networks

✍ Jan Rong-Hong 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 698 KB

The hierarchical network design problem

The hierarchical network design problem with multiple primary paths

✍ N.G.F. Sancho 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Optimum Arrangement of Reliable Label-Sw

Optimum Arrangement of Reliable Label-Switched Paths in MPLS Over Optical Networks

✍ Nagao Ogino; Hideaki Tanaka 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 697 KB

Redundant paths and reliability bounds i

Redundant paths and reliability bounds in gamma networks

✍ Indra Gunawan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 209 KB