Data networks
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
A new measurement fornetwork sharing fairness
Computers & Mathematics with Applications
| Hi-index | 0.09 |
An important issue of computer network management is to distribute network resource fairly to its users. The first quantitative fairness score function F(x"1,x"2,...,x"n) was proposed in 1984 by Jain et al. [1] for evaluating network resource sharing fairness. Chen and Zhang (2005) [6] proposed another fairness score function G(x"1,x"2,...,x"n) which better fits the real world situation in some cases. This paper considers the situation that the users can have different priority levels. A modified fairness score function G^*(x"1,x"2,...,x"n;w"1,w"2,...,w"n) is proposed. The proposed fairness score function can deal with the situation that the network resource users have different priority levels, and can keep all the nice properties of G(x"1,x"2,...,x"n).