A coordinated data collection approach: Design, evaluation, and comparison

IEEE Journal on Selected Areas in Communications

Volumn 22, Issue 10, 2004, Pages 2004-2018

  Cheng, William C ^a   Chou, Cheng Fu ^b   Golubchik, Leana ^a   Khuller, Samir ^c   Wan, Yung Chun ^c  

^a University of Southern California ^*  (United States)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c University of Maryland ^*  (United States)

Author keywords

Data collection; Graph theory; Internet based applications; Performance evaluation; System design

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); DATA REDUCTION; GRAPH THEORY; INTERNET; PROBLEM SOLVING; SERVERS; SYSTEMS ANALYSIS; TOPOLOGY;

BISTROS; DATA COLLECTION; INTERNET-BASED APPLICATIONS; PERFORMANCE EVALUATION;

WIDE AREA NETWORKS;

EID: 10844251234     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2004.836009     Document Type: Article

References (33)

1. IRS. Fill-in forms. [Online]. Available: http://www.irs.gov/formspubs/ lists/0,id=97401,00.html
2. S. Bhattacharjee, W. C. Cheng, C.-F. Chou, L. Golubchik, and S. Khuller, "Bistro: A platform for building scalable wide-area upload applications," in Proc. ACM SIGMETRICS Performance Evaluation Review, vol. 28, Sept. 2000, pp. 29-35.
3. B. Schneier, Applied Cryptography, 2nd ed. New York: Wiley, 1996.
4. T. Leighton, "The challenges of delivering content on the Internet," in Proc. ACM SIGMETRICS 2001 Conf. Cambridge, MA, June 2001, p. 214.
5. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1993.
6. B. R. Badrinath and P. Sudame, "Gathercast: An efficient mechanism for multipoint to point aggregation in IP networks," Comput. Sci. Dept., Rutgers Univ., Piscataway. NJ, Tech. Rep. DCSTR-362, July 1998.
7. K. Calvert, J. Griffioen, B. Mullins, A. Sehgal, and S. Wen, "Concast: Design and implementation of an active network service," IEEE Trans. Networking, vol. 19, pp. 426-437, 2000.
8. S. Savage, A. Collins. and E. Huffman, "The end-to-end effects of Internet path selection," in Proc. ACM SIGCOMM'99 Conf. Applications, Technologies, Architectures, Protocols for Computer Communication. 1999, pp. 289-299.
9. S. Savage, T. Anderson, A. Aggarwal, D. Becker, N. Cardwell, A. Collins, E. Hoffman, J. Snell, A. Vahdat, G. Voelker, and J. Zahorjan, "Detour: A case for informed Internet routing and transport," IEEE Micro Mag., vol. 19, pp. 50-59, Jan. 1999.
10. D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, "Resilient overlay networks," in Proc. 18th ACM SOSP Conf., Banff, Canada, Oct. 2001, pp. 131-145.
11. W. Cheng, C.-F. Chou, L. Golubchik, S. Khuller, and Y.-C. Wan, "Large scale data collection: A coordinated approach," in Proc. IEEE INFOCOM, Mar-Apr. 2003, pp. 218-228.
12. C.-F. Chou, Y.-C. Wan, W. C. Cheng, L. Golubchik, and S. Khuller, "A performance study of a large-scale data collection problem," in Proc. 7th Int. Workshop Web Content Caching Distribution, Aug. 2002, pp. 259-272.
13. The network simulator - ns-2. [Online]. Available: http://www.isi.edu/ nsnam/ns/
14. P. Francis, S. Jamin, V. Paxson, L. Zhang, D. Gryniewicz, and Y. Jin. (1999) Internet distance map service. [Online]. Available: http://idmaps.eecs. umich.edu/
15. K. Moore, J. Cox. and S. Green, "SONAR - A network proximity service," IETF, Internet-Draft, 1996.
16. R. Wolski and M. Swany. (1999) Network weather service. [Online]. Available: http://nws.cs.ucsb.edu/
17. G. Dantzig, Linear Programming and Extensions. Princeton, NJ: Princeton Univ. Press, 1963.
18. L. Ford and D. Fulkerson, Flows in Networks, NJ: Princeton Univ. Press, 1962.
19. B. Hoppe and E. Tardos, "Polynomial time algorithms for some evacuation problems." in Proc. SODA: ACM-SIAM Symp. Discrete Algorithms. 1994, pp. 512-521.
20. A. V. Goldberg. "An efficient implementation of a scaling minimum-cost flow algorithm." J. Algorithms, vol. 22, no. 1, pp. 1-29, 1997.
21. _, (2001) Andrew Goldberg's network optimization library. [Online]. Available: http://www.avglab.com/andrew/soft.html
22. B. Hoppe and E. Tardos. "The quickest transshipment problem." in Proc. SODA: ACM-SIAM Symp. Discrete Algorithms, 1995, pp. 441-443.
23. W. C. Cheng, C.-F. Chou, L. Oolubchik, S. Khuller, and Y. Wan, "On a graph-theoretic approach to scheduling large-scale data transfers," Univ. Maryland, College Park, MD, Tech. Rep. CS-TR-4322, Jan. 2002.
24. J. M. Kleinberg, "Single-source unsplittable flow," in Proc. IEEE Symp. Foundations Computer Science, 1996, pp. 68-77.
25. Y. Dinitz, N. Garg, and M. Goemans, "On the single source unsplittable flow problem," in Proc. FOCS, 1998, pp. 290-299.
26. D. Rubenstein, J. F. Kurose, and D. F. Towsley, "Detecting shared congestion of flows via end-to-end measurement," in Proc. 2000 ACM SIG-METRICS Conf., 2000, pp. 145-155.
27. Georgia Tech Internetwork topology generator. [Online]. Available: http://www.cc.gatech.edu/fac/Ellen.Zegura/graphs.html
28. R. L. Carter and M. E. Crovella, "Measuring bottleneck link speed in packet-switched networks," Perform. Eval, vol. 27 and 28, pp. 297-318, 1996.
29. A. B. Downey, "Using pathchar to estimate internet link characteristics," in Proc. ACM SICCOMM, 1999, pp. 241-250.
30. V. Jacobson. (1997). pathchar. [Online]. Available: ftp://ftp.ee.lbl.gov/ pathchar/
31. K. Lai and M. Baker, "Nettimer: A tool for measuring bottleneck link bandwidth," in Proc. USENIX Symp. Internet Technologies Systems, Mar. 2001, pp. 123-134.
32. B. A. Mah. (2001). pchar. [Online]. Available: http://www.em-ployees.org/ ~bmah/Software/pchar/
33. S. Seshanm, M. Stemm, and R. Katz, "SPAND: Shared passive network performance discovery," in Proc. 1st USENIX Symp. Internet Technologies Systems. Tel-Aviv, Israel, Dec. 1997, pp. 285-294.