A Noble Routing Algorithm for the Internet Computational GRID

Authors:
Youngyong Kim
Affiliations:
-
Venue:
AISA '02 Proceedings of the First International Workshop on Advanced Internet Services and Applications
Year:
2002

Citing 4
Cited 0

Data networks

Data networks
Routing in communications networks

Routing in communications networks
The GRID: Computational and Data Resource Sharing in Engineering Optimisation and Design Search

ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Quantified Score

Hi-index	0.00

Visualization

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.