Article

Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach

Authors:

Baruch Awerbuch,

Rohit KhandekarAuthors Info & Claims

PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing

Pages 354 - 355

https://doi.org/10.1145/1281100.1281170

Published: 12 August 2007 Publication History

Get Access

Abstract

We consider the Active Min-Cost Measurement problem to minimize the cost incurred by measuring network link delays. Although the problem has a polynomial representation, its covering LP formulation, for which most of the previous distributed algorithms apply, has an exponential number of variables, one for each path.

We present first known distributed (1+ε) approximation algorithm for this problem that converges in time that is linear in the maximal path length and poly-logarithmic in the size of the entire network and has polynomial computational overhead. Previous distributed solutions achieving similar approximations required either convergence time that is polynomial or computational overhead that is exponential in the size of the entire network.

References

[1]

Baruch Awerbuch and Yossi Azar. Local optimization of global objectives: Competitive distributed deadlock resolution and resource allocation. In FOCS, 1994.

Digital Library

Google Scholar

[2]

Baruch Awerbuch and Rohit Khandekar. Distributed network monitoring and multicommodity flows: a primal-dual approach. In PODC, 2007.

Digital Library

Google Scholar

[3]

Baruch Awerbuch, Rohit Khandekar, and Satish Rao. Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. In SODA, 2007.

Digital Library

Google Scholar

[4]

Yair Bartal, John W. Byers, and Danny Raz. Global optimization using local information with applications to flow control. In FOCS, 1997.

Digital Library

Google Scholar

[5]

N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In FOCS, 1998.

Digital Library

Google Scholar

[6]

Michael Luby and Noam Nissan. A parallel approximation algorithm for positive linear programming. In STOC, 1993.

Digital Library

Google Scholar

[7]

Neal E. Young. Sequential and parallel algorithms for mixed packing and covering. In FOCS, 2001.

Digital Library

Google Scholar

Index Terms

Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Partially distributed outer approximation
Abstract
This paper presents a novel partially distributed outer approximation algorithm, named PaDOA, for solving a class of structured mixed integer convex programming problems to global optimality. The proposed scheme uses an iterative outer ...
EFIX: Exact fixed point methods for distributed optimization
Abstract
We consider strongly convex distributed consensus optimization over connected networks. EFIX, the proposed method, is derived using quadratic penalty approach. In more detail, we use the standard reformulation—transforming the original problem ... $^{}$
Nearly-Linear Time Positive LP Solver with Faster Convergence Rate
STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing

Positive linear programs (LP), also known as packing and covering linear programs, are an important class of problems that bridges computer science, operation research, and optimization. Efficient algorithms for solving such LPs have received ...

Comments

Information & Contributors

Information

Published In

PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing

August 2007

424 pages

ISBN:9781595936165

DOI:10.1145/1281100

General Chair:
Indranil Gupta
UIUC, USA
,
Program Chair:
Rogert Wattenhofer
ETH Zurich, Switzerland

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 August 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC07

Sponsor:

PODC07: ACM Symposium on Principles of Distributed Computing 2007

August 12 - 15, 2007

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
142
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Partially distributed outer approximation

EFIX: Exact fixed point methods for distributed optimization

Nearly-Linear Time Positive LP Solver with Faster Convergence Rate

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Login options

Full Access

PDF

eReader

Abstract

References

Index Terms

Recommendations

Partially distributed outer approximation

EFIX: Exact fixed point methods for distributed optimization

Nearly-Linear Time Positive LP Solver with Faster Convergence Rate

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations