On the restricted forwarding index problem in communication networks

Authors:
Min Xu;Xujin Chen;Xiaodong Hu
Affiliations:
School of Mathematical Sciences, Beijing Normal University, Beijing, 100875, PR China and Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, ...;Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100080, PR China;Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100080, PR China
Venue:
Computers & Mathematics with Applications
Year:
2007

Citing 6
Cited 0

The forwarding index of communication networks

IEEE Transactions on Information Theory
On forwarding indices of networks

Discrete Applied Mathematics
Complexity of the forwarding index problem

SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Theory With Applications

Graph Theory With Applications
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks

Quantified Score

Hi-index	0.09

Visualization

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.