Achieving utility-delay-reliability tradeoff in stochastic network optimization with finite buffers

Sucha Supittayapornpong, Michael J. Neely
2015 2015 IEEE Conference on Computer Communications (INFOCOM)  
One practical open problem is the development of a distributed algorithm that achieves near-optimal utility using only a finite (and small) buffer size for queues in a stochastic network. This paper studies utility maximization (or cost minimization) in a finite-buffer regime and considers the corresponding delay and reliability (or rate of packet drops) tradeoff. A floating-queue algorithm allows the stochastic network optimization framework to be implemented with finite buffers at the cost of
more » ... packet drops. Further, the buffer size requirement is significantly smaller than previous works in this area. With a finite buffer size of B packets, the proposed algorithm achieves within O(e −B ) of the optimal utility while maintaining average per-hop delay of O(B) and an average per-hop drop rate of O(e −B ) in steady state. From an implementation perspective, the floating-queue algorithm requires little modification of the well-known Drift-Plus-Penalty policy (including MaxWeight and Backpressure policies). As a result, the floating-queue algorithm inherits the distributed and low complexity nature of these policies.
doi:10.1109/infocom.2015.7218520 dblp:conf/infocom/Supittayapornpong15 fatcat:hd75xh3wpffj7jxhrgztg7dra4