Information Theoretic Aspects of Fairness Criteria in Network Resource Allocation Problems

ACM International Conference Proceeding Series

Volumn , Issue , 2007, Pages

  Uchida, Masato ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Fairness; Information Theory; Resource Allocation

Indexed keywords

INFORMATION THEORY;

FAIRNESS; FAIRNESS CRITERION; IN NETWORKS; MINIMISATION; NETWORK RESOURCE ALLOCATIONS; OPTIMIZATION PROBLEMS; PROBLEM-BASED; PROPORTIONAL FAIRNESS; RESOURCE ALLOCATION PROBLEM; RESOURCES ALLOCATION;

RESOURCE ALLOCATION;

EID: 78649395418     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4108/gamecomm.2007.2039     Document Type: Conference Paper

References (32)

1. R. Agrawal, A. Bedekar, R. J. La, and V. Subramanian. Class and channel condition based weighted proportional fair scheduler. In Proceedings of 17th International Teletraffic Congress (ITC’01), pages 553–565, Salvador da Bahia, Brazil, December 2001.
2. R. Agrawal and V. Subramanian. Optimality of certain channel aware scheduling policies. In Proceedings of the 40th Annual Allerton Conference on Communication, Control and Computing, pages 1532–1541, Allerton, IL, USA, October 2002.
3. S. Amari. Differential-Geometrical Methods in Statistics. Springer-Verlag, 1985.
4. S. Amari and H. Nagaoka. Methods of Information Geometry. American Mathematical Society, 2000.
5. A. Basu, I. R. Harris, N. L. Hjort, and M. C. Jones. Robust and efficient estimation by minimising a density power divergence. Biometrika, 85(3):549–559, September 1998.
6. D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, 1987.
7. T. Bonald and L. Massoulie. Impact of fairness on internet performance. ACM SIGMETRICS Performance Evaluation Review, 29(1):82–91, June 2001.
8. S. Borst and P. Whiting. Dynamic rate control algorithms for hdr throughput optimization. In Proceedings of 20th Annual IEEE Conference on Computer Communications (INFOCOM’01), pages 976–985, Anchorage, AK, USA, April 2001.
9. J.-Y. L. Boudec. Rate adaptation, congestion control and fairness: A tutorial, December 2006. Ecole Polytechnique Fédérale de Lausanne (EPFL).
10. L. M. Bregman. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. U.S.S.R. Computational Mathematics and Mathematical Physics, 7(1):200–217, 1967.
11. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley-Interscience, 1991.
12. L. Csiszár. Information-type measures of different of probability distributions. Studia Scientiarum Mathematicarum Hungarica, 2:299–318, 1967.
13. S. Eguchi and M. Minami. Robust blind source separation by β-divergence. Neural Computation, 14:1859–1886, 2002.
14. T. Harks. Utility proportional fair bandwidth allocation: An optimization oriented approach. In Proceedings of QoS in Multiservice IP Networks (QoS-IP’05), pages 61–74 (LNCS 3375), Catania, Italy, February 2005.
15. T. Harks and T. Poschwatta. Utility fair congestion control for real-time traffic. In Proceedings of 24th Annual IEEE Conference on Computer Communications (INFOCOM’05), pages 2786–2791, Miami, FL,USA, March 2005.
16. F. Itakura and S. Saito. Analysis sinthesis telephony based on the maximum likelihood method. In Reports of the 6th International Congress on Acoustics, pages 17–20, Tokyo, Japan, August 1968.
17. A. Jalali, R. Padovani, and R. Pankaj. Data throughput of cdma-hdr a high efficiency-high data rate personal communication wireless system. In Proceedings of IEEE Vehicular Technology Conference (VTC’00), volume 3, pages 1854–1858, Boston, MA, USA, September 2000.
18. L. B. Jiang and S. C. Liew. Proportional fairness in wireless lans and ad hoc networks. In Proceedings of IEEE Wireless Communications and Networking Conference (WCNC’05), volume 3, pages 1551–1556, New Orleans, LA, USA, March 2005.
19. F. P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8(1):33–37, January 1997.
20. F. P. Kelly, A. K. Maulloo, and D. K. H. Tan. Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49(3):237–252, March 1998.
21. S. Kullback. Information Theory and Statistics. John Wiley and Sons, 1959.
22. S. Kullback and R. Leibler. On information and sufficiency. Annals of Mathematical Statistics, 22(1):79–86, March 1951.
23. L. Massoulié. Structural properties of proportional fairness: Stability and insensitivity. Technical report, Microsoft Research.
24. L. Massoulié and J. Roberts. Bandwidth sharing: Objectives and algorithms. In Proceedings of the 18th Annual IEEE Conference on Computer Communications (INFOCOM’99), pages 1395–1403, New York, NY, USA, March 1999.
25. J. Mo and J. Walrand. Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking, 8(5):556–567, October 2000.
26. Y. Ohta, M. Tsuru, and Y. Oie. Fairness property and tcp-lebel performance of unified scheduling algorithm in hsdpa networks. In Proceedings of the 3rd European Conference on Universal Multiservice Networks (ECUMN’04), pages 185–195 (LNCS 3262), Porto, Portugal, October 2004.
27. C. E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27:379–423 and 623–656, July and October 1948.
28. H. Shioya and K. Gohara. Generalized phase retrieval algorithm based on information measures. Optics Communications, 266(1):88–93, October 2006.
29. C. Tsallis. Possible generalization of boltzmann-gibbs statistics. Journal of Statistical Physics, 52(1–2):479–487, July 1988.
30. M. Uchida and H. Shioya. A study on an extended formula of divergence measures using invariance. Electronics and Communications in Japan (Part 3: Fundamental Electronic Science), 88(4):35–42, December 2004.
31. P. Viswaanath, D. N. C. Tse, and R. Laroia. Opportunistic beamforming using dumb antennas. IEEE Transactions on Information Theory, 48(6):1277–1294, June.
32. Y. Zhang, M. Uchida, M. Tsuru, and Y. Oie. Scheduling algorithms with error rate consideration in hsdpa networks. In Proceedings of International Wireless Communications and Mobile Computing Conference (IWCMC’06), pages 1241–1246, Vancouver, Canada, July 2006.