Back to Search
Start Over
On the restricted forwarding index problem in communication networks
- Source :
-
Computers & Mathematics with Applications . May2007, Vol. 53 Issue 11, p1633-1643. 11p. - Publication Year :
- 2007
-
Abstract
- Abstract: 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 08981221
- Volume :
- 53
- Issue :
- 11
- Database :
- Academic Search Index
- Journal :
- Computers & Mathematics with Applications
- Publication Type :
- Academic Journal
- Accession number :
- 25352145
- Full Text :
- https://doi.org/10.1016/j.camwa.2006.12.020