- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Journal of Mathematics

Volume 2013 (2013), Article ID 956039, 6 pages

http://dx.doi.org/10.1155/2013/956039

## A Modified Resource Distribution Fairness Measure

Department of Mathematics and Statistics, Florida International University, Miami, FL 33199, USA

Received 19 August 2012; Revised 3 October 2012; Accepted 1 November 2012

Academic Editor: Keqin Gu

Copyright © 2013 Zhenmin Chen. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

An important issue of resource distribution is the fairness of the distribution. For example, computer network management wishes to distribute network resource fairly to its users. To describe the fairness of the resource distribution, a quantitative fairness score function was proposed in 1984 by Jain et al. The purpose of this paper is to propose a modified network sharing fairness function so that the users can be treated differently according to their priority levels. The mathematical properties are discussed. The proposed fairness score function keeps all the nice properties of and provides better performance when the network users have different priority levels.

#### 1. Introduction

When a fixed number of users or receivers share limited amount of resource, the fairness of the distribution is always an important issue. The resource distribution can be of any kind such as social benefit resource distribution, manpower distribution, and computer network resource distribution. Suppose users share a certain amount of resource. Let be the amounts of resource the users receive, respectively. Suppose all users have the same right to share the entire resource. Then the difference among the values should not be too large. If the difference among values is too large, then it can be claimed that the distribution of the entire resource is unfair. Here certain rules have to be made to determine if the resource distribution is fair or unfair. To solve such a problem, there are two important steps. The first step is to find an appropriate quantitative measure, which is a function of , such that the quantitative measure can be used to describe the fairness of the resource distribution. The quantitative measure should increase when the resource distribution becomes fairer. On the other hand, it should decrease when the resource distribution becomes more and more unfair. The second step is to determine when one can conclude that the resource distribution is significantly unfair. The concept of statistical test can be adopted for this purpose. For a certain level of significance, one may conclude that the resource distribution is significantly unfair when the quantitative measure falls below some value. Such a value is called a critical value in statistical analysis. This paper focuses on modifying a commonly used fairness measure so that the modified fairness measure can better fit the real world applications.

In the past several decades, many research papers have been published in this area in the literature. Jain et al. [1] proposed a quantitative measure to assess the fairness of the network resource distribution. The fairness score function proposed by Jain et al. is defined as As mentioned above, a fairness score function must possess some nice properties so that it can be used to describe the fairness of the resource distribution and can be used to determine whether or not the resource distribution is fair. In fact, the fairness score function defined in (1) does possess some nice properties. It can be shown easily that for any nonnegative . In the case that the distribution is completely unfair, that is, only one user occupies the entire resource while the other users do not receive any, the value of is . On the other hand, if the distribution is perfectly fair, that is, all the users share the entire resource equally, then the value of is 1. If only out of users share the entire resource equally while the others do not receive any, then the fairness score is . It can also be seen that does not depend on scale. In addition, one can find that this fairness score function continuously reflects changes in allocation. For more references in this field, see Bertsekas and Gallager [2], Chiu and Jain [3], Kelly et al. [4], and Mazumdar et al. [5].

Note that the fairness score function of resource distribution can be used when all the users have equal right to share the entire resource. In practice, however, it is possible that the users may have different priority levels. For example, when the internet resource is distributed to users, advanced users and regular users should be treated differently. When social benefit resource is distributed, disabled people, pregnant women, low income, or no income people all have different priority levels. Equally distributing the entire resource to all the users is, in fact, an unfair way to distribute the entire resource. Therefore, some modification is needed to the fairness score function defined in (1) so that the modified fairness score function can be used for the case that users have different priority levels to share the entire resource. This is the purpose of this paper. Instead of equally distributing network resource to all the users, the entire resource is distributed to all users according to their priority levels. It can be shown that the fairness function proposed in this paper keeps all the meritorious properties of even for the case that the users are at different priority levels.

#### 2. Modified Fairness Score Function

Now suppose the users who are sharing the entire resource have different priority levels. More specifically, let be the amounts of resource that the users receive, respectively. Also let be the corresponding priority factors of these users. It means that the amounts of resource users receive are supposed to be for some . The fairness score function proposed in this paper is defined as This fairness score function is a generalization of the fairness score function defined in (1). In the case that all the users are at the same priority level, that is, the fairness score function; becomes which is same as the one defined in (1). To use this fairness score function to describe the fairness of the resource distribution and to use statistical analysis to determine whether or not the resource distribution is fair, must possess some nice properties mentioned in the previous section. In fact, it will be shown that the fairness score function does possess the same meritorious properties as does. It can be seen from the definition of that is always true. The two extreme cases, that are the perfectly fair distribution case and the completely unfair case, are presented in Theorems 1 and 2. In the perfectly fair distribution case, the fairness score function defined in (2) reaches its highest value. In the completely unfair distribution case, the fairness score function reaches its lowest value.

Theorem 1. * if and only if the distribution is perfectly fair. Here perfectly fair distribution refers to the case that all the users share the entire network resource proportionally according to their priority levels. *

*Proof. *By the definition of ; ,
if and only if
This statement is true if and only if
It is equivalent to
This ends the proof of the theorem.

Theorem 2. * is minimized if and only if the distribution is completely unfair. Here the case that the distribution is completely unfair is the one that only one user with the lowest priority level occupies the entire resource.*

*Proof. *Sort from the smallest to the largest. Let be the smallest number . Without loss of generality, it can be assumed that
Thus . Then
Define
Note that
Since are fixed numbers, then to maximize , it is desired to maximize
Since
then is maximized if and only if one of the
values is 1, and the rest are zeros.

