Abstract
Network dimensioning is a specific kind of optimization problems. In general the main goal in this task is to ensure a connection between given pairs of nodes (source-target) with possible high efficiency. When each pair (demand) brings different revenue, the problem of blocking less attractive demands appears. Usually this situation is caused by not including any fairness criterion into optimization and thus optimizing only the total (revenue) efficiency of the system. Another complication is the fact of inverse proportionality of these criteria. In this paper an optimization model has been examined which takes into account a fairness criterion and minimizes the loss of system efficiency. It may also be understood as optimizing the ratio of fairness degree to the mean of the traffic flow in the network. For implementation of the model the CPLEX package was used. As input data the example of backbone Polish network structure was chosen. To evaluate the approach, basic statistics which help in describing the equity of distribution such as standard deviation, kurtosis and Gini coefficient are used.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Pióro, M., Medhi, D.: Routing, Flow and Capacity Design in Communication and Computer Networks, Morgan Kaufmann, San Francisco (2004)
Denda, R., Banchs, A., Effelsberg, W.: The fairness challenge in computer networks. Lecture Notes in Computer Science, vol. 1922, pp. 208–220 (2000)
Ogryczak, W., Wierzbicki, A.: On multi-criteria approaches to bandwidth allocation. Control Cybern. 33, 427–448 (2004)
Luss, H.: On equitable resource allocation problems: a lexicographic minimax approach. Oper. Res. 47(3), 361–378 (1999)
Kleinberg, J., Rabani, Y., Tardos, E.: Fairness in routing and load balancing. J. Comput. Syst. Sci. 63, 2–21 (2001)
Young, H.P.: Equity in Theory and Practice. Princeton University Press, Princeton (1994)
Rawls, J.: The Theory of Justice. Harvard University Press, Cambridge (1971)
Rawls, J., Kelly, E.: Justice as Fairness: A Restatement. Harvard University Press, Cambridge (2001)
Kelly, F., Mauloo, A., Tan, D.: Rate control for communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49, 206–217 (1997)
Yager, R.R.: On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Trans. Syst. Man Cyber. 18, 183–190 (1988)
Yager, R.R., Kacprzyk, J., Beliakov, G.: Recent Developments in the Ordered Weighted Averaging Operators: Theory and Practice, Springer, Heidelberg (2011)
Atkinson, A.B.: On the measurement of inequality. J. Econ. Theor. 2, 244–263 (1970)
Jain, R., Chiu, D., Hawe, W.: A quantitative measure of fairness and discrimination for resource allocation in shared computer system, Eastern Research Laboratory, Digital Equipment Corporation, Technical report (1984)
Ogryczak, W.: Inequality measures and equitable approaches to location problems. Eur. J. Oper. Res. 122, 374–391 (2000)
Dianati, M., Shen, X., Naik, S.: A new fairness index for radio resource allocation in wireless networks. In: Proceedings of WCNC 2005, vol. 2, pp. 712–717. IEEE (2005)
Ogryczak, W.: Inequality measures and equitable locations. Ann. Oper. Res. 167, 61–86 (2009)
Lan, T., Kao, D., Chiang, M., Sabharwal, A.: An axiomatic theory of fairness in network resource allocation. In: Proceedings of INFOCOM 2010, pp. 1–9. IEEE (2010)
Ogryczak, W., Zawadzki, M.: Conditional median: a parametric solution concept for location problems. Ann. Oper. Res. 110, 167–181 (2002)
Ogryczak, W., Tamir, A.: Minimizing the sum of the k-largest functions in linear time. Inf. Process. Lett. 85(3), 117–122 (2003)
Ogryczak, W.: Bicriteria models for fair and efficient resource allocation. Lecture Notes in Computer Science, vol. 6430, pp. 140–159 (2010)
Ibaraki, T., Katoh, N.: Resource Allocation Problems, Algorithmic Approaches. MIT Press, Cambridge (1988)
Ogryczak, W., Pióro, M., Tomaszewski, A.: Telecommunications network design and max-min optimization problem. J. Telecommun. Inf. Technol. 3, 43–56 (2005)
Rothschild, M., Stiglitz, J.E.: Some further results in the measurement of inequality. J. Econ. Theor. 6, 188–204 (1973)
Łodzińki, A.: Zastosowanie Metody Punktu Odniesienia do Znajdowania Decyzji Symetrycznie Efektywnych w Modelowaniu Wielokryterialnym Procesu Negocjacji Dwustronnych, Studia i Materiały Informatyki Stosowanej, vol. 5, nr 13, pp. 19–28 (2013)
Bertsimas, D., Farias, V.F., Trichakis, N.: The price of fairness. Oper. Res. 59(1), 17–31 (2011)
Ogryczak, W., Luss, H., Pióro, M., Nace, D., Tomaszewski, A.: Fair optimization and networks: a survey. J. Appl. Math. 2014, 1–25 (2014)
Ogryczak, W.: Fair optimization – methodological foundations of fairness in network resource allocation. In: IEEE 38th Annual International Computers, Software and Applications Conference Workshops, pp. 43–48 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Zalewski, G., Ogryczak, W. (2018). Network Dimensioning with Minimum Unfairness Cost for the Efficiency. In: Atanassov, K., et al. Uncertainty and Imprecision in Decision Making and Decision Support: Cross-Fertilization, New Models and Applications. IWIFSGN 2016. Advances in Intelligent Systems and Computing, vol 559. Springer, Cham. https://doi.org/10.1007/978-3-319-65545-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-65545-1_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-65544-4
Online ISBN: 978-3-319-65545-1
eBook Packages: EngineeringEngineering (R0)