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
The forwarding index of communication networks with given connectivity
β Scribed by W.Fernandez de la Vega; Y. Manoussakis
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 936 KB
- Volume
- 37-38
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
## Abstract Design of experiments (DOE) is gaining acceptance in the community of telecommunication researchers, especially during the past several years. In this paper, a stateβofβtheβart review on the use of DOE in the field of communication networks is presented, and the need for introducing a s