Skip to Main content Skip to Navigation
Conference papers

Distributed Utility-Optimal Scheduling with Finite Buffers

Abstract : In this paper, we propose a distributed cross-layer scheduling algorithm for networks with single-hop transmissions that can guarantee finite buffer sizes and meet minimum utility requirements. The algorithm can achieve a utility arbitrarily close to the optimal value with a tradeoff in the buffer sizes. The finite buffer property is not only important from an implementation perspective, but, along with the algorithm, also yields superior delay performance. A novel structure of Lyapunov function is employed to prove the utility optimality of the algorithm with the introduction of novel virtual queue structures. Unlike traditional back-pressure-based optimal algorithms, our proposed algorithm does not need centralized computation and achieves fully local implementation without global message passing. Compared to other recent throughput/utility-optimal CSMA distributed algorithms, we illustrate through rigorous numerical and implementation results that our proposed algorithm achieves far better delay performance for comparable throughput/utility levels.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, December 12, 2012 - 2:31:22 PM
Last modification on : Wednesday, December 12, 2012 - 2:54:46 PM
Long-term archiving on: : Wednesday, March 13, 2013 - 3:53:53 AM


Explicit agreement for this submission


  • HAL Id : hal-00764153, version 1



Dongyue Xue, Robert Murawski, Eylem Ekici. Distributed Utility-Optimal Scheduling with Finite Buffers. WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.278-285. ⟨hal-00764153⟩



Record views


Files downloads