Distributed network monitoring and multicommodity flows: A primal-dual approach

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 284-291

  Awerbuch, Baruch ^a   Khandekar, Rohit ^b  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Distributed algorithms; Multi commodity flows; Passive network measurement

Indexed keywords

EDGE CAPACITIES; MULTI COMMODITY FLOWS; PASSIVE NETWORK MEASUREMENT;

COMMUNICATION SYSTEMS; LINEAR PROGRAMMING; OPTIMIZATION; PARALLEL ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 36849000300     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281141     Document Type: Conference Paper

References (22)

1. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. In FOCS, 2004.
2. B. Awerbuch. Complexity of network synchronization. J. of the ACM, 32(4):804-823, Oct. 1985.
3. B. Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In STOC, 1987.
4. B. Awerbuch and R. G. Gallager. Distributed BFS algorithms. In FOCS, 1985.
5. B. Awerbuch and R. Khandekar. Greedy distributed optimization of multi-commodity flows. In PODC, 2007.
6. B. Awerbuch, R. Khandekar, and S. Rao. Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. In SODA, 2007.
7. B. Awerbuch and T. Leighton. A simple local-control approximation algorithm for multicommodity flow. In FOCS, 1993.
8. B. Awerbuch and T. Leighton. Improved approximation algorithms for the multicommodity flow problem and local competitive routing in dynamic networks. In STOC, 1994.
9. B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead. In FOCS, 1990.
10. B. Awerbuch and D. Peleg. Sparse partitions. In FOCS, 1990.
11. S. Fischer, H. Racke, and B. Vocking. Fast convergence to wardrop equilibria by adaptive sampling methods. In STOC, 2006.
12. L. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. SIAM Journal on Discrete Mathematics, 13:505-520, 2000.
13. C. Fraleigh, C. Diot, B. Lyles, S. Moon, P. Owezarski, D. Papagiannaki, and F. Tobagi. Design and deployment of a passive monitoring infrastructure. Lecture Notes in Computer Science, 2170:556+, 2001.
14. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In FOCS, 1998.
15. M. Kaart et al. The importance of internet measurements for internet policy (extended abstract).
16. M. Luby and N. Nissan. A parallel approximation algorithm for positive linear programming. In STOC, 1993.
17. M. Mohri. Semiring frameworks and algorithms for shortest-distance problems. J. Autom. Lang. Comb., 7(3):321-350, 2002.
18. M. Murray and K. Claffy. Measuring the immeasurable: Global internet measurement infrastructure. In PAM - A workshop on Passive and Active Measurements, 2001.
19. T. Roughgarden. The price of anarchy is independent of the network topology. In STOC, 2002.
20. Y. Shavitt and E. Shir. Dimes: let the internet measure itself. SIGCOMM Comput. Commun. Rev., 35(5):71-74, 2005.
21. C. R. Simpson, Jr., and G. F. Riley. Neti@home: A distributed approach to collecting end-to-end network performance measurements.
22. N. E. Young. Sequential and parallel algorithms for mixed packing and covering. In FOCS, 2001.