A self-organized grouping (SOG) method for efficient Grid resource discovery

This paper presents a self-organized grouping (SOG) method that achieves efficient Grid resource discovery by forming and maintaining autonomous resource groups. Each group dynamically aggregates a set of resources that are similar to each other in some pre-specified resource characteristic. The SOG method takes advantage of the strengths of both centralized and decentralized approaches that were previously developed for Grid/P2P resource discovery. The design of the SOG method minimizes the overhead incurred in forming and maintaining groups and maximizes resource discovery performance. The way SOG method handles resource discovery queries is metaphorically similar to searching for a word in an English dictionary by identifying its alphabetical groups at the first place. It is shown from a series of computational experiments that SOG method achieves more stable (i.e., independent of the factors such as resource densities, and Grid sizes) and efficient lookup performance than other existing approaches.

[1]  Weidong Xiao,et al.  Decentralized Grid Resource Discovery Based on Resource Information Community , 2004, Journal of Grid Computing.

[2]  Evaggelia Pitoura,et al.  Bloom-based filters for hierarchical data , 2003 .

[3]  Jun Zhang,et al.  Grid Resource Discovery Based on a Routing-Transferring Model , 2002, GRID.

[4]  Rajesh Raman,et al.  Policy driven heterogeneous resource co-allocation with Gangmatching , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[5]  Peter Merz,et al.  Fault-tolerant Resource Discovery in Peer-to-peer Grids , 2007, Journal of Grid Computing.

[6]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[7]  Domenico Talia,et al.  A super-peer model for resource discovery services in large-scale Grids , 2005, Future Gener. Comput. Syst..

[8]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[9]  Shay Kutten,et al.  Asynchronous resource discovery in peer-to-peer networks , 2007, Comput. Networks.

[10]  Artur Andrzejak,et al.  Scalable, efficient range queries for grid information services , 2002, Proceedings. Second International Conference on Peer-to-Peer Computing,.

[11]  Serge Fdida,et al.  Twins: A Dual Addressing Space Representation for Self-Organizing Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[12]  Iosif Legrand,et al.  MonALISA : A Distributed Monitoring Service Architecture , 2003, ArXiv.

[13]  Steven Tuecke,et al.  The Physiology of the Grid An Open Grid Services Architecture for Distributed Systems Integration , 2002 .

[14]  Amin Vahdat,et al.  Design and implementation tradeoffs for wide-area resource discovery , 2005, HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005..

[15]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[16]  Timothy L. Harris,et al.  XenoSearch: distributed resource discovery in the XenoServer open platform , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[17]  J. Frankel,et al.  The gnutella protocol specification v0.4 document revision 1.2 , 2000 .

[18]  Christos Faloutsos,et al.  Analysis of the Clustering Properties of the Hilbert Space-Filling Curve , 2001, IEEE Trans. Knowl. Data Eng..

[19]  Manish Parashar,et al.  Flexible information discovery in decentralized distributed systems , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[20]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[21]  Ian Foster,et al.  On Fully Decentralized Resource Discovery in Grid Environments , 2001, GRID.

[22]  ParasharManish,et al.  Enabling Flexible Queries with Guarantees in P2P Systems , 2004 .

[23]  Ian T. Foster,et al.  Grid Services for Distributed System Integration , 2002, Computer.

[24]  Guohua Jin,et al.  SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion , 2005, TOMS.

[25]  Eddy Caron,et al.  Enhancing Computational Grids with Peer-to-Peer Technology for Large Scale Service Discovery , 2007, Journal of Grid Computing.

[26]  Ian T. Foster,et al.  On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing , 2003, IPTPS.

[27]  Anne-Marie Kermarrec,et al.  Probabilistic Reliable Dissemination in Large-Scale Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[28]  Mor Harchol-Balter,et al.  Resource discovery in distributed networks , 1999, PODC '99.

[29]  Ian T. Foster,et al.  Grid information services for distributed resource sharing , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[30]  Manish Parashar,et al.  Enabling flexible queries with guarantees in P2P systems , 2004, IEEE Internet Computing.

[31]  Arthur R. Butz,et al.  Alternative Algorithm for Hilbert's Space-Filling Curve , 1971, IEEE Transactions on Computers.

[32]  Shaowen Wang,et al.  A Multi-agent System Architecture for End-User Level Grid Monitoring Using Geographic Information Systems (MAGGIS): Architecture and Implementation , 2003, GCC.

[33]  Danny Dolev,et al.  Asynchronous resource discovery , 2003, PODC '03.

[34]  Ian T. Foster,et al.  A peer-to-peer approach to resource location in grid environments , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[35]  Desh Ranjan,et al.  Space-Filling Curves and Their Use in the Design of Geometric Data Structures , 1997, Theor. Comput. Sci..

[36]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM '04.

[37]  Amin Vahdat,et al.  Design and implementation tradeoffs for wide-area resource discovery , 2005, HPDC.

[38]  Anne-Marie Kermarrec,et al.  SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication , 2001, Networked Group Communication.

[39]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.