Distributed Admission Control without Knowledge of the Capacity Region

2013/01/14 by Juan José Jaramillo, Juan Jose Jaramillo, Lei Ying +2
Computer Science · Engineering · #Advanced Wireless Network Optimization #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Wireless Networks and Protocols #cs.NI

paper · pdf · doi:10.48550/arxiv.1301.3185

Extended version of paper presented in IEEE INFOCOM 2013 Mini-Conference

arxiv created 2013/01/14 · openalex publication_date 2013/01/14 · arxiv updated 2013/01/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Node-Based Optimal Power Control, Routing, and Congestion Control in Wireless Networks
• A Strategy-Proof and Non-monetary Admission Control Mechanism for Wireless Access Networks
• Network Utility Maximization with Heterogeneous Traffic Flows
• Distributed Random Access Algorithm: Scheduling and Congestion Control
• Flow Control and Scheduling for Shared FIFO Queues over Wireless Networks