Conference Paper

LIFO-Backpressure achieves near optimal utility-delay tradeoff

Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
DOI: 10.1109/WIOPT.2011.5930067 Conference: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2011 International Symposium on
Source: IEEE Xplore

ABSTRACT There has been considerable recent work developing a new stochastic network utility maximization framework using Backpressure algorithms, also known as MaxWeight. A key open problem has been the development of utility-optimal algorithms that are also delay efficient. In this paper, we show that the Backpressure algorithm, when combined with the LIFO queueing discipline (called LIFO-Backpressure), is able to achieve a utility that is within O(1/V) of the optimal value for any scalar V ≥ 1, while maintaining an average delay of O([log(V)]2) for all but a tiny fraction of the network traffic. This result holds for general stochastic network optimization problems and general Markovian dynamics. Remarkably, the performance of LIFO-Backpressure can be achieved by simply changing the queueing discipline; it requires no other modifications of the original Backpressure algorithm. We validate the results through empirical measurements from a sensor network testbed, which show good match between theory and practice.

0 Bookmarks
 · 
124 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper is concerned with the cross-layer control of wireless multihop networks, in particular with joint network layer queueing control and physical layer resource allocation. For this, we bring a recently developed cost-function based queueing network control framework called μ-MaxWeight into the wireless network context. Thereby we combine the advantages of μ- MaxWeight, which provides universal stability while staying close to an inherent cost-metric, with an advanced wireless physical layer resource allocation policy for interference mitigation based on power control. To circumvent the difficult non-convex nature of the latter problem, we use a powerful successive convex approximation technique. Apart from interference mitigation, the proposed cost-based cross-layer control framework allows to easily incorporate application-dependent constraints and inherently handles the routing and scheduling issues in wireless multihop and relaying networks. Using numerical simulations, insight into the operation of the cost-based control and the convex-approximation power control is given. Moreover, the performance of this cross-layer approach is evaluated by comparing to state-of-the-art backpressure based wireless cross-layer optimization algorithms.
    01/2012;
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper focuses on the design and analysis of scheduling policies for multi-class queues, such as those found in wireless networks and high-speed switches. In this context, we study the response time tail under generalized max-weight policies in settings where the traffic flows are highly asymmetric. Specifically, we study an extreme setting with two traffic flows, one heavy-tailed, and one light-tailed. In this setting, we prove that classical max-weight scheduling, which is known to be throughput optimal, results in the light-tailed flow having heavy-tailed response times. However, we show that via a careful design of inter-queue scheduling policy (from the class of generalized max-weight policies) and intra-queue scheduling policies, it is possible to maintain throughput optimality, and guarantee light-tailed delays for the light-tailed flow, without affecting the response time tail for the heavy-tailed flow.
    INFOCOM, 2013 Proceedings IEEE; 01/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Packet scheduling/routing in wireless ad hoc networks is a fundamental problem for ad hoc networking. Backpressure routing is a solid and throughput optimal policy for such networks, but suffers from increased delays. In this article, we present two holistic approaches to improve upon the delay problems of backpressure - type algorithms. We develop two scheduling algorithms, namely Voting backpressure and Layered backpressure routing, which are throughput optimal. We experimentally compare the proposed algorithms against state-of-the-art delay-aware backpressure algorithms, which provide optimal throughput, for different payloads and network topologies, for both static and mobile networks. The experimental evaluation of the proposed delay reduction algorithms attest their superiority in terms of QoS, robustness, low computational complexity and simplicity.
    ICST Transactions on Mobile Communications and Applications. 09/2014; 14(1):1-16.

Full-text

Download
5 Downloads
Available from