A Framework For Scalable Autonomous P2P Resource Discovery For The Grid Implementation

• Main Authors: Ali, Hesham A., Mofreh M. Salem, Hamza, Ahmed A.
• Format: Text
• Language: English
• Published: Zenodo 2007
• Subjects: Grid computing; grid information service; P2P; resource discovery.; Byers; Canada; Harwood; Medina; Sagan; Talia; Newfoundland
• Online Access: https://dx.doi.org/10.5281/zenodo.1061953; https://zenodo.org/record/1061953

Recently, there have been considerable efforts towards the convergence between P2P and Grid computing in order to reach a solution that takes the best of both worlds by exploiting the advantages that each offers. Augmenting the peer-to-peer model to the services of the Grid promises to eliminate bottlenecks and ensure greater scalability, availability, and fault-tolerance. The Grid Information Service (GIS) directly influences quality of service for grid platforms. Most of the proposed solutions for decentralizing the GIS are based on completely flat overlays. The main contributions for this paper are: the investigation of a novel resource discovery framework for Grid implementations based on a hierarchy of structured peer-to-peer overlay networks, and introducing a discovery algorithm utilizing the proposed framework. Validation of the framework-s performance is done via simulation. Experimental results show that the proposed organization has the advantage of being scalable while providing fault-isolation, effective bandwidth utilization, and hierarchical access control. In addition, it will lead to a reliable, guaranteed sub-linear search which returns results within a bounded interval of time and with a smaller amount of generated traffic within each domain. : {"references": ["I. Foster, C. Kesselman, and S. Tuecke, \"The Anatomy of the Grid:\nEnabling Scalable Virtual Organizations,\" International J.\nSupercomputer Applications, 15(3), 2001.", "I. Foster and A. Iamnitchi, \"On death, taxes, and the convergence of\npeer-to-peer and grid computing,\" 2nd International Workshop on Peerto-\nPeer Systems (IPTPS'03), Berkeley, CA, 2003.", "M. Cai, M. Frank, J. Chen, and P. Szekely, \"MAAN: A Mulit-Attribute\nAddressable Network for Grid Information Services,\" Journal of Grid\nComputing, 2(1), 2004, pp. 3-14.", "I. Stoica, R. Morris, D. R. Karger, M. F. Kaashock, and H.\nBalakrishman, \"Chord: A scalable peer-to-peer lookup protocol for\ninternet applications,\" In Proceedings of the ACM SIGCOMM, pp. 149-\n160, San Diego, California, August 2001.", "A. R. Bharambe, M. Agrawal, and S. Seshan, \"Mercury: supporting\nscalable multi-attribute range queries,\" In Proceedings of the 2004\nConference on Applications, Technologies, Architectures, and Protocols\nfor Computer Communications (SIGCOMM '04), Portland, Oregon,\nUSA, 2004.", "G. S. Manku, M. Bawa, P. Raghavan, \"Symphony: Distributed hashing\nin a small world,\" USENIX Symposium on Internet Technologies and\nSystems, 2003.", "D. Oppenheimer, J. Albrecht, D. Patterson, and A. Vahdat, \"Scalable\nwide-area resource discovery,\" UC Berkeley Technical Report\nUCB/CSD-04-1334, July 2004.", "S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, \"Handling churn in a\nDHT,\" Proceedings of the USENIX Annual Technical Conference, June,\n2004.", "A. Rowstron and P. Druschel, \"Pastry: Scalable, decentralized object\nlocation and routing for large-scale peer-to-peer systems,\" IFIP/ACM\nInternational Conference on Distributed Systems Platforms\n(Middleware), Heidelberg, Germany, pages 329-350, November, 2001.\n[10] S. Basu, S. Banerjee, P. Sharma, and S. Lee, \"NodeWiz: peer-to-peer\nresource discovery for grids,\" In Proceedings of the Fifth IEEE\ninternational Symposium on Cluster Computing and the Grid\n(CCGrid'05), 2005.\n[11] A. S. Cheema, M. Muhammad, and I. Gupta, \"Peer-to-peer discovery of\ncomputational resources for Grid applications,\" Proceedings of the\nIEEE/ACM Workshop on Grid Computing (GRID), 2005.\n[12] P. Trunfio, D. Talia, H. Papadakis, P. Fragopoulou, M. Mordacchini, M.\nPennanen, K. Popov, V. Vlassov, and S. Haridi, \"Peer-to-Peer resource\ndiscovery in Grids: Models and systems,\" Future Generation Computer\nSystems, vol. 23, n. 7, pp. 864-878, Elsevier Science, August 2007.\n[13] R. Ranjan, A. Harwood and R. Buyya, \"A Study on Peer-to-Peer Based\nDiscovery of Grid Resource Information,\" Technical Report, GRIDSTR-\n2006-17, P2P Networks Group and Grid Computing and Distributed\nSystems Laboratory, The University of Melbourne, Australia, Nov. 10,\n2006.\n[14] P. Maymounkov and D. Mazieres, \"Kademlia: A peerto -peer\ninformation system based on the XOR metric,\" In Proceedings of\nIPTPS02, Cambridge, USA, March 2002.\n[15] V. Muthusamy, and H. Jacobsen, \"Small scale peer-to-peer\npublish/subscribe,\" The 2nd international workshop on P2P knowledge\nmanagement (P2PKM 2005), San Diego, CA, USA, 2005.\n[16] A. Mislove and P. Druschel, \"Providing administrative control and\nautonomy in peer-to-peer overlays,\" In 3rd International Workshop on\nPeer-to-Peer Systems, San Diego, CA, Feb. 2004.\n[17] D. Talia and P. Trunfio, \"Web Services for Peer-to-Peer Resource\nDiscovery on the Grid,\" DELOS Workshop: Digital Library\nArchitectures, 2004, pp. 73-84.\n[18] H. Sagan, \"Space-Filling Curves,\" Springer, 1994.\n[19] S. Ramabhadran, S. Ratnasamy, J. M. Hellerstein, and S. Shenker, \"Brief\nannouncement: prefix hash tree,\" In Proceedings of the Twenty-Third\nAnnual ACM Symposium on Principles of Distributed Computing\n(PODC '04), St. John's, Newfoundland, Canada, 2004.\n[20] P. T. Eugster, P. A. Felber, R. Guerraoui, and A. Kermarrec, \"The many\nfaces of publish/subscribe,\" ACM Comput. Surv. 35, 2 (Jun. 2003), pp.\n114-131.\n[21] D. Talia, P. Trunfio, and J. Zeng, \"Peer-to-Peer Models for Resource\nDiscovery in Large-scale Grids: A Scalable Architecture,\" Proceedings\nof the 7th International Conference on High Performance Computing in\nComputational Sciences (Vecpar 2006), Rio de Janeiro, Brazil, LNCS,\nvol. 4395, pp. 66-78, Springer-Verlag, 2007.\n[22] A. Medina, A. Lakhina, I. Matta, and J. Byers, \"BRITE: An approach to\nuniversal topology generation,\" In Proceedings of the International\nWorkshop on Modeling, Analysis and Simulation of Computer and\nTelecommunications Systems (MASCOTS'01), Cincinnati, Ohio, August\n2001.\n[23] B. Huffaker, E. Nemeth, and K. Claffy, \"Otter: a general-purpose\nnetwork visualization tool,\" In Proceedings of the 9th Annual\nConference of the Internet Society (INET'99), 1999.\n[24] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, \"Introduction\nto Algorithms,\" Second Edition. MIT Press and McGraw-Hill, 2001.\nISBN 0-262-03293-7. Section 24.3: Dijkstra's algorithm, pp.595-601.\n[25] CentOS, http://www.centos.org\n[26] A. Vahdat, K. Yocum, K. Walsh, P. Mahadevan, D. Kosti\u0107, J. Chase,\nand D. Becker, \"Scalability and accuracy in a large-scale network\nemulator,\" Proceedings of the 5th ACM/USENIX Symposium on\nOperating System Design and Implementation (OSDI), Boston, MA,\nDecember 2002.\n[27] PlanetLab, http://www.planet-lab.org/"]}