![]() |
CiteULike | ![]() |
sfuniak's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Distributed network monitoring and multicommodity flows: a primal-dual approachIn PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (2007), pp. 284-291.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractA canonical distributed optimization problem is solving a Covering/Packing Linear Program in a distributed environment with fast convergence and low communication and space overheads. In this paper, we consider the following covering and packing problems, which are the dual of each other: • Passive Commodity Monitoring : minimize the total cost of monitoring devices used to measure the network traffic on all paths. • Maximum Throughput Multicommodity flow : maximize the total value of the flow with bounded edge capacities. .
BibTeX record
RIS record