Trust Based Load Distribution in a Data Grid Environment

The basic idea of a load balancing system is to transfer partial of system workload from busy nodes to some idle nodes. The target resource selection for task migration is a key factor in the load balance strategy. As grid is dynamic in nature, resources may join or leave the grid at any instance of time. It's inefficient to select a target resource that often leaves the grid and hence the tasks may be rescheduled for several times. When the cost of load transmission is not negligible, the overhead of the load balancing strategy will be unacceptable. In that case, the cost of propagating system load will be extremely high. To improve the efficiency of the load balancing process, one can select trustworthy resources from the list of available resources. In this paper we present a load distribution strategy that considers the trustworthiness of the resource as a benchmark for participation in the load balancing process. The simulation results show that the load distribution among the trustworthy resources results better system throughput compared to load distribution to all available resources in the grid.

[1]  Subhash Saini,et al.  Agent-based grid load balancing using performance-driven task scheduling , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[2]  Laxmikant V. Kalé,et al.  A dynamic scheduling strategy for the Chare-Kernel system , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[3]  Francis C. M. Lau,et al.  The Generalized Dimension Exchange Method for Load Balancing in k-ary n Cubes and Variants , 1995, J. Parallel Distributed Comput..

[4]  Francis C. M. Lau,et al.  An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers , 1995, Proceedings of 9th International Parallel Processing Symposium.

[5]  Miron Livny,et al.  Load Balancing in Homogeneous Broadcast Distributed Systems , 1982, SIGMETRICS.

[6]  Junwei Cao,et al.  Self-organizing agents for grid load balancing , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[7]  Laxmikant V. Kalé,et al.  A load balancing strategy for prioritized execution of tasks , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[8]  Richard M. Karp,et al.  Load Balancing in Structured P2P Systems , 2003, IPTPS.

[9]  Shanshan Song,et al.  Trusted Grid Computing with Security Binding and Trust Integration , 2005, Journal of Grid Computing.

[10]  Muthucumaru Maheswaran,et al.  Evolving and managing trust in grid computing systems , 2002, IEEE CCECE2002. Canadian Conference on Electrical and Computer Engineering. Conference Proceedings (Cat. No.02CH37373).

[11]  Laxmikant V. Kalé,et al.  Comparing the Performance of Two Dynamic Load Distribution Methods , 1988, ICPP.

[12]  Zhiyong Xu,et al.  Effective Load Balancing in P2P Systems , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[13]  Jeffrey Considine,et al.  Simple Load Balancing for Distributed Hash Tables , 2003, IPTPS.

[14]  Robert D. van der Mei,et al.  Dynamic load balancing experiments in a grid , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[15]  Princy Johnson,et al.  A Fitted Random Sampling Scheme for Load Distribution in Grid Networks , 2007 .

[16]  Byrav Ramamurthy,et al.  Scalable Web server clustering technologies , 2000, IEEE Netw..

[17]  Haakon Bryhni,et al.  A comparison of load balancing techniques for scalable Web servers , 2000, IEEE Netw..

[18]  Richard M. Karp,et al.  Load balancing in dynamic structured P2P systems , 2004, IEEE INFOCOM 2004.

[19]  Helen D. Karatza.  Job scheduling in heterogeneous distributed systems , 2001, J. Syst. Softw..

[20]  Margo I. Seltzer,et al.  Distributed, secure load balancing with skew, heterogeneity and churn , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[21]  Reinhard Lüling,et al.  Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network , 1995, Proceedings of 9th International Parallel Processing Symposium.

[22]  Richard M. Karp,et al.  A randomized parallel branch-and-bound procedure , 1988, STOC '88.

[23]  Philip S. Yu,et al.  Redirection algorithms for load sharing in distributed Web-server systems , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[24]  Stephen Hailes,et al.  Supporting trust in virtual communities , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[25]  Thomas Kunz,et al.  The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme , 1991, IEEE Trans. Software Eng..

[26]  Yahya Slimani,et al.  Dynamic Load Balancing Strategy for Grid Computing , 2006 .

[27]  Nathan Griffiths,et al.  Experience-Based Trust: Enabling Effective Resource Selection in a Grid Environment , 2005, iTrust.