PIRD: P2P-based intelligent resource discovery in internet-based distributed systems

Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008

Volumn , Issue , 2008, Pages 858-865

  Shen, Haiying ^a   Li, Ze ^a   Li, Ting ^a   Zhu, Yingwu ^b  

^a University of Arkansas   (United States)

^b SEATTLE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTING SYSTEMS; DISTRIBUTED SYSTEMS; INTELLIGENT RESOURCE DISCOVERY; INTERNATIONAL CONFERENCES; LOCALITY-SENSITIVE HASHING; MULTI ATTRIBUTES; MULTIPLE MESSAGES; P2P STRUCTURE; RESOURCE DISCOVERY; SIMULATION RESULTS; STRUCTURED P2P; SYSTEM PERFORMANCES; THEORETICAL ANALYSIS;

COMPUTER SYSTEMS; ELECTRIC NETWORK ANALYSIS; INTERNET; MAPS;

INTELLIGENT SYSTEMS;

EID: 51649096879     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2008.9     Document Type: Conference Paper

References (26)

1. LSH Algorithm and Implementation (E2LSH). website: http://web.mit.edu/ andoni/www/LSH/index.html.
2. A. Andrzejak and Z. Xu. Scalable, Efficient Range Queries for Grid Information Services. In Proc. of P2P, pages 33-40, 2002.
3. T. Asano, D. Ranjan, T. Roos, E. Welzl, and P. Widmaier. Space filling curves and their use in geometric data structure. Theoretical Computer Science, 181(1):3-15, 1997.
4. A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: Supporting Scalable Multi-Attribute Range Queries. In Proc. of ACM SIGCOMM, pages 353-366, 2004.
5. M. Cai, M. Frank, and P. Szekely. MAAN: A Multi-Attribute Addressable Network for Grid Information Services. Grid Computing, 2(1):3-14, 2004.
6. A. Chien, B. Calder, S. Elbert, and K. Bhatia. Entropia: Architecture and Performance of an Enterprise Eesktop Grid System. JPDC, 63(5), May 2003.
7. F. B. et. al. Adaptive Computing on the Grid Using AppLeS. TPDS, 14(4), Apr. 2003.
8. I. Foster and C. Kesselman. Globus: a Metacomputing Infrastructure Toolkit. Int. J. High Performance Computing Applications, 2:115-128, 1997.
9. J. Frey, T. Tannenbaum, I. Foster, M. Livny, and S. Tuecke. Condor-G: a Computation Management Agent for Multiinstitutional Grids. In Proc. IEEE HPDC, 2001.
10. A. Fu, P. M. S. Chan, Y. L. Cheung, and Y. S. Moon. Dynamic VP-Tree Indexing for N-Nearest Neighbor Search Given Pair-Wise Distances. VLDB Journal, (2):154-173, 2000.
11. C. Germain, V. Neri, G. Fedak, and F. Cappello. XtremWeb: Building an Experimental Platform for Global Computing. In Proc. of IEEE/ACM Grid, Dec. 2000.
12. A. Gionis, P. Indyk, and R. Motwani. Similarity Search in High Dimensions via Hashing. The VLDB Journal, pages 518-529, 1999.
13. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. of ACM STOC, pages 604-613, 1998.
14. M. Mutka and M. Livny. Scheduling Remote Processing Capacity in a Workstation-Processing Bank Computing System. In Proc. of ICDCS, September 1987.
15. M. O. Neary, S. P. Brydon, P. Kmiec, S. Rollins, and P. Capello. Javelin++: Scalability Issues in Global Computing. Future Generation Computing Systems Journal, 15(5-6):659-674, 1999.
16. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-aware overlay construction and server selection. In Proc. of INFOCOM, 2002.
17. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Proc. of Middleware, pages 329-350, 2001.
18. C. Schmidt and M. Parashar. Flexible Information Discovery in Decentralized Distributed Systems. In Proc. of HPDC, pages 226-235, 2003.
19. H. Shen, A. Apon, and C. Xu. LORM: Supporting Low-Overhead P2P-based Range-Query and Multi-Attribute Resource Management in Grids. In Proc. of ICPADS, 2007.
20. H. Shen, Z. Li, and T. Li. PIRD: P2P-based Intelligent Resource Discovery in Internet-based Distributed. Technical Report TR-08-062, University of Arkansas, 2008.
21. H. Shen and C. Xu. Locality-Aware and Churn-Resilient Load Balancing Algorithms in Structured Peer-to-Peer Networks. TPDS, 2007.
22. H. Shen, C. Xu, and G. Chen. Cycloid: A Scalable Constant-Degree P2P Overlay Network. Performance Evaluation, 63(3):195-216, 2006.
23. I. Stoica, R. Morris, D. Liben-Nowell, and et al. Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. TON, 1(1):17-32, 2003.
24. T. A. Welch. A Technique for High Performance Data Compression. IEEE Computer, (6):8-19, 1984.
25. Z. Xu and et al. Turning Heterogeneity into an Advantage in Overlay Routing. In Proc. of INFOCOM, 2003.
26. E. Zegura, K. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proc. of INFOCOM, 1996.