The practical performance of subgradient computational techniques for mesh network utility optimization

Authors:
Peng Wang;Stephan Bohacek
Affiliations:
Department of Electrical and Computer Engineering, University of Delaware, Newark, DE;Department of Electrical and Computer Engineering, University of Delaware, Newark, DE
Venue:
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Year:
2007

Citing 7
Cited 0

Minimization methods for non-differentiable functions

Minimization methods for non-differentiable functions
Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Dynamic congestion-based pricing of bandwidth and buffer

IEEE/ACM Transactions on Networking (TON)
Minimum-cost multicast over coded packet networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The impact of imperfect scheduling on cross-layer congestion control in wireless networks

IEEE/ACM Transactions on Networking (TON)
Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control

IEEE Journal on Selected Areas in Communications
A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the networking research literature, the problem of network utility optimization is often converted to the dual problem which, due to nondifferentiability, is solved with a particular subgradient technique. This technique is not an ascent scheme, hence each iteration does not necessarily improve the value of the dual function. This paper examines the performance of this computational technique in realistic mesh network settings. The traditional subgradient technique is compared to a subgradient technique that is an ascent algorithm. It is found that the traditional subgradient techniques suffer from poor performance. Specifically, for large networks, the convergence is slow. While increasing the step size improves convergence speed, due to stability problems, the step size cannot be set arbitrarily high, and suitable step sizes result in slow convergence. The traditional subgradient technique also suffers from difficulties when used online. The ascent scheme performs well in all respects, however, it is not a distributed technique.