Skip to main content

A Noble Routing Algorithm for the Internet Computational GRID

  • Conference paper
  • First Online:
  • 315 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2402))

Abstract

Computational Grid has become widespread and lead the way to high-performance computation using widely dispersed resources. The computational GRID architecture is very dynamic by nature with its distributed resources over many organizations, its heterogeneous resources, and pervasive availability with variety of tools. For the best performance of GRID computing, it is inevitable to find computational resources not only based on the computational availability but also based on the communication delay between server and client. In this paper, we suggest a noble routing protocol for the GRID computing based on communication delay. Our approach shows dramatic decrease on the overall computation time.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.J. Cox, M.J. Fairman, G. Xue, J.L. Wason, Keane A.J: The GRID: Computational and data resource sharing in engineering optimisation and design search. Proceedings of Parallel Processing Workshops. (2001) 207–212

    Google Scholar 

  2. D. Bertsekas, R. Gallager: Data Network. Prentice Hall (1992)

    Google Scholar 

  3. L. Kleinrock: Queueing Systems. Vol. 1. J. Wiley & sons. (1975)

    Google Scholar 

  4. M. Streenstrup: Routing in Communication Networks. Prentice Hall (1995)

    Google Scholar 

  5. M.F. Neuts: Matrix-Geometric Solutions in Stochastic Model. MD: Johns Hopkins Univ. Press, (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, Y. (2002). A Noble Routing Algorithm for the Internet Computational GRID. In: Chang, W. (eds) Advanced Internet Services and Applications. AISA 2002. Lecture Notes in Computer Science, vol 2402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45639-2_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45639-2_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43968-4

  • Online ISBN: 978-3-540-45639-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics