mk:kes11

Summary

A Heuristic Approach to Fair Routing Path Selection. Noriaki Hirosue, Kaori Yoshida and Mario Köppen. In Knowledge-Based and Intelligent Information and Engineering Systems, 15th International Conference, KES2011, pages 177-186, Kaiserslautern, Germany, September 2011.

Abstract

Knowledge about ecient 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 trac allowances and response times. Here we will provide a technical approach for demonstrating to the user, how much changing trac ows 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 sucient to report a suitable fair trac allocation to the users.

Bibtex entry

@INPROCEEDINGS { mk:kes11,
    ABSTRACT = { Knowledge about ecient 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 trac allowances and response times. Here we will provide a technical approach for demonstrating to the user, how much changing trac ows 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 sucient to report a suitable fair trac allocation to the users. },
    ADDRESS = { Kaiserslautern, Germany },
    AUTHOR = { Noriaki Hirosue and Kaori Yoshida and Mario Köppen },
    BOOKTITLE = { Knowledge-Based and Intelligent Information and Engineering Systems, 15th International Conference, KES2011 },
    ADDED = { 2011-07-05 22:48:42 +0900 },
    MODIFIED = { 2011-12-14 14:37:26 +0900 },
    EDITOR = { A. Koenig and A.Dengel and K.Hinkelmann and K. Kise and R.J.Howlett and L.C.Jain },
    MONTH = { September },
    PAGES = { 177-186 },
    PDF = { kes11.pdf },
    PUBLISHER = { Springer },
    SERIES = { LNCS 6883 },
    TITLE = { A Heuristic Approach to Fair Routing Path Selection },
    VOLUME = { 3 },
    YEAR = { 2011 },
}