Anetwork of computers consists a set of interconnected computers using an appropriate technique. In distributed systems every client and server is unique and has different processing capability. Each server is independent where resource allocation is an important feature for the system to appear as single network. So the performance of system depends on allocation of work among the servers effectively. It is the combination of variousfactors likelatency, throughput, consistency, reliability and performance. The concept of dynamic load balancing can be introduced to efficiently manage the factors to be fulfilled in a distributed network. Every clients in the network benefit from dynamic load balancing. In turn all tasks benefit from load balancing. The load balancing comprises of both physical and logical features. The time, cost, performance must be optimized through load balancing. The paper describes a model for load balancing in the system to manage the performance through internetindistributedsystems.Thisproposedalgorithmcanbe applied to n-processor dynamic systems. This will prove effective to reduce the serverload.
distributed systems, dynamic load balancing, client-server assignment, networking, network traffic, server load, genetic algorithm
Bui T. N., Moon B. R. (1996). Geneticalgorithmandgraph partitioning. IEEE Trans. Comput, Vol. 45, No. 7, pp. 841-855. https://doi.org/10.1109/12.508322
Deriche M., Huang M. K., Tsai Q. T. (1990). Dynamic load-balancing in distributed heterogeneous systems under stationary and bursty traffics. Proc. 32ndMidwestSymp. Circuits and Systems, Vol. 1, pp. 669-672. https://doi.org/10.1109/MWSCAS.1989.101943
Garey M. R., Johnson D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco, CA, USA: Freeman, Vol. 23.
Goldberg D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading, Mass: Addison-Wesley. https://doi.org/10.1111/j.1365-2486.2009.02080.x
Jiang Y., Huang Z. (2012). Therich get richer: Preferential attachment in the task allocation of cooperative networked multiagentsystems with resource caching. IEEE Trans. Syst, Man, Cybern. A, Syst, Humans, Vol. 42, No. 5, pp. 1040-1052. http://doi.org/10.1109/TSMCA.2012.2186439
Jiang Y., Jiang J. (2009). Conte xtualresource negotiation- based task allocation and load balancing in complex software systems. IEEE Trans. Parallel Distrib, Vol. 20, No. 5, pp. 641-653. http://dx.doi.org/10.1109/TPDS.2008.133
Jiang Y., Zhou Y., Wang W. (2013). Task allocation for undependable multiagent systems in social networks. IEEE Trans. Parallel Distrib. Syst, Vol. 24, No. 8, pp. 1671-1681, http://doi.org/10.1109/TPDS.2012.249.
Johnson D. S., Aragon C. R., Geoch L. A. M, Schevon C. (1989). Optimization bysimulated annealing: An experimentalevaluation, Part I, graphpartitioning. Oper. Res, Vol. 37, No. 6, pp. 865-892. http://dx.doi.org/10.1287/opre.37.6.865
Johnson D. S., Aragon C. R., Geoch L. A. M., Schevon C. (1989). Optimization bysimulated annealing: An experimentalevaluation. PartI, graphpartitioning. Oper. Res, Vol. 37, No. 6, pp. 865-892. https://doi.org/10.1287/opre.37.6.865
Kernighan B. W., Lin S. (1970). Anef_cient heuristic procedure for partitioning graphs. Bell Syst. Tech. Vol. 49, No. 2, pp. 291-307. http://dx.doi.org/10.1002/j.1538-7305.1970.tb01770.x
Kirkpatrick S., Vecchi M. P. (1983). Optimization by simmulated annealing. Science, Vol. 220, No. 4598, pp. 671-680. http://dx.doi.org/10.1126/science.220.4598.671
Lu C., Lau S. M. (1994). A performance study on load balancing algorithms with process migration. In Proceedings, IEEE TENCON 1994, pp. 357-364.
Magrini A., Lazzari S., Marenco L., Guazzi G. (2018). Cost optimal analysis of energy refurbishment actions depending on the local climate and its variations. Mathematical Modelling of Engineering Problems, Vol. 5, No. 3, pp. 268-274. https://doi.org/10.18280/mmep.050321
Martin O., Otto S. W., Felten E. W. (1991). Large-step Markov chains for the traveling sales man problem. Complex Syst, Vol. 5, No. 3, pp. 299-326. https://digitalcommons.ohsu.edu/cgi/viewcontent.cgi?referer=https://scholar.google.com.hk/&httpsredir=1&article=1015&context=csetech
Mitchell M. (2004). An introduction to genetic algorithms: Easterm Economy. Edition.
Newman M. E. J. (2006). Modularity and community structure in networks. Proc. Nat. Acad. Sci. USA, Vol. 103, No. 23, pp. 8577-8582. https://doi.org/10.1073/pnas.0601602103
Nishida H., Nguyen T. (2011). Optimal client-server assignment for internet distributed systems. in Proc. 20th ICCCN, Vol. 24, No. 3. pp. 1-6. http://dx.doi.org/10.1109/ICCCN.2011.6006007
Saab Y. (2000). A new effective and ef_cient multi-level partitioning algorithm. in Proc. Conf. Design, Autom. Test Eur, pp. 112-116. https://doi.org/10.1145/343647.343715
Sabin G., Sahasrabudhe V., Sadayappan P. (2004). On fairness in distributed job scheduling across multiple sites. in Proc. IEEEInt. Conf. Cluster Comput, Sep, pp. 35-44. http://dx.doi.org/10.1109/CLUSTR.2004.1392599
Sharma S., Singh S., Sharma M. (2008). Performance analysis of load balancing algorithms. world academy of science. Engineering and Technology, Vol. 2, No. 2. pp. 367-370. http://waset.org/publications/5537
Syswerda G., Palmucci J. (1991). The application of genetic algorithms to resource scheduling. Proc. Fourth International Conference on Genetic Algorithms, pp. 502-508.
Wang Y. T., Morris R. J. T. (1985). Load sharing in distributed systems. IEEE Trans. Comput, Vol. 34, No. 3, pp. 204-217. https://doi.org/10.1109/TC.1985.1676564
Yorozu T., Hirano M., Oka K., Tagawa Y. (1987). Electron spectroscopy studies on magneto-optical media and plastic substrate interface. IEEE Transl. J. Magn. Japan, Vol. 2, No. 8, pp. 740-741. http://doi.org/10.1109/TJMJ.1987.4549593