A novel load balancing mechanism for P2P networking

GridNets 2007 - Proceedings of the 1st International Conference on Networks for Grid Applications

Volumn , Issue , 2007, Pages

  Lymberopoulos, Leonidas ^a   Papavassiliou, Symeon ^a   Maglaris, Vasilis ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Distributed K D tree; P2P grid information service; P2p load balancing

Indexed keywords

COMPLEX NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; FORESTRY; INFORMATION SERVICES; TREES (MATHEMATICS);

DISRUPTIVE TECHNOLOGY; DISTRIBUTED APPLICATIONS; K-D TREE; LOAD BALANCING ALGORITHMS; LOAD-BALANCING MECHANISMS; P2P GRIDS; PEER-TO-PEER NETWORKING; SCALABLE GRID INFORMATION;

PEER TO PEER NETWORKS;

EID: 84887179890     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4108/gridnets.2007.2254     Document Type: Conference Paper

References (20)

1. S. Basu, S. Banerjee, P. Sharma, S. J. Lee: NodeWiz: Peer-topeer Resource Discovery for Grids, in Proc. of the IEEE International Symposium on Cluster Computing and the Grid, (CCGrid 2005), pp213-220, May 2005.
2. Chi Zhang Arvind Krishnamurthy Randolph Y. Wang. Ârushwood: Distributed Trees in Peer-to-Peer Systems. In Proc. 4th International Workshop of Peer to Peer Systems, Ithaca, NY, Feb. 2000.
3. J. L. Bentley: Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9), 1975.
4. Kazaa. Available from http://www.kazaa.com
5. Gnutella. Available from http://www.gnutella.com
6. Risson, J. and Moors, T. Survey of research towards robust peer-to-peer networks: Search methods. In Computer Networks, Volume 50, Issue 17, 5 December 2006
7. Stoica I., Morris R., Karger D., Frans Kaashoek M., Balakrishnan H.: Chord: A scal-able peer-to-peer lookup service for Internet applications, In Proc. ACM SIGCOM, San Diego, 2001.
8. S. Ratnasamy, P. Francis, M. Handley, R. M. Karp S. Shenker: A Scalable Content-Addressable Network, in Proc. ACM SIGCOMM 2001 Conf. on Applications, Tech nologies, Architectures, and Protocols for Computer Communication, pp. 161-172, 2001.
9. M. Cai, M. Frank, J. Chen, P. Szekely: MAAN: A multiattribute addressable network for grid information services, In the 4th Inernational Workshop on Grid Computing, 2003.
10. A. R. Bharambe, M. Agrawal S. Seshan: Mercury: Supporting Scalable Multi-Attribute Range Queries, in Proc. ACM SIGCOMM 2004 Conference on Applica-tions, Technologies, Architectures, and Protocols for Computer Communication, pp. 353-366, 2004.
11. C. Zhang, A. Krishnamurthy, R. Y. Wang: SkipIndex: Towards a scalable peer to-peer index service for high dimensional data. Technical Report TR-703-04, Prince-ton Univ. CS, 2004.
12. P. Ganesan, B. Yang H. Garcia-Molina: One Torus to Rule them All: Multidimen-sional Queries in P2P Systems. In Proceedings of the 7th International Workshop on the Web and Databases (WebDB'04).
13. Jagadish, H. V., Ooi, B. C., and Vu, Q. H. 2005. BATON: a balanced tree structure for peer-to-peer networks. In Proceedings of the 31st international Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 02, 2005.
14. J. Aspnes, G. Shah: Skip Graphs. In Proceedings of Symposium on Discrete Algorithms, 2003.
15. Friedman, J. H., Bentley, J. L., and Finkel, R. A.. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software, 3(3):209-226, 1977.
16. Pugh, William. Skip Lists: A Probabilistic Alternative to Balanced Trees. In Proceedings of Workshop on Algorithms and Data Structures, pp. 437-449", 1989.
17. The Universal Description, Discovery and Integration (UDDI) protocol. Available from http://www.uddi.org
18. Web Services Description Language (WSDL). Available from http://www.w3.org/TR/wsdl
19. gLite. Available from http://glite.web.cern. ch/glite
20. GRIA. Available from http://www.gria.org