Fair and efficient network dimensioning with the reference point methodology

Authors

DOI:

https://doi.org/10.26636/jtit.2006.4.398

Keywords:

multiple criteria optimization, efficiency, fairness, equity, reference point method, telecommunications, network design, elastic traffic

Abstract

The dimensioning of telecommunication networks that carry elastic traffic requires the fulfillment of two conflicting goals: maximizing the total network throughput and providing fairness to all flows. Fairness in telecommunication network design is usually provided using the so-called max-min fairness (MMF) approach. However, this approach maximizes the performance of the worst (most expensive) flows which may cause a large worsening of the overall throughput of the network. In this paper we show how the concepts of multiple criteria equitable optimization can be effectively used to generate various fair and efficient allocation schemes. We introduce a multiple criteria model equivalent to equitable optimization and we develop a corresponding reference point procedure for fair and efficient network dimensioning for elastic flows. The procedure is tested on a sample network dimensioning problem for elastic traffic and its abilities to model various preferences are demonstrated.

Downloads

Download data is not yet available.

References

[1] D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs: Prentice-Hall, 1987.
View in Google Scholar

[2] T. Bonald and L. Massoulié, "Impact of fairness on Internet performance", in Proc. ACM Sigm., Cambridge, USA, 2001, pp. 82-91.
View in Google Scholar

[3] R. Denda, A. Banchs, and W. Effelsberg, "The fairness challenge in computer networks", in Quality of Future Internet Services, LNCS. Berlin: Springer-Verlag, 2000, vol. 1922, pp. 208-220.
View in Google Scholar

[4] J. Jaffe, "Bottleneck flow control", IEEE Trans. Commun., vol. 28, pp. 207-237, 1980.
View in Google Scholar

[5] F. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: shadow prices, proportional fairness and stability", J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
View in Google Scholar

[6] M. M. Kostreva and W. Ogryczak, "Linear optimization with multiple equitable criteria", RAIRO Oper. Res., vol. 33, pp. 275-297, 1999.
View in Google Scholar

[7] M. M. Kostreva, W. Ogryczak, and A. Wierzbicki, "Equitable aggregations and multiple criteria analysis", Eur. J. Oper. Res., vol. 158, pp. 362-367, 2004.
View in Google Scholar

[8] A. Lewandowski and A. P. Wierzbicki, Aspiration Based Decision Support Systems - Theory, Software and Applications. Berlin: Springer, 1989.
View in Google Scholar

[9] H. Luss, "On equitable resource allocation problems: a lexicographic minimax approach", Oper. Res., vol. 47, pp. 361-378, 1999.
View in Google Scholar

[10] A. W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications. New York: Academic Press, 1979.
View in Google Scholar

[11] J. Mo and J. Walrand, "Fair end-to-end window-based congestion control", IEEE/ACM Trans. Netw., vol. 8, pp. 556-567, 2000.
View in Google Scholar

[12] W. Ogryczak, Wielokryterialna optymalizacja liniowa i dyskretna. Modele preferencji i zastosowania do wspomagania decyzji. Warszawa: Wydawnictwa Uniwersytetu Warszawskiego, 1997 (in Polish).
View in Google Scholar

[13] W. Ogryczak and T. Śliwiński, "On equitable approaches to resource allocation problems: the conditional minimax solution", J. Telecommun. Inform. Technol., no. 3, pp. 40-48, 2002.
View in Google Scholar

[14] W. Ogryczak, T. Śliwiński, and A. Wierzbicki, "Fair resource allocation schemes and network dimensioning problems", J. Telecommun. Inform. Technol., no. 3, pp. 34-42, 2003.
View in Google Scholar

[15] W. Ogryczak and A. Tamir, "Minimizing the sum of the k largest functions in linear time", Inform. Proces. Lett., vol. 85, pp. 117-122, 2003.
View in Google Scholar

[16] M. Pióro and D. Medhi, Routing, Flow and Capacity Design in Communication and Computer Networks. San Francisco: Morgan Kaufmann, 2004.
View in Google Scholar

[17] J. Rawls, The Theory of Justice. Cambridge: Harvard University Press, 1971.
View in Google Scholar

[18] H. Steinhaus, "Sur la division pragmatique", Econometrica, vol. 17, pp. 315-319, 1949.
View in Google Scholar

[19] R. E. Steuer, Multiple Criteria Optimization: Theory, Computation and Applications. New York: Wiley, 1986.
View in Google Scholar

[20] A. Tang, J. Wang, and S. H. Low, "Is fair allocation always inefficient", in IEEE INFOCOM, Hong Kong, China, 2004, vol. 1, pp. 35-45.
View in Google Scholar

[21] A. P. Wierzbicki, "A mathematical basis for satisficing decision making", Math. Modell., vol. 3, pp. 391-405, 1982.
View in Google Scholar

[22] A. P. Wierzbicki, M. Makowski, and J. Wessels, Eds., Model Based Decision Support Methodology with Environmental Applications. Dordrecht: Kluwer, 2000.
View in Google Scholar

[23] R. R. Yager, "On ordered weighted averaging aggregation operators in multicriteria decision making", IEEE Trans. Syst., Man Cybern., vol. 18, pp. 183-190, 1988.
View in Google Scholar

Downloads

Submitted

2023-04-10

Published

2006-12-30

Issue

No. 4 (2006)

Section

ARTICLES FROM THIS ISSUE

License

Copyright (c) 2006 Journal of Telecommunications and Information Technology

Creative Commons License

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

How to Cite

[1]
W. Ogryczak, A. Wierzbicki, and M. Milewski, “Fair and efficient network dimensioning with the reference point methodology”, JTIT, vol. 26, no. 4, pp. 21–30, Dec. 2006, doi: 10.26636/jtit.2006.4.398.

Most read articles by the same author(s)