Distributed network utility maximization in wireless networks with a bounded number of paths

Authors:
André Schumacher;Harri Haanpää
Affiliations:
Helsinki University of Technology, Helsinki, Finland;Helsinki University of Technology, Helsinki, Finland
Venue:
Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Year:
2008

Citing 11
Cited 0

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
An “all pairs shortest paths” distributed algorithm using 2n2 messages

Journal of Algorithms
On the k-Splittable Flow Problem

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Optimal flow control and routing in multi-path networks

Performance Evaluation - Special issue: Internet performance and control of network systems
Multipath Optimization Flow Control

ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Joint congestion control: routing and media access control optimization via dual decomposition for ad hoc wireless networks

MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
An optimization-based approach for QoS routing in high-bandwidth networks

IEEE/ACM Transactions on Networking (TON)
Mathematical decomposition techniques for distributed cross-layer optimization of data networks

IEEE Journal on Selected Areas in Communications
Towards Robust Multi-Layer Traffic Engineering: Optimization of Congestion Control and Routing

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the fair multicommodity flow problem in multihop wireless networks. We optimize the flow between a number of source-destination pairs to achieve a fair allocation of network resources while satisfying node capacity constraints. To account for the limitations of wireless devices, we use a path-based formulation and allow only a bounded number of paths between each source-destination pair. We develop a dual decomposition based distributed algorithm for solving the problem, show the optimality of a stationary solution, and compare the performance of the algorithm with a centralized branch-and-bound method.