Abstract
Grid computing is an innovative approach which can optimize compute resources and manage data and computing workloads. In this paper, we propose a hierarchical routing model by using mobile agents to collect and update the dynamic changes of routing information in grid systems, which has been proved to be the only optimal solution that makes inference on the known traffic information and approximates to a unbiased distribution. Our method is fault tolerant, scalable, and relies completely on local information. Extensive simulations show the priority of our algorithm to state-of-art algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balakrishnan H, Kaashoek MF, Karger D, Morris R, Stoica I (2003) Looking up data in P2P systems. Commun ACM 46:43–48
Caro G, Dorigo M (1998) AntNet: distributed stigmergetic control for communications networks. J Artif Intell Res 9:317–365
Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S (2003) Making Gnutella-like P2P systems scalable. In: Proceeding of ACM SIGCOMM conference, pp 407–418
Cohen E, Shenker S (2002) Replication strategies in unstructured peer-to-peer networks. ACM SIGCOMM Comput Commun Rev 32:177–190
Crespo A, Molina HG (2002) Routing indices for peer-to-peer systems. In: Proceeding of international conference on distributed computing systems, pp 23–32
Dasgupta P (2004) Intelligent agent enabled genetic ant algorithm for P2P resource discovery. In: Proceeding of agents and peer to peer computing conference, pp 213–220
Dijkstra E (1959) A note on two problems in connection with graphs. Numer Math 269–271
Dunne C (2001) TUsing mobile agents for network resource discovery in peer-to-peer networks. SIGecom exchanges. Newsl ACM Spec Interest Group E-Commer 2:1–9
Ferreira R, Ramanathan M, Awan A, Grama A, Jagannathan S (2005) Search with probabilistic guarantees in unstructured peer-to-peer networks. In: Proceeding of P2P conference, pp 165–172
Foster I, Kesselman C (1999) Computational grids. The grid: blueprint for a new computing infrastructure. Morgan-Kaufman, San Mateo, Chap 2
Gil B, Deelman W, Blythe J, Kesselman C, Tangmunarunkit H (2004) Artificial intelligence and grids: workflow planning and beyond. IEEE Intell Syst 19:26–33
Gkantsidis C, Mihail M, Saberi A (2004) Random walks in peer-to-peer networks. In: Proceeding of IEEE INFOCOM conference
Iamnitchi A, Ripeanu M, Foster I (2004) Small-world file-sharing communities. In: Proceeding of IEEE international conference on computer communications (INFOCOM)
Jagadish H, Ooi B, Vu Q, Zhang R, Zhou A (2006) Vbi-Tree a peer-to-peer framework for supporting multi-dimensional indexing schemes. In: Proceeding of international conference on data engineering, vol 34
Koloniari G, Pitoura E (2005) Peer-to-peer management of XML data: issues and research challenges. ACM SIGMOD Rec 34:6–17
Lange D, Oshima M (1999) Seven good reason for mobile agents. Commun ACM 42:88–89
Leontiadis E, Dimakopoulos V, Pitoura E (2004) Cache updates in a peer-to-peer network of mobile agents. In: Proceeding of P2P conference, pp 10–17
Li K, Nanya T, Shen H, Chin FYL, Zhang W (2007) An efficient cache replacement algorithm for multimedia object caching. Int J Comput Syst Sci Eng 22(1–2):47–55
Li K, Shen H (2004) Proxy placement problem for coordinated en-route transcoding proxy caching. Int J Comput Syst Sci Eng 19(6):327–335
Lv Q, Cao P, Cohen E, Li KQ, Shenker S (2002) Search and replication in unstructured peer-to-peer networks. In: Proceeding of ICS conference, pp 84–95
Qu WY, Shen H, Jin Y (2005) Theoretical analysis on a traffic-based routing algorithm of mobile agents. In: Proceeding of international conference on intelligent agent technology, pp 520–526
Qu WY, Li KQ, Kitsuregawa M, Xue W (2008) Statistical behaviors of mobile agents in network routing. J Supercomput. doi:10.1007/s11227-008-0220-2
Qu WY, Shen H (2006) The probability of success of mobile agents when routing in faulty networks. In: Lecture notes in computer science, vol 3814. Springer, Berlin, pp 76–84
Qu WY, Li KQ, Zhang Y (2008) A mobile agent-based statistic execution model for grid computing. In: Proceeding of international conference on advances in grid and pervasive computing, pp 71–82
Sahin O, Gupta A, Agrawal D, Abbadi AE (2004) A peer-to-peer framework for caching range queries. In: Proceeding of international conference on data engineering, pp 165–176
Srivatsa M, Gedik B, Liu L (2006) Large scaling unstructured peer-to-peer networks with heterogeneity-aware topology and routing. IEEE Trans Parallel Distrib Syst 17:1277–1293
Shen Y, Li K (2009) On the design of P2P video streaming with layered coding. Int J Comp Syst Sci Eng 24(3):209–215
Tewari S, Kleinrock L (2005) Analysis of search and replication in unstructured peer-to-peer networks. In: Proceeding of SIGMETRICS conference, pp 404–405
Yang K, Wu C, Ho J (2006) AntSearch: an ant search algorithm in unstructured peer-to-peer networks. IEICE Trans Commun E89-B:2300–2308
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jin, Y., Qu, W., Zhang, Y. et al. A mobile agent-based routing model for grid computing. J Supercomput 63, 431–442 (2013). https://doi.org/10.1007/s11227-011-0616-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-011-0616-2