On the cost-quality tradeoff in topology-aware overlay path probing

Proceedings - International Conference on Network Protocols, ICNP

Volumn 2003-January, Issue , 2003, Pages 268-279

  Tang, Chiping ^a   McKinley, P K ^a  

^a Michigan State University   (United States)

Author keywords

Algorithm design and analysis; Bandwidth; Costs; Delay; Inference algorithms; IP networks; Large scale systems; Network servers; Network topology; Web server

Indexed keywords

ALGORITHMS; BANDWIDTH; COST REDUCTION; COSTS; ELECTRIC NETWORK TOPOLOGY; INFERENCE ENGINES; INTERNET; LARGE SCALE SYSTEMS; NETWORK PROTOCOLS; OVERLAY NETWORKS; TOPOLOGY;

ALGORITHM DESIGN AND ANALYSIS; DELAY; INFERENCE ALGORITHM; IP NETWORKS; NETWORK SERVER; NETWORK TOPOLOGY; WEB SERVERS;

COST BENEFIT ANALYSIS;

EID: 84899801503     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2003.1249777     Document Type: Conference Paper

References (37)

1. Y. Chu, S. Rao, and H. Zhang, "A case for end system multicast," in Proceedings of ACM Sigmetrics, pp. 1-12, June 2000.
2. D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, "Resilient Overlay Networks," in Proceedings of 18th ACM Symposium on Operating Systems Principles (SOSP), pp. 131-145, October 2001.
3. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the Internet topology," in Proceedings of ACM SIGCOMM, pp. 251-262, September 1999.
4. NLANR, National Laboratory for Applied Network Research, http://moat.nlanr.net/Routing/rawdata, 2000.
5. R. Braynard, D. Kostic, A. Rodriguez, J. Chase, and A. Vahdat, "Opus: an overlay peer utility service," in Proceedings of the 5th International Conference on Open Architectures and Network Programming (OPENARCH), June 2002.
6. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems," in Proceedings of 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329-350, November 2001.
7. B. Zhao, J. Kubiatowicz, and A. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," Tech. Rep. UCB/CSD-01-1141, Computer Science Division, U.C. Berkeley, April 2001.
8. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," in Proceedings of ACM SIGCOMM, pp. 161-172, August 2001.
9. S. Banerjee, B. Bhattacharjee, and C. Kommareddy, "Scalable application layer multicast," in Proceedings of ACM SIGCOMM, pp. 205-220, August 2002.
10. B. Zhang, S. Jamin, and L. Zhang, "Host multicast: A framework for delivering multicast to end users," in Proceedings of IEEE INFOCOM, pp. 1366-1375, June 2002.
11. A. Shaikh, M. Goyal, A. Greenberg, R. Rajan, and K. Ramakrishnan, "An OSPF topology server: Design and evaluation," IEEE Journal of Selected Areas in Communications: Special Issue on Recent Advances on Fundamentals of Network Management, vol. 20, pp. 746-755, May 2002.
12. A. Bestavros, J. Byers, and K. Harfoush, "Inference and labeling of metric-induced network topologies," in Proceedings of IEEE INFOCOM, pp. 628-637, June 2002.
13. M. Coates, R. Castro, and R. Nowak, "Maximum likelihood network topology identification from edge-based unicast measurements," in Proceedings of ACM SIGMETRICS, June 2002.
14. N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP topologies with Rocketfuel," in Proceedings of ACM SIGCOMM, August 2002.
15. B. Yao, R. Viswanathan, F. Chang, and D. Waddington, "Topology inference in the presence of anonymous routers," in Proceedings of IEEE INFOCOM, April 2003.
16. M. Kwon and S. Fahmy, "Topology-aware overlay networks for group communication," in Proceedings of The 12th International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV 2002),May 2002.
17. W. Cui, I. Stoica, and R. H. Katz, "Backup path allocation based on a correlated link failure probability model in overlay networks," in Proceedings of 10th IEEE International Conference on Network Protocols (ICNP'02), pp. 236-247, November 2002.
18. M. Shih and A. Hero, "Unicast inference of network link delay distributions from edge measurements," in Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, May 2001.
19. N. Duffield and F. Presti, "Multicast inference of packet delay variance at interior network links," in Proceedings of IEEE INFOCOM, pp. 1351-1360, March 2000.
20. F. Presti, N. Duffield, J. Horowitz, and D. Towsley, "Multicast-based inference of network-internal delay distributions," Tech. Rep. TR99-55, University of Massachustts, November 1999.
21. V. N. Padmanabhan, L. Qiu, and H. J. Wang, "Server-based inference of Internet link lossiness," in Proceedings of IEEE INFOCOM, April 2003.
22. T. Bu, N. Duffield, F. Presti, and D. Towsley, "Network tomography on general topologies," in Proceedings of ACM SIGMETRICS, pp. 21-30, June 2002.
23. N. Duffield, F. Presti, V. Paxson, and D. Towsley, "Inferring link loss using striped unicast probes," in Proceedings of IEEE INFOCOM, pp. 915-923, April 2001.
24. M. Jain and C. Dovrolis, "End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput," in Proceedings of ACM SIGCOMM, August 2002.
25. G. McLachlan and T. Krishnan, The EM algorithm and extensions. John Wiley & Sons, 1997.
26. G. Liang and B. Yu, "Pseudo likelihood estimation in network tomography," in Proceedings of IEEE INFOCOM, April 2003.
27. P.Barford, A. Bestavros, J. Byers, and M. Crovella, "Onthe marginal utility of network topology measurements," in Proceedings of ACM SIGCOMM Internet Measurement Workshop, November 2001.
28. Y. Bejerano and R. Rastogi, "Robust monitoring of link delays and faults in IP networks," in Proceedings of IEEE INFOCOM, April 2003.
29. Y. Shavitt, X. Sun, A. Wool, and B. Yener, "Computing the unmeasured: an algebraic approach to Internet mapping," in Proceedings of IEEE INFOCOM, pp. 1646-1654, April 2001.
30. C. Tang and P. K. McKinley, "A distributed approach to topology-aware overlay path monitoring," Tech. Rep. MSUCSE-03-24, Computer Science and Engineering, Michigan State University, East Lansing, Michigan, August 2003.
31. Performance measurement tools taxonomy, http://www.caida.org/tools/taxonomy/performance.xml.
32. P. Crescenzi, V. Kann, M. Halldrsson, M. Karpinski, and G. Woeginger, "A compendium of NP optimization problems," http://www.nada.kth.se/?viggo/wwwcompendium/wwwcompendium.html.
33. D. Johnson, "Approximation algorithms for combinatorial problems," Journal of Computer and System Sciences, vol.9, pp. 256-278, 1974.
34. V. Chvatal, "A greedy heuristic for the set-covering problem," Mathematics of Operations Research, vol. 4, no. 3, pp. 233-235, 1979.
35. E. Zegura, K. Calvert, and S. Bhattacharjee, "How to model an internetwork," in Proceedings of IEEE INFOCOM, pp. 40-52, March 1996.
36. J. Winick and S. Jamin, "Inet 3.0: Internet topology generator," Tech. Rep. CSE-TR-456-02, Department of Computer Science, University of Michigan, Ann Arbor, Michigan, 2002.
37. C. Tang and P. K. McKinley, "On the cost-quality tradeoff in topology-aware overlay path probing," Tech. Rep. MSUCSE-03-9, Computer Science and Engineering, Michigan State University, East Lansing, Michigan, May 2003.