Riad Mokadem
ABSTRACT
Using Distributed Hash Tables (DHT) for resource discovery in large-scale systems generates considerable maintenance overhead. This not only increases the bandwidth consumption but also affect the routing efficiency. In this paper, we deal with resource discovery while minimizing maintenance overhead in hierarchical DHT systems. The considered resources are metadata describing the data sources. In our solution, only one gateway in one overlay is attached to the superior level overlay. It aims to reduce both lookup and maintenance costs while minimizing the overhead added to the system. We present a cost analysis for a resource discovery process and discuss capabilities of the proposed protocol to reduce the overhead of maintaining the overlay network. The analysis result proved that our design decrease significantly the maintenance costs in such systems especially when nodes frequently join/leave the system.
- Foster, I. (editor), Berry, D., Djaoui, A., Grimshaw, A., Horn, B., Kishimoto, H. (editor), Maciel, F., Savva, A., Siebenlist, F., Subramania, R., Treadwell, J. and Von Reich, J.: The Open Grid Services Architecture, Version 1.0. July'04. Global Grid Forum.Google Scholar
- http://Freepastry.org/FreePastry/.Google Scholar
- L. Garces-Erice, E. W. Biersack, K. W. Ross, P. A. Felber, G. Urvoy-Keller. Hierarchical Peer to Peer Systems. In Proc. of ACM/IFIP Int. Conf. on Parallel and Distributed Computing '03.Google Scholar
- P. Ganesan, K. Gummadi, and H. Garcia-Molina. Canon in g major: designing DHTs with hierarchical structure. In Proc of 24th Intern. Conf. on Distributed Computing Systems, pp 263--272, 2004. Google ScholarDigital Library
- The Web Services Resource Framework, http:\\www.globus.org/wsrf.Google Scholar
- GRID'5000. www.grid5000.orgGoogle Scholar
- P. B. Godfrey, S. Shenker, and I. Stoica. Minimizing Churn in Distributed Systems. Proc. of the Int. Conf. on Applications, Technologies, architectures, and protocols for computer communications pp 147--158, SIGCOMM. Italy 2006. Google ScholarDigital Library
- A Hameurlain. Data Management in Grid & P2P Systems. Intern. Jour. of Computer Systems Science and Engineering, CRL Publishing, Leicester - UK, Vol. 23 N. 2, 2008Google Scholar
- N Harvey & al. Skipnet: A Scalable Overlay Network with Practical Locality Proprieties. In Proc of USITIS 2003, Seattle. Google ScholarDigital Library
- Gupta I & al. Kelips: building an efficient and stable P2P DHT through increased memory and background overhead. Lecture notes in computer science, 2003. Springer.Google Scholar
- A. Montresor, "A Robust Protocol for Building Superpeer Overlay Topologies," in IEEE International Conference on Peer-to-Peer Computing (P2P 2004). Google ScholarDigital Library
- I. Martinez-Yelmo, R. C Rumín, C. Guerrero, A. Mauthe: Routing Performance in a Hierarchical DHT-based Overlay Network. Proc. of the 6th IEEE Euromicro Intern. Conf. on Parallel, Distributed and Network-Based Processing (PDP 2008), 508--515., Toulouse, France. Google ScholarDigital Library
- A. Mislove and P. Druschel. Providing administrative control and autonomy in structured overlays. In Proceedings of IPTPS'04, pp 162--172. San Diego, CA, February 2004. Google ScholarDigital Library
- Mastroianni C, Talia D and Verta O. A Super Peer Model for Building Resource Discovery Services in Grids: Design & Simulation Analysis. Future Generation Computer Systems. Elsevier 20005. Google ScholarDigital Library
- Mastroianni C., Talia D. and Verta O. Evaluating Resource Discovery Protocols for Hierarchical and Super-Peer Grid Information Systems. 19th Euromicro Intern. Conf. on Parallel, Distributed and Network-Based Processing (PDP'07). Google ScholarDigital Library
- E. Pacitti, P Valduriez & M Mattosso. Grid data management: Open Problems and News Issues"; In Intl. Jour. Grid Computing; Springer, 2007, Vol. 5, pp. 273--281.Google Scholar
- S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling churn in a dht," in Proceedings of the Usenix Annual Technical Conference, Boston, USA. 2004. Google ScholarDigital Library
- Rowston A & Druschel P. Pastry: Scalable Distributed object location and routing for large-scale peer-to-peer systems. Proceeding of the 18th IFIP/ACM international conference on Distributed Systems Platforms. Vol 2218, 2001, pp 329--350. Google ScholarDigital Library
- M. Sánchez-Artigas, P. Garcýa, J. Pujol, and A. G. Skarmeta, "Cyclone: A Novel Design Schema for Hierarchical DHTs," in IEEE Intern. Conf. on P2P Computing (P2P 2005). Google ScholarDigital Library
- M E. Samad, F Morvan, A Hameurlain: Resource Discovery for Query Processing in Data Grids. pp 59--66, ISCA PDCCS'09.Google Scholar
- Stoica, Morris, Karger, Kaashoek, Balakrishma. CHORD: A scalable Peer to Peer Lookup Service for Internet Application. SIGCOMM'O, August 27--31, 2001, San Diego. Google ScholarDigital Library
- Z. Xu, R. Min, and Y. Hu. Hieras: a Dht Based Hierarchical P2P Routing Algorithm. In Proceedings of Intern. Conf on Parallel Processing, pp 187--194, 2003.Google Scholar
- B. Yang and H. Garcia-Molina, "Designing a Super-Peer Network," in Intern. Conf. on Data Engineering (ICDE 2003).Google Scholar
- S Zöls, Z Despotovic, W Kellerer. Cost-Based Analysis of Hierarchical DHT Design. 6th Intern. Conf. on Peer-to-Peer Computing (P2P 2006). United Kingdom. IEEE Computer Society, pp 233--239. Google ScholarDigital Library
- S Zöls, Q Hofstatter, Z Despotovic, W Kellerer. Achieving and maintaining Cost-Optimal Operation of a Hierarchical DHT System. Proceeding of the IEEE Intern. Conf. on communication ICC 2009, Germany. Google ScholarDigital Library
- B Zhao, Kobiatowicz and Joseph AD. Tapestry: A resilient global -- scale overlay for service deployment. IEEE journal on selected Areas in communications 22 vol 1, 2004, p 41--53. Google ScholarDigital Library
Index Terms
- Resource discovery service while minimizing maintenance overhead in hierarchical DHT systems
Recommendations
Resource Discovery Service while Minimizing Maintenance Overhead in Hierarchical DHT Systems
Despite hierarchical Distributed Hash Table (DHT) systems have addressed flat overlay system problems, most of existing solutions add a significant overhead to large scale systems. This not only increases the bandwidth consumption but also affect the ...
Performance Analysis of DHT Algorithms for Range-Query and Multi-Attribute Resource Discovery in Grids
ICPP '09: Proceedings of the 2009 International Conference on Parallel ProcessingResource discovery is critical to the usability and accessibility of grid computing systems. Distributed Hash Table (DHT) has been applied to grid systems as a distributed mechanism for providing scalable range-query and multiattribute resource ...
A P2P-based intelligent resource discovery mechanism in Internet-based distributed systems
Internet-based distributed systems enable globally-scattered resources to be collectively pooled and used in a cooperative manner to achieve unprecedented petascale supercomputing capabilities. Numerous resource discovery approaches have been proposed ...
Comments