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
On the restricted forwarding index problem in communication networks
β Scribed by Min Xu; Xujin Chen; Xiaodong Hu
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 319 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
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 natural question is what is the maximum number of node pairs that can communicate synchronously with the load restriction? In this paper, we first show that the problem is NP-complete. Then we present two approximation algorithms for the problems under the node load constraint and the link load constraint, respectively.
π SIMILAR VOLUMES
## 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