KIT | KIT-Bibliothek | Impressum | Datenschutz

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

Demel, Almut; Kirsten, Michael ORCID iD icon


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.

Postprint §
DOI: 10.5445/IR/1000092714
Veröffentlicht am 28.03.2019
Cover der Publikation
Zugehörige Institution(en) am KIT Institut für Theoretische Informatik (ITI)
Publikationstyp Proceedingsbeitrag
Publikationsjahr 2017
Sprache Englisch
Identifikator urn:nbn:de:swb:90-927149
KITopen-ID: 1000092714
Erschienen 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, August 25, 2017, Stockholm, Sweden
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page