Fairness considerations with algorithms for elastic traffic routing
DOI:
https://doi.org/10.26636/jtit.2004.2.246Keywords:
elastic traffic, routing, fairness, maximum throughput, algorithms, ILP, heuristicsAbstract
The bit rate of modern applications typically varies in time. We consider the traffic elastic if the rate of the sources can be controlled as a function of free resources along the route of that traffic. The objective is to route the demands optimally in sense of increasing the total network throughput while setting the rates of sources in a fair way. We propose a new fairness definition the relative fairness that handles lower and upper bounds on the traffic rate of each source and we compare it with two other known fairness definitions, namely, the max-min and the proportional rate fairness. We propose and compare different routing algorithms, all with three types of fairness definitions. The algorithms are all a tradeoff between network throughput, fairness and computational time.
Downloads
References
[1] D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice Hall, 1987.
View in Google Scholar
[2] A. Charny, D. Clark, and R. Jain, "Congestion control with explicite rate indication", in IEEE ICC'95, Seattle, USA, 1995.
View in Google Scholar
[3] F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, "Rate control for communications networks: shadow prices, proportional fairness and stability", J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
View in Google Scholar
[4] G. Fodor, G. Malicskó, M. Pióro, and T. Szymański, "Path optimization for elastic traffic under fairness constraints", ITC17, Salvador da Bahia, Brazil, 2001.
View in Google Scholar
[5] L. Massouline and J. W. Roberts, "Bandwidth sharing: objectives and algorithms", in IEEE INFOCOM'99, New York, USA, 1999.
View in Google Scholar
[6] Y. T. Hou, H. H.-Y. Tzeng, and S. S. Panwar, "A simple ABR switch algorithm for the weighted max-min fairness policy", in IEEE ATM Worksh.'97, Lisboa, Portugal, 1997.
View in Google Scholar
[7] H. Qingyanga and D. W. Petr, "Global max-min fairness guarantee for ABR flow control", in IEEE INFOCOM'98, San Francisco, USA, 1998.
View in Google Scholar
[8] Q. Ma, P. Steenkiste, and H. Zhang, "Routing high-bandwidth traffic in max-min fair share networks", in SIGCOMM'97, Cannes, France, 1997.
View in Google Scholar
[9] S. P. Abraham and A. Kumar, "A new approach for asynchronous distributed rate control for elastic sessions in integrated packet networks", IEEE/ACM Trans. Netw., vol. 9, no. 1, 2001.
View in Google Scholar
[10] P. Laborczi and P. Fige, "Static LSP routing algorithms for MPLS networks", in Networks 2000, Toronto, Canada, 2000.
View in Google Scholar
[11] P. Gajownicek, M. Pióro, and A. Arvidsson, "VP reconfiguration through simulated allocation", NTS, vol. 13, pp. 251-260, 1996.
View in Google Scholar
Downloads
Published
Issue
Section
License
Copyright (c) 2004 Journal of Telecommunications and Information Technology

This work is licensed under a Creative Commons Attribution 4.0 International License.