GMA: A Pareto Optimal Distributed Resource-Allocation Algorithm

02/20/2021
by   Giacomo Giuliari, et al.
0

To address the rising demand for strong packet delivery guarantees in networking, we study a novel way to perform graph resource allocation. We first introduce allocation graphs, in which nodes can independently set local resource limits based on physical constraints or policy decisions. In this scenario we formalize the distributed path-allocation (PAdist) problem, which consists in allocating resources to paths considering only local on-path information – importantly, not knowing which other paths could have an allocation – while at the same time achieving the global property of never exceeding available resources. Our core contribution, the global myopic allocation (GMA) algorithm, is a solution to this problem. We prove that GMA can compute unconditional allocations for all paths on a graph, while never over-allocating resources. Further, we prove that GMA is Pareto optimal with respect to the allocation size, and it has linear complexity in the input size. Finally, we show with simulations that this theoretical result could be indeed applied to practical scenarios, as the resulting path allocations are large enough to fit the requirements of practically relevant applications.

READ FULL TEXT

page 3

page 6

page 7

page 8

page 10

page 11

page 12

page 16

research
10/20/2021

Statistical Physics Meets Wireless Communications: A Resource Allocation Solution for Large Networks

The ever-increasing number of nodes in current and future wireless commu...
research
11/29/2018

Evolutionary framework for two-stage stochastic resource allocation problems

Resource allocation problems are a family of problems in which resources...
research
07/16/2023

Information Design for Spatial Resource Allocation

In this paper, we study platforms where resources and jobs are spatially...
research
12/12/2017

Collaborative Uploading in Heterogeneous Networks: Optimal and Adaptive Strategies

Collaborative uploading describes a type of crowdsourcing scenario in ne...
research
07/10/2016

How to Allocate Resources For Features Acquisition?

We study classification problems where features are corrupted by noise a...
research
05/17/2018

Resource allocation under uncertainty: an algebraic and qualitative treatment

We use an algebraic viewpoint, namely a matrix framework to deal with th...
research
12/10/2020

Path Optimization Sheaves

Motivated by efforts to incorporate sheaves into networking, we seek to ...

Please sign up or login with your details

Forgot password? Click here to reset