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

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.