✦ LIBER ✦

The forwarding index of directed networks

✍ Scribed by Yannis Manoussakis; Zsolt Tuza

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 940 KB
Volume: 68
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00072-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The forwarding index of communication ne

The forwarding index of communication networks with given connectivity

✍ W.Fernandez de la Vega; Y. Manoussakis 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 936 KB

On the restricted forwarding index probl

On the restricted forwarding index problem in communication networks

✍ Min Xu; Xujin Chen; Xiaodong Hu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 319 KB

In a communication network it is desirable that all pairs of nodes can exchange messages at the same time. But under the capacity constraints on nodes or links this desired property may not be satisfied; only some node pairs can communicate with each other while the rest have to be blocked. A natura

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

The forwarding indices of wrapped butter

The forwarding indices of wrapped butterfly networks

✍ Xinmin Hou; Jun-Ming Xu; Min Xu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB

## Abstract Let __G__ be a connected graph. A routing in __G__ is a set of fixed paths for all ordered pairs of vertices in __G__. The forwarding index of __G__ is the minimum of the largest number of paths specified by a routing passing through any vertex of __G__ taken over all routings in __G__.

The edge-forwarding index of orbital reg

The edge-forwarding index of orbital regular graphs

✍ Patrick Solé 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 351 KB

We define a graph as orbital regular if there is a subgroup of its automorphism group that acts regularly on the set of edges of the graph as well as on all its orbits of ordered pairs of distinct vertices of the graph. For these graphs there is an explicit formula for the edgeforwarding index, an i

Computation of the forwarding index via

Computation of the forwarding index via flows: A note

✍ W. Fernandez de le Vega; Y. Manoussakis 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB

## Abstract In a given network 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 network is the minimum of the largest load tak