Contention-based performance evaluation of multidimensional range search in peer-to-peer networks

Future Generation Computer Systems

Volumn 25, Issue 1, 2009, Pages 100-108

  Blanas, Spyros ^a   Samoladas, Vasilis ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

Peer to peer networks; Performance evaluation

Indexed keywords

AD HOC NETWORKS; CLIENT SERVER COMPUTER SYSTEMS; INTERNET; QUERY PROCESSING; TELECOMMUNICATION NETWORKS;

PEER-TO-PEER NETWORKS; PERFORMANCE EVALUATION;

COMPUTER NETWORKS;

EID: 51049083830     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2008.04.003     Document Type: Article

References (33)

1. Aberer K., Cudré-Mauroux P., Datta A., Despotovic Z., Hauswirth M., Punceva M., and Schmidt R. P-Grid: A self-organizing structured P2P system. SIGMOD Record 32 3 (2003)
2. L. Arge, D. Eppstein, M.T. Goodrich, Skip-webs: Efficient distributed data structures for multi-dimensional data sets, in: PODC, 2005, pp. 69-76
3. J. Aspnes, G. Shah, Skip graphs, in: SODA, Philadelphia, PA, USA, 2003, pp. 384-393
4. A.R. Bharambe, M. Agrawal, S. Seshan, Mercury: Supporting scalable multi-attribute range queries, in: SIGCOMM, 2004, pp. 353-366
5. Y. Chawathe, S. Ramabhadran, S. Ratnasamy, A. LaMarca, S. Shenker, J. Hellerstein, A case study in building layered DHT applications, in: SIGCOMM, 2005, pp. 97-108
6. P. Ciaccia, M. Patella, P. Zezula, M-tree: An efficient access method for similarity search in metric spaces, in: VLDB, 1997, pp. 426-435
7. A. Crainiceanu, P. Linga, J. Gehrke, J. Shanmugasundaram, Querying peer-to-peer networks using P-trees, in: WebDB, 2004, pp. 25-30
8. A. Datta, M. Hauswirth, R. John, R. Schmidt, K. Aberer, Range queries in trie-structured overlays, in: P2P, 2005, pp. 57-66
9. P. Ganesan, B. Yang, H. Garcia-Molina, One torus to rule them all: Multidimensional queries in P2P systems, in: WebDB, 2004, pp. 19-24
10. Z. Ge, D.R. Figueiredo, S. Jaiswal, J.F. Kurose, D.F. Towsley, Modeling peer-peer file sharing systems, in: INFOCOM, 2003
11. S.-T. Goh, P. Kalnis, S. Bakiras, K.-L. Tan, Real datasets for file-sharing peer-to-peer systems, in: DASFAA, 2005, pp. 201-213
12. A. Gupta, D. Agrawal, A. el Abbadi, Approximate range selection queries in peer-to-peer systems, in: CIDR, 2003
13. A. Haeberlen, A. Mislove, A. Post, P. Druschel, Fallacies in evaluating decentralized systems, in: IPTPS, 2006
14. R. Huebsch, J.M. Hellerstein, N. Lanham, B.T. Loo, S. Shenker, I. Stoica, Querying the internet with PIER, in: VLDB, 2003, pp. 321-332
15. H.V. Jagadish, B.C. Ooi, Q.H. Vu, BATON: A balanced tree structure for peer-to-peer networks, in: VLDB, 2005, pp. 661-672
16. H.V. Jagadish, B.C. Ooi, Q.H. Vu, R. Zhang, A. Zhou, VBI-tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes, in: ICDE, 2006, p. 34
17. Kalnis P., Ng W.S., Ooi B.C., and Tan K.-L. Answering similarity queries in peer-to-peer networks. Information Systems 31 1 (2006) 57-72
18. I. Kamel, C. Faloutsos, Hilbert R-tree: An improved R-tree using fractals, in: VLDB, 1994, pp. 500-509
19. D.R. Karger, M. Ruhl, Simple efficient load balancing algorithms for peer-to-peer systems, in: SPAA, 2004, pp. 36-43
20. Lavenberg S.S. Computer Performance Modeling Handbook (1983), Academic Press, Inc., Orlando, FL, USA
21. Lazowska E.D., Zahorjan J., Graham G.S., and Sevcik K.C. Quantitative System Performance: Computer System Analysis Using Queueing Network Models (1984), Prentice-Hall, Inc., Upper Saddle River, NJ, USA
22. D. Liben-Nowell, H. Balakrishnan, D. Karger, Analysis of the evolution of peer-to-peer systems, in: PODC, 2002, pp. 233-242
23. Liu L., Antonopoulos N., and Mackin S. Fault-tolerant peer-to-peer search on small-world networks. Future Generation Computer Systems 23 8 (2007) 921-931
24. Mastroianni C., Talia D., and Verta O. A super-peer model for resource discovery services in large-scale Grids. Future Generation Computer Systems 21 8 (2005) 1235-1248
25. P. Maymounkov, D. Mazières, Kademlia: A peer-to-peer information system based on the XOR metric, in: IPTPS, 2002, pp. 53-65
26. S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Schenker, A scalable content-addressable network, in: SIGCOMM, 2001, pp. 161-172
27. A. Rowstron, P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, in: Distributed Systems Platforms (Middleware), 2001, pp. 329-350
28. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, in: SIGCOMM, 2001, pp. 149-160
29. C. Tang, S. Dwarkadas, Z. Xu, On scaling latent semantic indexing for large peer-to-peer systems, in: SIGIR, 2004, pp. 112-121
30. The R-tree portal, http://www.rtreeportal.org
31. Trunfio P., Talia D., Papadakis H., Fragopoulou P., Mordacchini M., Pennanen M., Poov K., Vlassov V., and Haridi S. Peer-to-peer resource discovery in grids: Models and systems. Future Generation Computer Systems 23 7 (2007) 864-878
32. D. Tsoumakos, N. Roussopoulos, Analysis and comparison of P2P search methods, in: InfoScale, 2006
33. C. Zheng, G. Shen, S. Li, S. Shenker, Distributed segment tree: Support of range query and cover query over DHT, in: IPTPS, 2006