Load Balancing, Optimal Routing and Scheduling in Hyper-Local

Karan Panjwani; Sahil Pathan; Nitin Yadav; Shreyas Lokhande; Bhushan Thakare

Research Article

Load Balancing, Optimal Routing and Scheduling in Hyper-Local

by Karan Panjwani, Sahil Pathan, Nitin Yadav, Shreyas Lokhande, Bhushan Thakare

International Journal of Computer Applications

Foundation of Computer Science (FCS), NY, USA

Volume 131 - Issue 9

Published: December 2015

Authors: Karan Panjwani, Sahil Pathan, Nitin Yadav, Shreyas Lokhande, Bhushan Thakare

10.5120/ijca2015907393

PDF

Karan Panjwani, Sahil Pathan, Nitin Yadav, Shreyas Lokhande, Bhushan Thakare . Load Balancing, Optimal Routing and Scheduling in Hyper-Local. International Journal of Computer Applications. 131, 9 (December 2015), 32-35. DOI=10.5120/ijca2015907393

                        @article{ 10.5120/ijca2015907393,
                        author  = { Karan Panjwani,Sahil Pathan,Nitin Yadav,Shreyas Lokhande,Bhushan Thakare },
                        title   = { Load Balancing, Optimal Routing and Scheduling in Hyper-Local },
                        journal = { International Journal of Computer Applications },
                        year    = { 2015 },
                        volume  = { 131 },
                        number  = { 9 },
                        pages   = { 32-35 },
                        doi     = { 10.5120/ijca2015907393 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }

                        %0 Journal Article
                        %D 2015
                        %A Karan Panjwani
                        %A Sahil Pathan
                        %A Nitin Yadav
                        %A Shreyas Lokhande
                        %A Bhushan Thakare
                        %T Load Balancing, Optimal Routing and Scheduling in Hyper-Local%T 
                        %J International Journal of Computer Applications
                        %V 131
                        %N 9
                        %P 32-35
                        %R 10.5120/ijca2015907393
                        %I Foundation of Computer Science (FCS), NY, USA

Abstract

Classification of different job scheduling algorithms for balancing the load on Web Servers. Static and Dynamic Scheduling Algorithms are thoroughly discussed and the strengths and weaknesses of these Algorithms. Genetic Algorithms used to get the best of the Optimal Routing and Scheduling problems.

References

Jiani Guo and Laxmi Narayan Bhuyan, “Load Balancing in a Cluster-Based Web Server for Multimedia Applications”, IEEE Trans. Parallel Distrib. Syst. 17, 11 (November 2006), 1321-1334.
Teixeira, M, M. Santana, M. J.Santana, R. H. C, “Analysis of Task Scheduling Algorithms in Distributed Web-server Systems”, In International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS 2003), p.655{63. Montreal, Canada, Jul., 2003.
S.kontogianis, S. Valsamidis, P. Eframidis, A.karakos, “An adaptive load balancing algorithm for cluster based web systems”, http://skontog.gr/papers/duthtr-12-07.pdf
Casalicchio, E., and Colajanni, M, “A client-aware dispatching algorithm for web clusters providing multiple services”, WWW ACM (2001), 535–544.
Kant, K.; Won, Y, “Server capacity planning for web traffic workload” IEEE Transactions on Data and Knowledge Engineering, v.11, n.5, p.731 {47.
Chakroborty, P. and Samanta, S. (working paper). An asexual genetic algorithm for the vehicle routing problem with capacity constraints.
Chakroborty, P. and Mandal, A. (in press). An asexual genetic algorithm for the general single vehicle routing problem. Engineering Optimization.
Chakroborty, P. (2003). Genetic algorithms for optimal urban transit network design. Journal of Computer Aided Civil and Infrastructure Engineering, 184-200
Chakroborty, P. and Dwivedi, T. (2002). Optimal route network design for transit systems using genetic algorithms. Engineering Optimization, (1), 83-100.
Chakroborty, P., Deb, K. and Sharma, R. K. (2001). Optimal fleet size distribution and scheduling of urban transit systems using genetic algorithms. Transportation Planning and Technology, (3), 209-226
Deb, K. and Chakroborty, P. (1998) Time scheduling of transit systems with transfer considerations using genetic algorithms. Journal of Evolutionary Computation, (1), 1-24.
Chakroborty, P., Deb, K. and Srinivas, B. (1998) Network-wide optimal scheduling of urban transit networks using genetic algorithms. Journal of Computer Aided Civil and Infrastructure Engineering, 363-376.
Chakroborty, P., Deb, K., and Porwal, H. (1997). A genetic algorithm based procedure for optimal transit system scheduling. Proceedings of Fifth International Conference on Computers in Urban Planning and Urban Management, Mumbai, India, 330-341.
Chakroborty, P., Deb, K. and Subrahmanyam, P. S. (1995) Optimal scheduling of urban transit system using genetic algorithms. ASCE Journal of Transportation Engineering, (6), 544-553.
Chatterjee, S., Carrera, C. and Lynch, L. A. (1996). Genetic algorithms and traveling salesman problems. European Journal of Operational Research, 490-510
2011 KEMP Technologies, Inc., loadbalancerblog.com, “Load Balancing Scheduling Methods Explained”.
2015 Liquid Web Inc., liquid web | Knowledge Base, “Understanding Load Balancing”.
Joanne Suk Chun Chew and Lai Soon Lee, “A Genetic Algorithm for Urban Transit Routing Problem”. International Conference Mathematical and Computational Biology 2011. International Journal of Modern Physics: Conference Series (Vol. 9 (2012) 411–421).
NEO – Network and Emerging Optimization.

Index Terms

Computer Science

Information Sciences

No index terms available.

Keywords

Cluster Genetic Algorithms Load Balancing Nodes Routing Scheduling Algorithms Traffic Web Server.