Distributed Admission Control without Knowledge of the Capacity Region

TL;DR

This paper introduces a distributed admission control method for wireless networks that does not require prior knowledge of the capacity region, enabling efficient bandwidth allocation and admission decisions.

Contribution

It proposes an optimization framework for distributed admission control that determines feasible rates without knowing the capacity region beforehand.

Findings

Successfully serves existing flows with pre-specified bandwidths

Allows new flows to determine maximum feasible rates

Ensures non-interfering bandwidth allocation

Abstract

We consider the problem of distributed admission control without knowledge of the capacity region in single-hop wireless networks, for flows that require a pre-specified bandwidth from the network. We present an optimization framework that allows us to design a scheduler and resource allocator, and by properly choosing a suitable utility function in the resource allocator, we prove that existing flows can be served with a pre-specified bandwidth, while the link requesting admission can determine the largest rate that it can get such that it does not interfere with the allocation to the existing flows.