A dynamic prefix tree for service discovery within large scale grids

Proceedings - 6th IEEE International Conference on Peer-to-Peer Computing, P2P 2006

Volumn , Issue , 2006, Pages 106-113

  Caron, Eddy ^a   Desprez, Frédéric ^a   Tedeschi, Cédric ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE; LINEAR ALGEBRA;

ANALYSIS AND SIMULATION; AUTOMATIC COMPLETION; COMPUTATIONAL GRIDS; LINEAR ALGEBRA LIBRARIES; PEER-TO-PEER ENVIRONMENTS; PEER-TO-PEER SYSTEM; PEER-TO-PEER TECHNOLOGIES; UNDERLYING NETWORKS;

PEER TO PEER NETWORKS;

EID: 38349081387     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2006.16     Document Type: Conference Paper

References (21)

1. A. Andrzejak and Z. Xu. Scalable, efficient range queries for grid information services. In Peer-to-Peer Computing, pages 33-40, 2002.
2. J. Aspnes and G. Shah. Skip graphs. In Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 384-393, January 2003.
3. M. Balazinska, H. Balakrishnan, and D. Karger. INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery. In Pervasive, 2002.
4. S. Basu, S. Banerjee, P. Sharma, and S. Lee. NodeWiz: Peer-to-Peer Resource Discovery for Grids. In 5th International Workshop on Global and Peer-to-Peer Computing (GP2PC), May 2005.
5. A. Datta, M. Hauswirth, R. John, R. Schmidt, and K. Aberer. Range queries in trie-structured overlays. In The Fifth IEEE International Conference on Peer-to-Peer Computing, 2005.
6. J. J. Dongarra, J. Du Croz, S. Hammarling, and I. S. Duff. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw., 16(1):1-17, 1990.
7. I. Foster and A. Iamnitchi. On death, taxes, and the convergence of peer-to-peer and grid computing. In IPTPS, pages 118-128, 2003.
8. P. Ganesan, B. Yang, and H. Garcia-Molina. One torus to rule them all: multi-dimensional queries in p2p systems. In WebDB'04: The 7th International Workshop on the Web and Databases, pages 19-24, 2004.
9. L. Garces-Erice, E. W. Biersack, K. W. Ross, P. A. Felber, and G. Urvoy-Keller. Hierarchical Peer-to-Peer Systems. Parallel Processing Letters Volume 13, 2003.
10. B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica. Load balancing in dynamic structured P2P systems. In Proc. IEEE INFOCOM, Hong Kong, 2004.
11. M. Harren, J. Hellerstein, R. Huebsch, B. Loo, S. Shenker, and I. Stoica. Complex Queries in DHT-Based Peer-To-Peer Networks, 2002.
12. J. Ledlie and M. Seltzer. Distributed, secure load balancing with skew, heterogeneity, and churn. In Proc. IEEE INFOCOM, Miami, 2005.
13. D. Oppenheimer, J. Albrecht, D. Patterson, and A. Vahdat. Distributed Resource Discovery on PlanetLab with SWORD. In Proceedings of the ACM/USENIX Workshop on Real, Large Distributed Systems (WORLDS), December 2004.
14. S. Ramabhadran, S. Ratnasamy, J. M. Hellerstein, and S. Shenker. Prefix hash tree an indexing data structure over distributed hash tables. In Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, St. John's, Newfoundland, Canada, 2004.
15. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Adressable Network. In ACM SIGCOMM, 2001.
16. C. Schmidt and M. Parashar. Enabling flexible queries with guarantees in p2p systems. IEEE Internet Computing, 8(3):19-26, 2004.
17. P. Triantafillou and T. Pitoura. Towards a Unifying Framework for Complex Query Processing over Structured Peer-to-Peer Data Networks. In DBISP2P 2003, September 2003.
18. Z. Xu, M. Mahalingam, and M. Karlsson. Turning Heterogeneity into an Advantage in Overlay Routing. In INFOCOM, 2003.
19. Z. Xu, R. Min, and Y. Hu. HIERAS: A DHT Based Hierarchical P2P Routing Algorithm. In ICPP, 2003.
20. Z. Xu and Z. Zhang. Building Low-Maintenance Expressways for P2P Systems. Technical report, Hewlett-Packard Labs, April 2002.
21. B. Y. Zhao, Y. Duan, L. Huang, A. D. Joseph, and J. D. Kubiatowicz. Brocade: Landmark Routing on Overlay Networks. In IPTPS 2002.