A heuristic approach to fair routing path selection

Authors:
Noriaki Hirosue;Kaori Yoshida;Mario Köppen
Affiliations:
Kyushu Institute of Technology, Kawazu, Iizuka;Kyushu Institute of Technology, Kawazu, Iizuka;Kyushu Institute of Technology, Kawazu, Iizuka
Venue:
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part III
Year:
2011

Citing 4
Cited 0

Data networks

Data networks
Fair end-to-end window-based congestion control

IEEE/ACM Transactions on Networking (TON)
Evolutionary Approach to Maxmin-Fair Network-Resource Allocation

SAINT '08 Proceedings of the 2008 International Symposium on Applications and the Internet
On the Framework for Network Measurement as a Service -- The perfSONAR-based Integrated Network Management

INCOS '10 Proceedings of the 2010 International Conference on Intelligent Networking and Collaborative Systems

Quantified Score

Hi-index	0.00

Visualization

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.