Skip to main content
SpringerLink
Log in

A group-based architecture for grids

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

A group-based network architecture provides many benefits for the whole network increasing the content availability, providing fault tolerance and giving more scalability. Many grid architectures have been developed since the first proto-grid systems in the early 70’s, but no one of them is based on groups. This paper proposes a group-based grid architecture using an efficient neighbor node selection. The architecture organizes logical connections between nodes from different groups of nodes allowing sharing resources, data or computing time between groups. Connections are used to find and share available resources from other groups and they are established based on node’s available capacity. Suitable nodes have higher roles in the architecture and their function is to organize connections based on a node selection process. Nodes’ logical connections topology changes depending on some dynamic parameters. The architecture is scalable and fault-tolerant. The designed protocol, its management and real measurements are shown. It could be used as an intergrid protocol.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Foster, I., & Kesselman, C. (1998). The grid: Blueprint for a future computing infrastructure, Chap. 2. San Mateo: Morgan Kaufmann.

    Google Scholar 

  2. Foster, I., Kesselman, C., & Tuecke, S. (2001). The anatomy of the grid: Enabling scalable virtual organizations. International Journal of High Performance Computing Applications, 15(3), 200–222.

    Article  Google Scholar 

  3. The Globus project. http://www.globus.org/.

  4. Gridware, Sun. http://www.sun.com/software/gridware/.

  5. NASA Information Power Grid. http://www.nas.nasa.gov/.

  6. Eurogrid. http://www.eurogrid.org/.

  7. Grid Physics Network. http://www.griphyn.org/.

  8. Arenas, M. G. et al. (2002). A framework for distributed evolutionary algorithms. In Lecture notes in computer science : Vol. 2439. Parallel problem solving from nature (pp. 665–675). Berlin: Springer.

    Google Scholar 

  9. Global Grid Forum. http://www.gridforum.org/info/Initiatives.html.

  10. Grid Computing Info Centre. http://www.gridcomputing.com/.

  11. Hey, T., & Trefethen, A. (2002). The UK e-science core programme and the grid. Future Generation Computer Systems, 18, 1017–1031.

    Article  Google Scholar 

  12. García-Carballeira, F., Carretero, J., Calderón, A., García, J. D., & Sanchez, L. (2007). A global and parallel file system for grids. Future Generation Computer Systems, 23, 116–122.

    Article  Google Scholar 

  13. Jensen, J. G., Shah, T., Synge, O., Gordon, J., Johnson, G., & Tam, R. (2005). Enabling grid access to mass storage: architecture and design of the EDG storage element. Journal of Grid Computing, 3(1–2), 101–112.

    Article  Google Scholar 

  14. Chang, R.-S., & Chen, P.-H. (2007). Complete and fragmented replica selection and retrieval in Data Grids. Future Generation Computer Systems, 23(4), 536–546.

    Article  Google Scholar 

  15. Ping, L., Kevin, L., Zhongzhi, S., & Qing, H. (2007). Distributed data mining in grid computing environments. Future Generation Computer Systems, 23(1), 84–91.

    Article  Google Scholar 

  16. Litzkow, M., Livny, M., & Mutka, M. (1988). Condor—a hunter of idle workstations. In Proc. of the 8th international conference of distributed computing systems (pp. 104–111). San Jose, 1988.

  17. Tannenbaum, T., Wright, D., Miller, K., & Livny, M. (2001). Condor—A distributed job scheduler. Beowulf cluster computing with Linux. Cambridge: MIT Press.

    Google Scholar 

  18. The NorduGrid Projejct. http://www.nordugrid.org.

  19. The Globus Toolkit. http://www.globus.org/toolkit/.

  20. Eerola, P. et al. (2003). The NorduGrid architecture and tools. In Computing in high energy and nuclear physics, 24–28 March 2003, La Jolla, CA.

  21. Chunxi, C., & Schmidt, B. (2006). Constructing large suffix trees on a computational grid. Journal of Parallel Distribed Computing, 66, 1512–1523.

    Article  Google Scholar 

  22. Avellino, G. et al. (2003). The EU DataGrid workload management system: towards the second major release. In Computing in high energy and nuclear physics, 24–28 March 2003, La Jolla, CA.

  23. Casanova, H., & Dongarra, J. (1997). NetSolve: a network server for solving computational science problems. The International Journal of Supercomputer Applications and High Performance Computing, 11, 212–223.

    Article  Google Scholar 

  24. Abramson, D., Sosic, R., Giddy, J., & Hall, B. (1995). Nimrod: a tool for performing parametrised simulations using distributed workstations. In Proceedings of the 4th IEEE symposium on high performance distributed computing (pp. 112–121). Virginia, August 1995.

  25. Buncic, P., Peters, A. J., & Saiz, P. (2003). The AliEn system, status and perspectives. In Computing in high energy and nuclear physics, 24–28 March 2003, La Jolla, CA.

  26. Koo, S. G. M., Kannan, K., & Lee, C. S. G. (2004). A genetic-algorithm-based neighbor-selection strategy for hybrid peer-to-peer networks. In Proc. of the 13th IEEE international conference on computer communications and networks (pp. 469–474). Chicago, IL, October 2004.

  27. Koo, S. G. M., Kannan, K., & Lee, C. S. G. (2006). On neighbor-selection strategy in hybrid peer-to-peer networks. Future Generation Computer Systems, 22(7), 732–741.

    Article  Google Scholar 

  28. Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001). A scalable content-addressable network. In ACM Sigcomm 2001.

  29. Stoica, I., Morris, R., Karger, D., Kaashoek, F., & Balakrishnan, H. (2001). Chord: a scalable peer-to-peer lookup service for Internet applications. In ACM Sigcomm 2001.

  30. Rowstron, A., & Druschel, P. Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In IFIP/ACM international conference on distributed systems platforms (middleware) (pp. 329–350), Heidelberg, Germany, November, 2001.

  31. Zhou, B., Joseph, D. A., & Kubiatowicz, J. Tapestry: A fault tolerant wide area network infrastructure (UC Berkeley technical report UCB/CSD-01-1141).

  32. Ferreira, R. A., Jagannathan, S., & Grama, A. (2006). Locality in structured peer-to-peer networks. Journal of Parallel and Distributed Computing, 66(2), 257–273.

    Article  Google Scholar 

  33. Bose, P., Morin, P., Stojmenovic, I., & Urrutia, J. (2001). Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networking, 7(6), 609–616.

    Article  Google Scholar 

  34. Xu, Z., Tang, C., & Zhang, Z. (2003). Building topology-aware overlays using global soft-state. In Proc. of the 23rd international conference on distributed computing systems, May 2003.

  35. Castro, M., Druschel, P., Hu, Y. C., & Rowstron, A. (2003). Proximity neighbor selection in tree-based structured peer-to-peer overlays (Technical Report MSR-TR-2003-52). Microsoft Corporation.

  36. Karp, B., & Kung, H. T. (2000). GPSR: greedy perimeter stateless routing for wireless networks. In Proceedings of the sixth annual international conference on mobile computing and networking (MobiCom’00) (pp. 243–254). New York: ACM Press.

    Chapter  Google Scholar 

  37. Kim, Y. J., Govindan, R., & Karp, B. (2005). Shenker, S. Geographic routing made practical. In Proceedings of the second USENIX/ACM symposium on networked system design and implementation (NSDI’05) (pp. 217–230), May 2005.

  38. Wierzbicki, A., Strzelecki, R., Swierczewski, D., & Znojek, M. (2002). Rhubarb: a tool for developing scalable and secure peer-to-peer applications. In Second IEEE international conference on peer-to-peer computing (P2P2002), Linöping, Sweden, 2002.

  39. Xiang, Z., Zhang, Q., Zhu, W., Zhang, Z., & Zhang, Y. (2004). Peer-to-peer based multimedia distribution service. IEEE Transactions on Multimedia 6(2).

  40. Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., & Shenker, S. (2003). Making gnutella-like networks scalable. In ACM SIGCOMM (pp. 407–418).

  41. Liang, J., Kumar, R., & Ross, K. W. (2006). The FastTrack overlay: A measurement study. Computer Networks, 50(6), 842–858.

    Article  Google Scholar 

  42. Hongjun, L., Luo, L. P., & Zhifeng, Z. (2007). A structured hierarchical P2P model based on a rigorous binary tree code algorithm. Future Generation Computer Systems, 23(2), 201–208.

    Article  Google Scholar 

  43. Thallner, B., & Moser, H. (2005). Topology control for fault-tolerant communication in highly dynamic wireless networks. In Proceedings of the third international workshop on intelligent solutions in embedded systems, May 2005.

  44. Kwang-Hoon, K. (2007). A layered workflow knowledge Grid/P2P architecture and its models for future generation workflow systems. Future Generation Computer Systems, 23, 304–316.

    Article  Google Scholar 

  45. Opnet University Program Website. Available at http://www.opnet.com/university_program/index.html.

  46. Ahuja, R. K., Mehlhorn, K., Orlin, J., & Tarjan, R. E. (1990). Faster algorithms for the shortest path problem. Journal of the ACM (JACM), 37(2), 213–223.

    Article  Google Scholar 

  47. Lloret, J., Boronat, F., Palau, C., & Esteve, M. (2005). Two levels SPF-based system to interconnect partially decentralized P2P file sharing networks. In International conference on autonomic and autonomous systems, international conference on networking and services joint ICAS’05 and ICNS’05.

  48. Moy, J. (1991). RFC 1245—OSPF protocol analysis. Available at http://www.faqs.org/rfcs/rfc1245.html.

  49. Lloret, J., Diaz, J. R., Jimenez, J. M., & Boronat, F. (2006). An architecture to connect disjoint multimedia networks based on node’s capacity. In Lecture notes in computer science (Vol. 4261, pp. 890–899). Berlin: Springer.

    Google Scholar 

  50. Cramer, C., Kutzner, K., & Fuhrmann, T. (2004). Bootstrapping locality-aware P2P networks. In The IEEE international conference on networks (Vol. 1, pp. 357–361).

  51. Lloret, J., Diaz, J. R., Boronat, F., & Jimenez, J. M. (2006). A fault-tolerant P2P-based protocol for logical networks interconnection. In Int’l conf. on autonomic and autonomous systems and int’l conf. on networking and services, Silicon Valley, CA, USA, July 2006.

Download references

Author information

Authors and Affiliations

  1. Departamento de Comunicaciones, Universidad Politécnica de Valencia, Camino Vera s/n, 46022, Valencia, Spain

    Jaime Lloret & Jesus Tomas

  2. Instituto de Investigación para la Gestión Integrada de Zonas Costeras, Universidad Politécnica de Valencia, Camino Vera s/n, 46022, Valencia, Spain

    Miguel Garcia & Sandra Sendra

Authors
  1. Jaime Lloret
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miguel Garcia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jesus Tomas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sandra Sendra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jaime Lloret.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lloret, J., Garcia, M., Tomas, J. et al. A group-based architecture for grids. Telecommun Syst 46, 117–133 (2011). https://doi.org/10.1007/s11235-010-9279-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-010-9279-1

Keywords

Search

Navigation