The Markov Model Based Algorithm to Predict Networking Load on the Computational Grid

The computational Grid is currently gaining in popularity, and it enables computers scattered all over the world to be connected by the Internet as if they are part of a large computational infrastructure. While the computational Grid gathers more and more computational resources and the number of the applications for the computational Grid is increasing, load balancing for the computational Grid is still not effective enough. Because the computers are connected by a wide area network on the computational Grid, the significant communication latency and the frequency of large wave throughputs make it difficult to achieve effective load balancing. Thus, in this paper, we propose an algorithm to predict networking loads on the computational Grid to make the use of computational resources more efficient. The proposed algorithm based on the Markov model is evaluated using an actual networking load. As a result, the Markov model based algorithm offers the most accurate predictions compared with the related work.

[1]  Andrew S. Grimshaw,et al.  The core Legion object model , 1996, Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing.

[2]  Jack Dongarra,et al.  Users' Guide to NetSolve v1.4.1 , 2002 .

[3]  Mitsuhisa Sato,et al.  Design and implementations of Ninf: towards a global computing infrastructure , 1999, Future Gener. Comput. Syst..

[4]  Richard Wolski,et al.  The network weather service: a distributed resource performance forecasting service for metacomputing , 1999, Future Gener. Comput. Syst..