Exploiting heterogeneity for collective data downloading in volunteer-based networks

Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007

Volumn , Issue , 2007, Pages 275-282

  Kim, Jinoh ^a   Chandra, Abhishek ^a   Weissman, Jon ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; DATA ACQUISITION; HEURISTIC METHODS; NATURAL SCIENCES COMPUTING; SERVERS;

COMPUTATION NODES; DATA SERVERS; VOLUNTEER-BASED NETWORK;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34548329800     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2007.50     Document Type: Conference Paper

References (21)

1. D. P. Anderson. BOINC: A system for public-resource computing and storage. In Proc. of the Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04), pages 4-10, 2004.
2. D. P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer. Seti@home: an experiment in public-resource computing. Communications of the ACM, 45(11):56-61, 2002.
3. BLAST: The basic local alignment search tool, http://www.ncbi.nlm.nih. gov/blast.
4. caBIG: cancer biomedical informatics grid, http://cabig.cancer.gov/index. asp.
5. R. Carter and M. Crovella. Dynamic server selection using bandwidth probing in wide-area networks. Technical report, Boston University, MA, USA, 1996.
6. B. Cohen. Incentives build robustness in bittorrent. In Workshop on Economics of Peer-to-Peer Systems, 2003.
7. M. Costa, M. Castro, A. Rowstron, and P. Key. Pic: Practical internet coordinates for distance estimation. In International Conference on Distributed Systems, 2004.
8. F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: a decentralized network coordinate system. In SIGCOMM'04, pages 15-26, 2004.
9. ePCRN: electronic primary care research network, http://www.epcrn.org.
10. P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, and L. Zhang. Idmaps: a global internet host distance estimation service. IEEE/ACM Trans. Netw., 9(5):525-540, 2001.
11. FreePastry, http://freepastry.org.
12. PlanetLab Iperf, http://jabber.services.planetlab.org/php/iperf.
13. E. Ng and H. Zhang. Predicting internet network distance with coordiantes-based approaches. In Proc. of IEEE INFOCOM'02, pages 170-179, 2002.
14. T. Ogino, M. Kosaka, Y Hariyama, K. Matsuda, and K. Sudo. Study of an efficient server selection method for widely distributed web server networks. In 10th Annual Internet Society Conference, 2000.
15. PPDG: Particle physics data grid, http://www.ppdg.net.
16. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In SIGCOMM '01, pages 161-172, 2001.
17. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically aware overlay construction and server selection. In Proc. of IEEE INFOCOM'02, 2002.
18. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218:329+, 2001.
19. M. Sayal, Y Breitbart, P. Scheuermann, and R. Vingralek. Selection algorithms for replicated web servers. SIGMET-RICSPerform. Eval. Rev., 26(3):44-50, 1998.
20. B. Wei, G. Fedak, and F. Cappello. Scheduling independent tasks sharing large data distributed with bittorrent. In Proc. of the 6th IEEE/ACM International Workshop on Grid Computing (GRID'05), 2005.
21. B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. In IEEE Journal on Selected Areas in Communications, 2003.