Distributed Utility-Optimal Scheduling with Finite Buffers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Distributed Utility-Optimal Scheduling with Finite Buffers


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.
Fichier principal
Vignette du fichier
p278-xue.pdf (528.72 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission

Dates and versions

hal-00764153 , version 1 (12-12-2012)


  • 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⟩


77 View
181 Download


Gmail Facebook Twitter LinkedIn More