Distributed Large Scale Network Utility Maximization

Details Distributed Large Scale Network Utility Maximization Distributed Large Scale Network Utility Maximization

2009-01-18

arxiv.org/abs/0901.2684v2

Computer Science

Information Theory

In the International Symposium on Information Theory (ISIT) 2009

Scientific paper

10.1109/ISIT.2009.5205655

Recent work by Zymnis et al. proposes an efficient primal-dual interior-point method, using a truncated Newton method, for solving the network utility maximization (NUM) problem. This method has shown superior performance relative to the traditional dual-decomposition approach. Other recent work by Bickson et al. shows how to compute efficiently and distributively the Newton step, which is the main computational bottleneck of the Newton method, utilizing the Gaussian belief propagation algorithm. In the current work, we combine both approaches to create an efficient distributed algorithm for solving the NUM problem. Unlike the work of Zymnis, which uses a centralized approach, our new algorithm is easily distributed. Using an empirical evaluation we show that our new method outperforms previous approaches, including the truncated Newton method and dual-decomposition methods. As an additional contribution, this is the first work that evaluates the performance of the Gaussian belief propagation algorithm vs. the preconditioned conjugate gradient method, for a large scale problem.

Affiliated with

Also associated with

No associations

Rating

Distributed Large Scale Network Utility Maximization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distributed Large Scale Network Utility Maximization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Large Scale Network Utility Maximization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-701904