Abstract
Knowledge about efficient usage of network resources is an important prerequisite for user collaboration in a static networked environment. Most of the network infrastructure internals cannot be directly sensed by users, except traffic allowances and response times. Here we will provide a technical approach for demonstrating to the user, how much changing traffic flows can guide to better employment of the shared network resources for all users together. The approach is based on order theory and fairness relations. Using the maxmin fair dominance relation, from its maximum set of maxmin fair states of random routings, the element with the largest throughput will be chosen, to yield a fair routing. The reported experiments will demonstrate that, for example, for a group of about 10 users, 500 samples are sufficient to report a suitable fair traffic allocation to the users.
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
Preview
Unable to display preview. Download preview PDF.
References
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74, 47–97 (2002)
Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall, Englewood Cliffs (1992)
Jaffe, J.M.: Bottleneck flow control. IEEE Trans. Commun. COM-29 (July 1981)
Kelly, F.: Charging and rate control for elastic traffic. Eur. Trans. Telecomm. 8, 33–37 (1997)
Köppen, M., Tsuru, M., Oie, Y.: Evolutionary approach to maxmin-fair network-resource allocation. In: IEEE/IPSJ International Symposium on Applications and the Internet, pp. 253–256. IEEE Computer Society, Turku (2008)
Mo, J., Walr, J.: Fair end-to-end window-based congestion control. IEEE/ACM Trans. on Networking, 556–567 (2000)
Nakamura, K., Tsuru, M., Oie, Y.: On the framework for network measurement as a service – the perfsonar-based integrated network management. In: International Conference on Intelligent Networking and Collaborative Systems, pp. 325–326. IEEE Computer Society, Los Alamitos (2010)
Suzumura, K.: Rational Choice, Collective Decisions, and Social Welfare. Cambridge University Press, Cambridge (2009)
Verschae, R., Köppen, M., Yoshida, K.: Partial user-supplied information and user modeling for improving QoS. Simulation Modelling Practice and Theory 19(1), 47–55 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hirosue, N., Yoshida, K., Köppen, M. (2011). A Heuristic Approach to Fair Routing Path Selection. In: König, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2011. Lecture Notes in Computer Science(), vol 6883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23854-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-23854-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23853-6
Online ISBN: 978-3-642-23854-3
eBook Packages: Computer ScienceComputer Science (R0)