TY - GEN
T1 - Bandwidth allocation for elastic real-time flows in multihop wireless networks based on network utility maximization
AU - Jayachandran, Praveen
AU - Abdelzaher, Tarek
PY - 2008/9/22
Y1 - 2008/9/22
N2 - In this paper, we consider distributed utility-maximizing rate allocation in cyber-physical multihop wireless networks carrying prioritized elastic flows with different end-toend delay requirements. This scenario arises in military wireless networks (dominated by audio and video flows) that must satisfy end-to-end deadlines. Due to the inherent difficulty in providing hard guarantees in such wireless environments, the problem is cast as one of utility maximization, where utility depends on meeting deadlines. Based on a recent result in real-time scheduling, we relate end-to-end delay of prioritized flows to flow rates and priorities, then impose end-to-end delay constraints that can be expressed in a decentralized manner in terms of flow information available locally at each node. The problem of utility maximization in the presence of these constraints is formulated, where utility depends on the ability to meet deadlines. The solution to the network utility maximization (NUM) problem yields a distributed rate control algorithm that nodes can independently execute to collectively maximize global network utility, taking into account delay constraints. Results from simulations demonstrate that a low deadline miss ratio is achieved for real-time packets, without significantly impacting throughput, resulting in a higher total utility compared to a previous state-of-the-art approach.
AB - In this paper, we consider distributed utility-maximizing rate allocation in cyber-physical multihop wireless networks carrying prioritized elastic flows with different end-toend delay requirements. This scenario arises in military wireless networks (dominated by audio and video flows) that must satisfy end-to-end deadlines. Due to the inherent difficulty in providing hard guarantees in such wireless environments, the problem is cast as one of utility maximization, where utility depends on meeting deadlines. Based on a recent result in real-time scheduling, we relate end-to-end delay of prioritized flows to flow rates and priorities, then impose end-to-end delay constraints that can be expressed in a decentralized manner in terms of flow information available locally at each node. The problem of utility maximization in the presence of these constraints is formulated, where utility depends on the ability to meet deadlines. The solution to the network utility maximization (NUM) problem yields a distributed rate control algorithm that nodes can independently execute to collectively maximize global network utility, taking into account delay constraints. Results from simulations demonstrate that a low deadline miss ratio is achieved for real-time packets, without significantly impacting throughput, resulting in a higher total utility compared to a previous state-of-the-art approach.
UR - http://www.scopus.com/inward/record.url?scp=51849155417&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51849155417&partnerID=8YFLogxK
U2 - 10.1109/ICDCS.2008.86
DO - 10.1109/ICDCS.2008.86
M3 - Conference contribution
AN - SCOPUS:51849155417
SN - 9780769531724
T3 - Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008
SP - 849
EP - 857
BT - Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008
T2 - 28th International Conference on Distributed Computing Systems, ICDCS 2008
Y2 - 17 July 2008 through 20 July 2008
ER -