Fair sharing of resources in a supply network with constraints

Abstract

This paper investigates the effect of network topology on the fair allocation of network resources among a set of agents, an all-important issue for the efficiency of transportation networks all around us. We analyse a generic mechanism that distributes network capacity fairly among existing flow demands. The problem can be solved by semi-analytical methods on a nearest neighbour graph with one source and sink pair, when transport occurs over shortest paths. For this setup, we uncover a broad range of patterns of intersecting shortest paths as a function of the distance between the source and the sink. When the number of intersections is the maximum and the distance between the source and the sink is large, we find that a fair allocation implies a decrease of at least 50% from the maximum throughput. We also find that the histogram of the flow allocations assigned to the agents decays as a power-law with exponent -1. Our semi-analytical framework suggests possible explanations for the well-known reduction of the throughput in fair allocations. It also suggests that the combination of network topology and routing rules can lead to highly uneven (but fair) distributions of resources, a remark of caution to network designers.

15 pages, 12 figures, minor changes

References in corpus (13)

• Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
• Damage and fluctuations induce loops in optimal transport networks
• The Price of Anarchy in Transportation Networks: Efficiency and Optimality Control
• Optimal routing on complex networks
• Fluctuations and redundancy in optimal transport networks
• Designing optimal transport networks
• Congestion phenomena on complex networks
• Communication Bottlenecks in Scale-Free Networks
• Shape and efficiency in spatial distribution networks
• Structure, Scaling and Phase Transition in the Optimal Transport Network
• Robustness of Trans-European Gas Networks
• Collectively optimal routing for congested traffic limited by link capacity
• Transport of multiple users in complex networks

Cited by in corpus (6)

• Quantifying the benefits of vehicle pooling with shareability networks
• Revealing physical interaction networks from statistics of collective dynamics
• Resilience of natural gas networks during conflicts, crises and disruptions
• The Emerging Energy Web
• Controlling congestion on complex networks: fairness, efficiency and network structure
• Socio-inspired ICT - Towards a socially grounded society-ICT symbiosis