On the other hand, note that
In order to maximize Q,
must be true for those term satisfying . It is equivalent to the condition that must be 0 for those terms satisfying . It means that the amounts that are received by users, whose priority levels are not the lowest, must be zero. Combining the results of the above discussion, the proof follows.

For fixed priority levels , the lowest value the fairness score function defined in (2) can reach is In the case of , this quantity becomes. This result is the same as the one when the fairness score function defined in (1) is used, as expected. The next theorem deals with the case that users equally share the entire resource assuming that all the users are at the same priority level.

Theorem 3. *If all the users are at the same priority level, and if only out of the users share the entire resource equally while the other n-k users do not share any, then
*

*Proof. *Without loss of generality, assume the first users receive the same amount, say, *x*, and the rest users do not receive any. Then
The proof is done.

It should be noted that Theorem 3 only deals with a special case that all the users have the same priority level. One might wonder if can hold for the case that users have different priority levels and that only out of the users share the entire resource proportionally according to their priority levels while the other - users do not share any. It fact, this is not the case. The following is a counter example. Suppose there are three users with priority levels 3, 2, and 1, respectively. Suppose also that the users priority levels 3 and 2 share the entire resource proportionally to their priority levels and the user with priority level 1 does not receive any share. Then

Theorem 4. *For define
**
Then
*

*Proof. *By the definition of , it suffices to show that
have the same sign. This is true because
The proof of the theorem follows.

Theorem 4 shows that when user gives a small amount to user , then the new allocation is more fair if user was relatively discriminated. The new allocation is less fair if user was relatively favored. The idea was adopted from Jain et al. [1] in conjunction with the consideration of the priority levels.

The following result shows that if all the users are given extra amounts of network resource proportionally according to their priority levels, then the fairness of the distribution will not decrease.

Theorem 5. *For any ,
*

*Proof. *It can be shown that
Now it is desired to show that
is a decreasing function in *δ*. This is true because
The proof follows.

In addition to the above properties, it can be seen easily the fairness function defined in (2) does not depend on scale. The properties of the fairness score function ensures that the fairness score function can be used to evaluate the fairness of the resource distribution.

#### 3. Conclusion and Discussion

Fairness is an important issue when resource is distributed to its users. Here resource distribution can be of any kind. For example, when internet resource is distributed to users, one wishes to distribute the entire resource fairly to the users. Social benefit resource distribution is another example. The fairness measure of the resource distribution was originally discussed in the area of computer network resource distribution. The fairness score function, , proposed by Jain et al. [1] has been widely used to evaluate the fairness of the network resource distribution. The fairness score function , however, assumes that all the users are at the same priority level; that is, all the users are supposed to be treated equally when the entire resource is distributed. In practice, users may have different priority levels and should be treated differently. When computer network resource providers distribute the entire resource to their users, they usually treat their users according to their priority levels—basic users, advanced users, VIP users, and so on. Social benefit resource is also distributed to the receivers according to their priority levels. For example, disabled people usually have higher priority to receive social benefits. Therefore, some modification is needed on the fairness score function so that the modified fairness score function can handle the case that the users have different priority levels. This is the purpose of this paper. A new fairness score function is presented in this paper. The fairness score function proposed in this paper keeps all the nice properties of even when the users have different priority levels.

The value of the new fairness score function increases when the resource distribution becomes fairer and fairer. The value decreases when the resource distribution becomes more and more unfair. One extreme of the resource distribution is that all the users share the entire resource according to their priority levels. In that case, the fairness score function reaches its maximum value 1. On the other hand, when the resource distribution is the most unfair case, the fairness score function reaches its minimum value. Furthermore, the status of fairness distribution changes from one extreme to the other extreme, the fairness score function is able to reflect the change correspondingly. These properties ensure that the fairness score function can be used to evaluate the fairness of the resource distribution.

It can be shown that the distribution of is scale-free. Thus the quantiles of can be obtained by Monte-Carlo simulation. Based on those quantiles, a statistical test can then be conducted to check whether or not the network resource distribution is statistically significantly unfair to the users. In computer network resource management, if the resource distribution is significantly unfair, the resource distribution scheme should be adjusted.

#### Acknowledgment

The author thanks two anonymous referees for their detailed comments and suggestions that greatly improved the quality of the paper.

#### References

- R. Jain, D. Chiu, and W. Hawe, “A quantitative measure of fairness and discrimination for resource allocation in shared computer system,”
*Technical Report*DEC-TR-301, Digital Equipment Corporation, Maynard, Mass, USA, 1984. View at Google Scholar - D. Bertsekas and R. Gallager,
*Data Networks*, Prentice Hall, Upper Saddle River, NJ, USA, 1987. - D. M. Chiu and R. Jain, “Analysis of the increase and decrease algorithms for congestion avoidance in computer networks,”
*Computer Networks and ISDN Systems*, vol. 17, no. 1, pp. 1–14, 1989. View at Google Scholar · View at Scopus - F. P. Kelly, A. K. Maulloo, and D. Tan, “Rate control for communication networks: shadow prices, proportional fairness and stability,”
*Journal of the Operational Research Society*, vol. 49, no. 3, pp. 237–252, 1998. View at Google Scholar · View at Scopus - R. Mazumdar, L. G. Mason, and C. Douligeris, “Fairness in network optimal flow control: optimality of product forms,”
*IEEE Transactions on Communications*, vol. 39, no. 5, pp. 775–782, 1991. View at Google Scholar · View at Scopus