Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Proceedings of the Second International Conference on Computer and Communication Technologies

Part of the book series: Advances in Intelligent Systems and Computing ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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)

    Article  Google Scholar 

  2. Salchow, K.: Load balancing 101: nuts and bolts. White Paper, F5 Networks, Inc. (2007)

    Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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. Bachmat, E., Sarfati, H.: Analysis of sita policies. Perform. Eval. 67, 102–120 (2010)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    MathSciNet  Google Scholar 

  11. Mitzenmacher, M.: The power of two choices in randomized load balancing. Ph.D. Thesis, Berkeley (1996)

    Google Scholar 

  12. Bramson, M., Lu, Y., Prabhakar, B.: Randomized load balancing with general service time distributions. ACM Sigmetrics (2010)

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  14. Luczak, M., McDiarmid, C.: On the maximum queue length in the supermarket model. Ann. Probab. 34(2), 493–527 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  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. Casalicchio, E., Cardellini, V., Colajanni, M.: Content-aware dispatching algorithms for cluster-based web servers. Cluster Comput. 5, 65–74 (2002)

    Article  Google Scholar 

  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. 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–654

    Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  25. Ungureanua, V., Melamed, B., Katehakis, M.: Effective load balancing for cluster-based servers employing job preemption. Perform. Eval. 65, 606–622 (2008)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  27. Dahan, S., Philippe, L., Nicod, J.M.: The distributed spanning tree structure. IEEE Trans. Parallel Distrib. Syst. 20, 12 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, SMVEC, Pondicherry, India

    J. Amudhavel & U. Prabu

  2. Department of Information Technology, TCET, Vandavasi, India

    N. Saravanan

  3. Department of CSE, Pondicherry University, Pondicherry, India

    P. Dhavachelvan

  4. Department of CSE, Anna University, Chennai, India

    R. Baskaran

  5. Department of Mechanical Engineering, SMVEC, Pondicherry, India

    V. S. K. Venkatachalapathy

Authors
  1. J. Amudhavel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. U. Prabu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. Saravanan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. P. Dhavachelvan
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. R. Baskaran
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. V. S. K. Venkatachalapathy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Amudhavel .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Anil Neerukonda Institute of Technology and Sciences, Visakhapatnam, India

    Suresh Chandra Satapathy

  2. Department of CSE, CMR Technical Campus, Hyderabad, India

    K. Srujan Raju

  3. Computer Science & Engineering, Kalyani University, Nadia, West Bengal, India

    Jyotsna Kumar Mandal

  4. Electronics and Communication, Shri Ramswaroop Memorial Group of Professional Colleges, Lucknow, Uttar Pradesh, India

    Vikrant Bhateja

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Amudhavel, J., Prabu, U., Saravanan, N., Dhavachelvan, P., Baskaran, R., Venkatachalapathy, V.S.K. (2016). A Distributed Spanning Tree-Based Dynamic Self-Organizational Framework for Web Server. In: Satapathy, S., Raju, K., Mandal, J., Bhateja, V. (eds) Proceedings of the Second International Conference on Computer and Communication Technologies. Advances in Intelligent Systems and Computing, vol 381. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2526-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2526-3_35

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2525-6

  • Online ISBN: 978-81-322-2526-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation