Ant colony optimization inspired resource discovery in P2P Grid systems

It is a challenge for the traditional centralized or hierarchical Grid architecture to manage the large-scale and dynamic resources, while providing scalability. The Peer-to-Peer (P2P) model offers a prospect of dynamicity, scalability, and availability of a large pool of resources. By integrating the P2P philosophy and techniques into a Grid architecture, P2P Grid system is emerging as a promising platform for executing large-scale, resource intensive applications. There are two typical resource discovery approaches for a large-scale P2P system. The first one is an unstructured approach which propagates the query messages to all nodes to locate the required resources. The method does not scale well because each individual query generates a large amount of traffic and the network quickly becomes overwhelmed by the messages. The second one is a structured approach which places resources at specified locations to make subsequent queries easier to satisfy. However, the method does not support multi-attribute range queries and may not work well in the network which has an extremely transient population. This paper proposes and designs a large-scale P2P Grid system which employs an Ant Colony Optimization (ACO) algorithm to locate the required resources. The ACO method avoids a large-scale flat flooding and supports multi-attribute range query. Multiple ants can be employed to improve the parallelism of the method. A simulator is developed to evaluate the proposed resource discovery mechanism. Comprehensive simulation results validate the effectiveness of the proposed method compared with the traditional unstructured and structured approaches.

[1]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[2]  Domenico Talia,et al.  A P2P approach for membership management and resource discovery in grids , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[3]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

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

[5]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[6]  Junwei Cao,et al.  Self-organizing agents for grid load balancing , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[7]  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.

[8]  Martin Arlitt,et al.  A workload characterization study of the 1998 World Cup Web site , 2000, IEEE Netw..

[9]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[10]  Yuhui Deng,et al.  Opportunities and challenges of storage grid enabled by grid service , 2007, OPSR.

[11]  Sujata Banerjee,et al.  NodeWiz: peer-to-peer resource discovery for grids , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[12]  Weidong Xiao,et al.  Analysis on greedy-search based service location in P2P service grid , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[13]  Min Cai,et al.  MAAN: A Multi-Attribute Addressable Network for Grid Information Services , 2003, Journal of Grid Computing.

[14]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[15]  Yuhui Deng,et al.  Dynamic and scalable storage management architecture for Grid Oriented Storage devices , 2008, Parallel Comput..

[16]  Domenico Talia,et al.  Toward a Synergy Between P2P and Grids , 2003, IEEE Internet Comput..

[17]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[18]  Ian Foster,et al.  A Peer-to-Peer Approach to Resource Discovery in Grid Environments , 2007 .

[19]  Martin Arlitt,et al.  Workload Characterization of the 1998 World Cup Web Site , 1999 .

[20]  Hein Meling,et al.  Messor: Load-Balancing through a Swarm of Autonomous Agents , 2002, AP2PC.

[21]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[22]  John Levine,et al.  A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments , 2004 .

[23]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

[24]  Artur Andrzejak,et al.  Algorithms for Self-Organization and Adaptive Service Placement in Dynamic Distributed Systems , 2002 .

[25]  Ian Foster,et al.  A peer-to-peer approach to resource location in grid environments , 2002 .

[26]  Scott Shenker,et al.  Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.

[27]  Domenico Talia,et al.  IEEE Internet Computing: Peer To Peer - Toward a Synergy Between P2P and Grids , 2003, IEEE Distributed Syst. Online.

[28]  Yuhui Deng,et al.  A heterogeneous storage grid enabled by grid service , 2007, OPSR.