Abstract
As the development of hardware and software, large scale, flexible, distributed, secure and coordinated resource sharing has attracted much attention. One of the major challenges is to support distributed group-based resource management, e.g. interest-based organization, with resources/services classifiable. Although there have been some proposals to address this challenge, they share the same weakness of using either severs or super peers to keep global knowledge, and win good search efficiency at the expenses of the system scalability. As a result, such designs can not keep both the search efficiency and system scalability. To that end, this paper proposes a group-based distributed architecture. It organizes the nodes inside the groups by Chord protocol, a classical Peer-to-Peer (P2P) technology and it defines new communication protocol for nodes among different groups but removes servers/super peers for group management. Such a design keeps the resource classifiable property together with good system performance. The main characteristics of this architecture are highlighted by its convenience for group activity analysis, promising scalability, high search efficiency, as well as robustness. The experimental performance results presented in the paper demonstrate the efficiency of the design.
Similar content being viewed by others
References
Zhuge H. The Knowledge Grid. Singapore: World Scientific Publishing Co., 2004
Kesselman C, Foster I. The Grid: Blueprint for a New Computing Infrastructure. San Francisco: Morgan Kaufmann Publishers, 1998
Zettsu K, Nakanishi T, Iwazume M, et al. Knowledge cluster systems for knowledge sharing, analysis and delivery. In: Jaakkola H, Kiyoki Y, Tokuda T. Froutiers in Artificial Intelligence and Applications. Amsterdam: IOS Press, 2007, 282–289
Karger D, Kaashoek F, Stoica I, et al. Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. of ACM 2001. New York: ACM Press, 2001, 149–160
Andrzejak A, Xu Z. Scalable, efficient range queries for grid information services. In: the second international conference on Peer-to-Peer computing. Wahsington D.C.: IEEE Computing Soceity, 2002, 33
Zhu C, Liu Z, Zhang W, et al. Using service taxonomy to facilitate efficient decentralized grid service discovery. In: Proceedings of GCC’2004. Berlin: Springer, 2004, 34–41
Zhu C, Liu Z, Zhang W, et al. An efficient decentralized grid service discovery approach based on service ontology. In Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence. Washington D.C.: IEEE Computer Society, 2004, 570–573
Talia D, Trunfio P. Peer-to-peer services for distributed resource discovery on grids. In www.ics.forth.gr/dcs/coregridworkshop/abstracts/Domenico-Talia.pdf.
Basu S, Banerjee S, Sharma P, et al. Nodewiz: Peer-to-peer resource discovery for grids. In: Proceedings of IEEE/ACM GP2PC’05, Cardiff, 213–220
Papadakis H, Trunfio P, Talia D, et al. Design and implementation of a hybrid p2p-based grid resource discovery system. Technical report, CoreGRID Technical Report TR-0105. 2007
Mastroianni C, Talia D, Verta O. A super-peer model for resource discovery services in large-scale grids. Future Generation Computer Systems, 2005, 21(8): 1235–1248
Czajkowski K, Fitzgerald S, Foster I, et al. Grid information services for distributed resource sharing. In: Proceedings of HPDC-10, San Francisco: IEEE Computer Society Press, 2001, 181–194
Globus. The globus aliance: Information services in the globus tookit 3 release. http://www.globus.org/mds.
Iamnitchi A, Foster I. On fully decentralized resource discovery in grid environments. In: Proceedings of 2nd International Workshop on Grid Computing. Berlin: Springer, 2001, 51–62
Karger David R, Lehman E, Leighton F T, et al. Consistent hashing and random trees:distributed caching protocols for relieving hot spots on the world wide web. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing. New York: ACM Press, 1997, 654–663
Basu S, Banerjee S, Sharma P, et al. Nodewiz: Peer-to-peer resource discovery for grids. In: Proceedings of IEEE/ACM GP2PC’05, Cardiff, 213–220
Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithm and Architectures. New York: ACM Press, 2004, 36–43
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, R., Zettsu, K., Kidawara, Y. et al. Decentralized architecture for resource management of group-based distributed systems. Front. Comput. Sci. China 2, 224–233 (2008). https://doi.org/10.1007/s11704-008-0025-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11704-008-0025-8