Fairness Indices and Distributed Control in Communication Networks

The concept of fairness index for self-authority servers in a large-scale network is introduced in this paper. The index quantifies the relative contributions of the servers to network routing, and can be used in network administration processes, such as negotiation of Multi-Lateral Peering Agreements. The fairness index concept leads naturally to the idea of an absolutely fair solution, which is a study focus in this paper. Although, an absolutely fair solution may not be an ideal operating point due to efficiency considerations, it serves as a reference point for comparing contribution from various servers in a network. Uniqueness and existence properties of absolutely fair solutions are examined in general as well as for certain specially structured networks of interest. Via the concept of a pricing duality, the connection of absolutely fair solutions to the von Neumann economic model is established. For implementation considerations, a distributed, low-data-rate con- trol algorithm that converges to pre-defined fairness index targets is introduced and analyzed. A heuristic extension is studied to provide a practical approach for realistic situations.

[1]  Chi Wan Sung,et al.  Robust convergence of low-data rate-distributed controllers , 2004, IEEE Trans. Autom. Control..

[2]  Christos Douligeris,et al.  Fairness in network optimal flow control: optimality of product forms , 1991, IEEE Trans. Commun..

[3]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[4]  Wing Shing Wong,et al.  Fairness issues in peer-to-peer networks , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[5]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[6]  Olvi L. Mangasarian,et al.  Perron-Frobenius properties of Ax − λBx , 1971 .

[7]  E. Seneta Non-negative Matrices and Markov Chains , 2008 .

[8]  Jean-Yves Le Boudec,et al.  Rate adaptation, Congestion Control and Fairness: A Tutorial , 2000 .

[9]  Chi Wan Sung,et al.  A distributed fixed-step power control algorithm with quantization and active link quality protection , 1999 .

[10]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[11]  Ao Tang,et al.  Is fair allocation always inefficient , 2004, IEEE INFOCOM 2004.

[12]  D. Serre Matrices: Theory and Applications , 2002 .

[13]  James F. Doyle,et al.  Peer-to-Peer: harnessing the power of disruptive technologies , 2001, UBIQ.

[14]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[15]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[16]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[17]  W. Wong,et al.  A fairness index for communication networks , 2005 .

[18]  J. Neumann A Model of General Economic Equilibrium , 1945 .

[19]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.