CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Load Balancing, Optimal Routing and Scheduling in Hyper-Local

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

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 131 - Number 9
Year of Publication: 2015
Authors: Karan Panjwani, Sahil Pathan, Nitin Yadav, Shreyas Lokhande, Bhushan Thakare
10.5120/ijca2015907393

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 },
issue_date = { December 2015 },
volume = { 131 },
number = { 9 },
month = { December },
year = { 2015 },
issn = { 0975-8887 },
pages = { 32-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume131/number9/23480-2015907393/ },
doi = { 10.5120/ijca2015907393 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:27:52.236068+05:30
%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
%J International Journal of Computer Applications
%@ 0975-8887
%V 131
%N 9
%P 32-35
%D 2015
%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
  1. 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.
  2. 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.
  3. 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
  4. Casalicchio, E., and Colajanni, M, “A client-aware dispatching algorithm for web clusters providing multiple services”, WWW ACM (2001), 535–544.
  5. 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.
  6. Chakroborty, P. and Samanta, S. (working paper). An asexual genetic algorithm for the vehicle routing problem with capacity constraints.
  7. Chakroborty, P. and Mandal, A. (in press). An asexual genetic algorithm for the general single vehicle routing problem. Engineering Optimization.
  8. Chakroborty, P. (2003). Genetic algorithms for optimal urban transit network design. Journal of Computer Aided Civil and Infrastructure Engineering, 184-200
  9. Chakroborty, P. and Dwivedi, T. (2002). Optimal route network design for transit systems using genetic algorithms. Engineering Optimization, (1), 83-100.
  10. 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
  11. Deb, K. and Chakroborty, P. (1998) Time scheduling of transit systems with transfer considerations using genetic algorithms. Journal of Evolutionary Computation, (1), 1-24.
  12. 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.
  13. 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.
  14. 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.
  15. Chatterjee, S., Carrera, C. and Lynch, L. A. (1996). Genetic algorithms and traveling salesman problems. European Journal of Operational Research, 490-510
  16. 2011 KEMP Technologies, Inc., loadbalancerblog.com, “Load Balancing Scheduling Methods Explained”.
  17. 2015 Liquid Web Inc., liquid web | Knowledge Base, “Understanding Load Balancing”.
  18. 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).
  19. NEO – Network and Emerging Optimization.
Index Terms

Computer Science
Information Sciences

Keywords

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

Powered by PhDFocusTM