Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach
IEEE Transactions on Mobile Computing
IEEE/ACM Transactions on Networking (TON)
Throughput optimality of delay-driven maxweight scheduler for a wireless system with flow dynamics
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Delay analysis for wireless networks with single hop traffic and general interference constraints
IEEE/ACM Transactions on Networking (TON)
Utility maximization for delay constrained QoS in wireless
INFOCOM'10 Proceedings of the 29th conference on Information communications
Delay-based network utility maximization
INFOCOM'10 Proceedings of the 29th conference on Information communications
Utility-optimal scheduling in time-varying wireless networks with delay constraints
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Decentralized and dynamic bandwidth allocation in networked control systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Delay analysis and optimality of scheduling policies for multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Optimal Network Rate Allocation under End-to-End Quality-of-Service Requirements
IEEE Transactions on Network and Service Management
ICCPS '12 Proceedings of the 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems
Providing quality of service over a shared wireless link
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The optimal rate allocation problem with end-to-end delay constraints in wireless networks is highly challenging due to the dynamics incurred by delay related factors, such as traffic arrival pattern, queuing process, and wireless resource sharing mechanism. In this paper, we solve the problem through a utility maximization framework with two sets of constraints: (1) capacity and schedulability constraints and (2) end-to-end delay constraints. The end-to-end delay of a flow can be adjusted by controlling the per-link delays via a novel parameter called Virtual Link Capacity Margin (VLCM), which is the measurement of the gap between the schedulable link capacity and the maximum allowable flow rate over a link. This optimization problem can be solved via its dual decomposition through two prices derived with regard to the constraints: the link congestion price that reflects the relationship between the traffic load and the capacity of a link, and the flow delay price that reflects the margin between the average packet delay and the delay constraint of a flow. We prove that the algorithm converges to the optimal solution under the M/M/1 queuing model. We have also discussed using our algorithm under generalized traffic patterns, where we use link delay functions to formulate the relationship between VLCM and the average link delay. The algorithm is implemented distributedly via joint wireless link scheduling, VLCM adjustment and congestion control. Extensive experiments are conducted over diverse network topologies and traffic arrival models. The experimental results show that our algorithm is able to achieve optimal rate allocation while satisfying the end-to-end delay constraints.