Formal Fairness Properties in Network Routing Based on a Resource Allocation Model

Reviewed Paper In Proceedings

Author(s):Almut Demel and Michael Kirsten
In:9th Workshop on Logical Aspects of Multi-Agent Systems (LAMAS 2017) affiliated with CSL 2017: the 26th EACSL Annual Conference on Computer Science Logic
Year:2017
URL:http://www.cs.nott.ac.uk/~psznza/lamas17/papers/kirsten.pdf

Abstract

Network routing –being a central part of our everyday life, which increasingly depends on internet services– is highly distributed. It must provide for a variety of different services, each accommodating different requirements. Thereby, the access to network services is often very different between multiple users or agents, who are nonetheless expecting the same quality, e.g., regarding speed or availability. This work establishes a formal model of network routing, stepping into fair allocation theory, in order to develop formal fairness properties within this model. We furthermore derive possible fairness criteria from established notions in fair allocation theory.

BibTeX

@InProceedings{DemelKirsten2017,
  author                = {Almut Demel and Michael Kirsten},
  title                 = {Formal Fairness Properties in Network Routing
                           Based on a Resource Allocation Model},
  booktitle             = {9th Workshop on Logical Aspects of
                           Multi-Agent Systems (LAMAS 2017)
                           affiliated with CSL 2017: the 26th EACSL
                           Annual Conference on Computer Science Logic},
  month                 = aug,
  year                  = {2017},
  abstract              = {Network routing –being a central part of our everyday life, which
                           increasingly depends on internet services– is highly distributed. It must
                           provide for a variety of different services, each accommodating different
                           requirements. Thereby, the access to network services is often very different
                           between multiple users or agents, who are nonetheless expecting the same
                           quality, e.g., regarding speed or availability. This work establishes a formal
                           model of network routing, stepping into fair allocation theory, in order to
                           develop formal fairness properties within this model. We furthermore derive
                           possible fairness criteria from established notions in fair allocation theory.},
  url			= {http://www.cs.nott.ac.uk/~psznza/lamas17/papers/kirsten.pdf},
  place                 = {Stockholm, Sweden},
  date                  = {August 25}
}