A Framework for Scalable Autonomous P2P Resource Discovery for the Grid Implementation
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.
[1] I. Foster, C. Kesselman, and S. Tuecke, "The Anatomy of the Grid:
Enabling Scalable Virtual Organizations," International J.
Supercomputer Applications, 15(3), 2001.
[2] I. Foster and A. Iamnitchi, "On death, taxes, and the convergence of
peer-to-peer and grid computing," 2nd International Workshop on Peerto-
Peer Systems (IPTPS'03), Berkeley, CA, 2003.
[3] M. Cai, M. Frank, J. Chen, and P. Szekely, "MAAN: A Mulit-Attribute
Addressable Network for Grid Information Services," Journal of Grid
Computing, 2(1), 2004, pp. 3-14.
[4] I. Stoica, R. Morris, D. R. Karger, M. F. Kaashock, and H.
Balakrishman, "Chord: A scalable peer-to-peer lookup protocol for
internet applications," In Proceedings of the ACM SIGCOMM, pp. 149-
160, San Diego, California, August 2001.
[5] A. R. Bharambe, M. Agrawal, and S. Seshan, "Mercury: supporting
scalable multi-attribute range queries," In Proceedings of the 2004
Conference on Applications, Technologies, Architectures, and Protocols
for Computer Communications (SIGCOMM '04), Portland, Oregon,
USA, 2004.
[6] G. S. Manku, M. Bawa, P. Raghavan, "Symphony: Distributed hashing
in a small world," USENIX Symposium on Internet Technologies and
Systems, 2003.
[7] D. Oppenheimer, J. Albrecht, D. Patterson, and A. Vahdat, "Scalable
wide-area resource discovery," UC Berkeley Technical Report
UCB/CSD-04-1334, July 2004.
[8] S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling churn in a
DHT," Proceedings of the USENIX Annual Technical Conference, June,
2004.
[9] A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object
location and routing for large-scale peer-to-peer systems," IFIP/ACM
International Conference on Distributed Systems Platforms
(Middleware), Heidelberg, Germany, pages 329-350, November, 2001.
[10] S. Basu, S. Banerjee, P. Sharma, and S. Lee, "NodeWiz: peer-to-peer
resource discovery for grids," In Proceedings of the Fifth IEEE
international Symposium on Cluster Computing and the Grid
(CCGrid'05), 2005.
[11] A. S. Cheema, M. Muhammad, and I. Gupta, "Peer-to-peer discovery of
computational resources for Grid applications," Proceedings of the
IEEE/ACM Workshop on Grid Computing (GRID), 2005.
[12] P. Trunfio, D. Talia, H. Papadakis, P. Fragopoulou, M. Mordacchini, M.
Pennanen, K. Popov, V. Vlassov, and S. Haridi, "Peer-to-Peer resource
discovery in Grids: Models and systems," Future Generation Computer
Systems, vol. 23, n. 7, pp. 864-878, Elsevier Science, August 2007.
[13] R. Ranjan, A. Harwood and R. Buyya, "A Study on Peer-to-Peer Based
Discovery of Grid Resource Information," Technical Report, GRIDSTR-
2006-17, P2P Networks Group and Grid Computing and Distributed
Systems Laboratory, The University of Melbourne, Australia, Nov. 10,
2006.
[14] P. Maymounkov and D. Mazieres, "Kademlia: A peerto -peer
information system based on the XOR metric," In Proceedings of
IPTPS02, Cambridge, USA, March 2002.
[15] V. Muthusamy, and H. Jacobsen, "Small scale peer-to-peer
publish/subscribe," The 2nd international workshop on P2P knowledge
management (P2PKM 2005), San Diego, CA, USA, 2005.
[16] A. Mislove and P. Druschel, "Providing administrative control and
autonomy in peer-to-peer overlays," In 3rd International Workshop on
Peer-to-Peer Systems, San Diego, CA, Feb. 2004.
[17] D. Talia and P. Trunfio, "Web Services for Peer-to-Peer Resource
Discovery on the Grid," DELOS Workshop: Digital Library
Architectures, 2004, pp. 73-84.
[18] H. Sagan, "Space-Filling Curves," Springer, 1994.
[19] S. Ramabhadran, S. Ratnasamy, J. M. Hellerstein, and S. Shenker, "Brief
announcement: prefix hash tree," In Proceedings of the Twenty-Third
Annual ACM Symposium on Principles of Distributed Computing
(PODC '04), St. John's, Newfoundland, Canada, 2004.
[20] P. T. Eugster, P. A. Felber, R. Guerraoui, and A. Kermarrec, "The many
faces of publish/subscribe," ACM Comput. Surv. 35, 2 (Jun. 2003), pp.
114-131.
[21] D. Talia, P. Trunfio, and J. Zeng, "Peer-to-Peer Models for Resource
Discovery in Large-scale Grids: A Scalable Architecture," Proceedings
of the 7th International Conference on High Performance Computing in
Computational Sciences (Vecpar 2006), Rio de Janeiro, Brazil, LNCS,
vol. 4395, pp. 66-78, Springer-Verlag, 2007.
[22] A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: An approach to
universal topology generation," In Proceedings of the International
Workshop on Modeling, Analysis and Simulation of Computer and
Telecommunications Systems (MASCOTS'01), Cincinnati, Ohio, August
2001.
[23] B. Huffaker, E. Nemeth, and K. Claffy, "Otter: a general-purpose
network visualization tool," In Proceedings of the 9th Annual
Conference of the Internet Society (INET'99), 1999.
[24] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction
to Algorithms," Second Edition. MIT Press and McGraw-Hill, 2001.
ISBN 0-262-03293-7. Section 24.3: Dijkstra's algorithm, pp.595-601.
[25] CentOS, http://www.centos.org
[26] A. Vahdat, K. Yocum, K. Walsh, P. Mahadevan, D. Kostić, J. Chase,
and D. Becker, "Scalability and accuracy in a large-scale network
emulator," Proceedings of the 5th ACM/USENIX Symposium on
Operating System Design and Implementation (OSDI), Boston, MA,
December 2002.
[27] PlanetLab, http://www.planet-lab.org/
[1] I. Foster, C. Kesselman, and S. Tuecke, "The Anatomy of the Grid:
Enabling Scalable Virtual Organizations," International J.
Supercomputer Applications, 15(3), 2001.
[2] I. Foster and A. Iamnitchi, "On death, taxes, and the convergence of
peer-to-peer and grid computing," 2nd International Workshop on Peerto-
Peer Systems (IPTPS'03), Berkeley, CA, 2003.
[3] M. Cai, M. Frank, J. Chen, and P. Szekely, "MAAN: A Mulit-Attribute
Addressable Network for Grid Information Services," Journal of Grid
Computing, 2(1), 2004, pp. 3-14.
[4] I. Stoica, R. Morris, D. R. Karger, M. F. Kaashock, and H.
Balakrishman, "Chord: A scalable peer-to-peer lookup protocol for
internet applications," In Proceedings of the ACM SIGCOMM, pp. 149-
160, San Diego, California, August 2001.
[5] A. R. Bharambe, M. Agrawal, and S. Seshan, "Mercury: supporting
scalable multi-attribute range queries," In Proceedings of the 2004
Conference on Applications, Technologies, Architectures, and Protocols
for Computer Communications (SIGCOMM '04), Portland, Oregon,
USA, 2004.
[6] G. S. Manku, M. Bawa, P. Raghavan, "Symphony: Distributed hashing
in a small world," USENIX Symposium on Internet Technologies and
Systems, 2003.
[7] D. Oppenheimer, J. Albrecht, D. Patterson, and A. Vahdat, "Scalable
wide-area resource discovery," UC Berkeley Technical Report
UCB/CSD-04-1334, July 2004.
[8] S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling churn in a
DHT," Proceedings of the USENIX Annual Technical Conference, June,
2004.
[9] A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object
location and routing for large-scale peer-to-peer systems," IFIP/ACM
International Conference on Distributed Systems Platforms
(Middleware), Heidelberg, Germany, pages 329-350, November, 2001.
[10] S. Basu, S. Banerjee, P. Sharma, and S. Lee, "NodeWiz: peer-to-peer
resource discovery for grids," In Proceedings of the Fifth IEEE
international Symposium on Cluster Computing and the Grid
(CCGrid'05), 2005.
[11] A. S. Cheema, M. Muhammad, and I. Gupta, "Peer-to-peer discovery of
computational resources for Grid applications," Proceedings of the
IEEE/ACM Workshop on Grid Computing (GRID), 2005.
[12] P. Trunfio, D. Talia, H. Papadakis, P. Fragopoulou, M. Mordacchini, M.
Pennanen, K. Popov, V. Vlassov, and S. Haridi, "Peer-to-Peer resource
discovery in Grids: Models and systems," Future Generation Computer
Systems, vol. 23, n. 7, pp. 864-878, Elsevier Science, August 2007.
[13] R. Ranjan, A. Harwood and R. Buyya, "A Study on Peer-to-Peer Based
Discovery of Grid Resource Information," Technical Report, GRIDSTR-
2006-17, P2P Networks Group and Grid Computing and Distributed
Systems Laboratory, The University of Melbourne, Australia, Nov. 10,
2006.
[14] P. Maymounkov and D. Mazieres, "Kademlia: A peerto -peer
information system based on the XOR metric," In Proceedings of
IPTPS02, Cambridge, USA, March 2002.
[15] V. Muthusamy, and H. Jacobsen, "Small scale peer-to-peer
publish/subscribe," The 2nd international workshop on P2P knowledge
management (P2PKM 2005), San Diego, CA, USA, 2005.
[16] A. Mislove and P. Druschel, "Providing administrative control and
autonomy in peer-to-peer overlays," In 3rd International Workshop on
Peer-to-Peer Systems, San Diego, CA, Feb. 2004.
[17] D. Talia and P. Trunfio, "Web Services for Peer-to-Peer Resource
Discovery on the Grid," DELOS Workshop: Digital Library
Architectures, 2004, pp. 73-84.
[18] H. Sagan, "Space-Filling Curves," Springer, 1994.
[19] S. Ramabhadran, S. Ratnasamy, J. M. Hellerstein, and S. Shenker, "Brief
announcement: prefix hash tree," In Proceedings of the Twenty-Third
Annual ACM Symposium on Principles of Distributed Computing
(PODC '04), St. John's, Newfoundland, Canada, 2004.
[20] P. T. Eugster, P. A. Felber, R. Guerraoui, and A. Kermarrec, "The many
faces of publish/subscribe," ACM Comput. Surv. 35, 2 (Jun. 2003), pp.
114-131.
[21] D. Talia, P. Trunfio, and J. Zeng, "Peer-to-Peer Models for Resource
Discovery in Large-scale Grids: A Scalable Architecture," Proceedings
of the 7th International Conference on High Performance Computing in
Computational Sciences (Vecpar 2006), Rio de Janeiro, Brazil, LNCS,
vol. 4395, pp. 66-78, Springer-Verlag, 2007.
[22] A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: An approach to
universal topology generation," In Proceedings of the International
Workshop on Modeling, Analysis and Simulation of Computer and
Telecommunications Systems (MASCOTS'01), Cincinnati, Ohio, August
2001.
[23] B. Huffaker, E. Nemeth, and K. Claffy, "Otter: a general-purpose
network visualization tool," In Proceedings of the 9th Annual
Conference of the Internet Society (INET'99), 1999.
[24] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction
to Algorithms," Second Edition. MIT Press and McGraw-Hill, 2001.
ISBN 0-262-03293-7. Section 24.3: Dijkstra's algorithm, pp.595-601.
[25] CentOS, http://www.centos.org
[26] A. Vahdat, K. Yocum, K. Walsh, P. Mahadevan, D. Kostić, J. Chase,
and D. Becker, "Scalability and accuracy in a large-scale network
emulator," Proceedings of the 5th ACM/USENIX Symposium on
Operating System Design and Implementation (OSDI), Boston, MA,
December 2002.
[27] PlanetLab, http://www.planet-lab.org/
@article{"International Journal of Information, Control and Computer Sciences:55021", author = "Hesham A. Ali and Mofreh M. Salem and Ahmed A. Hamza", title = "A Framework for Scalable Autonomous P2P Resource Discovery for the Grid Implementation", abstract = "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.
", keywords = "Grid computing, grid information service, P2P, resource discovery.", volume = "1", number = "7", pages = "2014-10", }
