A Distributed Spanning Tree-Based Dynamic Self-Organizational Framework for Web Server

  • J. Amudhavel
  • U. Prabu
  • N. Saravanan
  • P. Dhavachelvan
  • R. Baskaran
  • V. S. K. Venkatachalapathy
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 381)

Abstract

Web services are playing a very important role in various business-based applications. There are an enormous amount of web services present and they are creating a huge web traffic. The organizations are trying to reduce the web traffic by having cluster-based web servers. It is a vital task to handle these cluster-based web servers while they have a varying load on it. These servers should be highly scalable and available. Load balancing is an important technique to provide rapid response to the requests of the client. As the process of load balancing occurs fault tolerance should be taken care of. This paper focuses on the scalable, fault-tolerant, and load balancing mechanism of cluster-based web servers. The distributed spanning tree structure is used for balancing the client requests among the cluster-based servers. An architecture based on DST is proposed in this paper for cluster-based web servers.

Keywords

Web server Load balancing Load balancing algorithms DST Based load balancing architecture 

References

  1. 1.
    Tai, J., Li, Z., Chen, J., Mi, N.: Load balancing for cluster systems under heavy-tailed and temporal dependent workloads. Simul. Model. Pract. Theory 44, 63–77 (2014)CrossRefGoogle Scholar
  2. 2.
    Salchow, K.: Load balancing 101: nuts and bolts. White Paper, F5 Networks, Inc. (2007)Google Scholar
  3. 3.
    Gupta, V., Harchol-Balter, M., Sigman, K., Whitt, W.: Analysis of join-the-shortest-queue routing for web server farms. Perform. Eval. 64, 1062–1081 (2007)CrossRefGoogle Scholar
  4. 4.
    Feng, H., Visra, M., Rubenstein, D.: Optimal state-free, size-aware dispatching for heterogeneous m/g/-type systems. Perform. Eval. J. 62, 475–492 (2005)CrossRefGoogle Scholar
  5. 5.
    Zhang, Q., Riska, A., Sun, W., Smirni, E., Ciardo, G.: Workload-aware load balancing for clustered web servers. IEEE Trans. Paral. Distrib. Syst. 16, 219–233 (2005)CrossRefGoogle Scholar
  6. 6.
    Harchol-Balter, M., Crovella, M., Murta, C.: On choosing a task assignment policy for a distributed server system. J. Paral. Distrib. Comput. 59, 204–228 (1999)CrossRefGoogle Scholar
  7. 7.
    Harchol-Balter, M., Scheller-Wolf, A., Young, A.R.: Surprising results on task assignment in server farms with high-variability workloads. Proceedings of International Joint Conference on Measurement and Modeling of Computer Systems, pp. 287–298 (2009)Google Scholar
  8. 8.
    Bachmat, E., Sarfati, H.: Analysis of sita policies. Perform. Eval. 67, 102–120 (2010)CrossRefGoogle Scholar
  9. 9.
    Zhang, Q., Mi, N., Riska, A., Smirni, E.: Performance-guided load (un)balancing under auto correlated flows. IEEE Trans. Paral. Distrib. Syst. (TPDS) 19, 652–665 (2008)CrossRefGoogle Scholar
  10. 10.
    Vvedenskaya, N.D., Dobrushin, R.L., Karpelevich, F.I.: Queueing system with selection of the shortest of two queues: an asymptotic approach. Probl. Inf. Transm. 32(1), 20–34 (1996)MathSciNetGoogle Scholar
  11. 11.
    Mitzenmacher, M.: The power of two choices in randomized load balancing. Ph.D. Thesis, Berkeley (1996)Google Scholar
  12. 12.
    Bramson, M., Lu, Y., Prabhakar, B.: Randomized load balancing with general service time distributions. ACM Sigmetrics (2010)Google Scholar
  13. 13.
    Graham, C.: Chaoticity on path space for a queueing network with selection of the shortest queue among several. J. Appl. Probab. 37, 198–211 (2000)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Luczak, M., McDiarmid, C.: On the maximum queue length in the supermarket model. Ann. Probab. 34(2), 493–527 (2006)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Casalicchio, E., Colajanni, M.: A client aware dispatching algorithm for web clusters providing multiple services. Proceedings of the 10th International Conference on WWW, pp. 535–544 (2001)Google Scholar
  16. 16.
    Casalicchio, E., Cardellini, V., Colajanni, M.: Content-aware dispatching algorithms for cluster-based web servers. Cluster Comput. 5, 65–74 (2002)CrossRefGoogle Scholar
  17. 17.
    Zhang, Q., Riska, A., Sun, W., Smirni, E., Ciardo, G.: Workload-aware load-balancing for clustered web servers. IEEE Trans. Parallel Distrib. Syst. 16(3), 219–233 (2005)Google Scholar
  18. 18.
    Eludiora, S., Abiona, O., Aderounmu, G., Oluwatope, A., Onime, C., Kehinde, L.: A load balancing policy for distributed web service. Int. J. Commun. Network Syst. Sci. 3, 645–654Google Scholar
  19. 19.
    Yi, L., Xie, Q., Kliot, G., Geller, A., Larus, J.R., Greenberg, A.: Join-idle-queue: a novel load balancing algorithm for dynamically scalable web services. Perform. Eval. 68, 1056–1071 (2011)CrossRefGoogle Scholar
  20. 20.
    Boone, B., Van Hoecke, S., Van Seghbroeck, G., Joncheere, N., Jonckers, V., De Turck, F., Develder, C., Dhoedt, B.: SALSA: QoS-aware load balancing for autonomous service brokering. J. Syst. Softw. 83, 446–456 (2010)CrossRefGoogle Scholar
  21. 21.
    Tai, J., Li, Z., Chen, J., Mi, N.: Load balancing for cluster systems under heavy-tailed and temporal dependent workloads. Simul. Model. Pract. Theory 44, 63–77 (2014)CrossRefGoogle Scholar
  22. 22.
    Zhang, Q., Riska, A., Sun, W., Smirni, E., Ciardo, G.: Workload-aware load balancing for clustered web servers. IEEE Trans. Paral. Distrib. Syst. 16, 219–233 (2005)CrossRefGoogle Scholar
  23. 23.
    Nelson, R., Philips, T.: An approximation for the mean response time for shortest queue routing with general interarrival and service times. Perform. Eval. 17, 123–139 (1998)CrossRefGoogle Scholar
  24. 24.
    Sharifian, S., Motamed, S.A., Akbari, M.K.: A content-based load balancing algorithm with admission control for cluster web servers. Future Gener. Comput. Syst. 24, 775–787 (2008)CrossRefGoogle Scholar
  25. 25.
    Ungureanua, V., Melamed, B., Katehakis, M.: Effective load balancing for cluster-based servers employing job preemption. Perform. Eval. 65, 606–622 (2008)CrossRefGoogle Scholar
  26. 26.
    Sharifian, S., Motamed, S.A., Akbari, M.K.: A predictive and probabilistic load-balancing algorithm for cluster-based web servers. Appl. Soft Comput. 11, 970–981 (2011)CrossRefGoogle Scholar
  27. 27.
    Dahan, S., Philippe, L., Nicod, J.M.: The distributed spanning tree structure. IEEE Trans. Parallel Distrib. Syst. 20, 12 (2009)Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  • J. Amudhavel
    • 1
  • U. Prabu
    • 1
  • N. Saravanan
    • 2
  • P. Dhavachelvan
    • 3
  • R. Baskaran
    • 4
  • V. S. K. Venkatachalapathy
    • 5
  1. 1.Department of Computer Science and EngineeringSMVECPondicherryIndia
  2. 2.Department of Information TechnologyTCETVandavasiIndia
  3. 3.Department of CSEPondicherry UniversityPondicherryIndia
  4. 4.Department of CSEAnna UniversityChennaiIndia
  5. 5.Department of Mechanical EngineeringSMVECPondicherryIndia

Personalised recommendations