✦ LIBER ✦

Optimal routing designs in self-healing communications networks

✍ Scribed by Iraj Saniee

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 648 KB
Volume: 3
Category: Article
ISSN: 0969-6016
DOI: 10.1016/s0969-6016(96)00014-7

No coin nor oath required. For personal study only.

✦ Synopsis

Self-healing communication networks that allow re-routing of demands through switching processes at designated nodes are studied. It is shown how network utilization, demand throughput and reliability of such networks can be studied simultaneously to achieve an optimal design for all three. This is done through a max-min-max multi-commodity network flow formulation of the routing problem in which it is ensured that maximum network throughput is achieved with minimum loss of demands that are blocked due to single switching node failures. It is shown that a node-path linear programming approximation to the multi-commodity network flow formulation solves the problem for medium and large network sizes in moderate computational times.

📜 SIMILAR VOLUMES

Optimal routing in toroidal networks

✍ Izidor Jerebic; Roman Trobec 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 582 KB

Routing optimization in packet switching

Routing optimization in packet switching communication networks

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

Optimal routing in shortest-path data ne

Optimal routing in shortest-path data networks

✍ K. G. Ramakrishnan; Manoel A. Rodrigues 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 249 KB 👁 1 views

Optimal dynamic routing in Markov queuei

Optimal dynamic routing in Markov queueing networks

✍ Keith W. Ross 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Markov decision theory is applied to general Markov queueing networks with finite buffer capacity. Existence of optimal dynamic routing policies is proved for the long-run average and infinite-horizon discounted cases. With the aid of a process that is equivalent to the state process, the subordinat

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

Optimal packet fragmentation and routing

Optimal packet fragmentation and routing in computer networks

✍ Orda, Ariel; Rom, Raphael 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB 👁 1 views

The packet fragmentation problem in computer networks is that of breaking a packet into smaller pieces (fragments) due to packet-size limitations along the packet's route. This is a typical internetworking problem. We show that the commonly used simplistic approach whereby the routing and fragmentat