A distributed spanning tree-based dynamic self-organizational framework for web server

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

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 Advances in Intelligent Systems and Computing (Vol. 381, pp. 333–339). Springer Verlag. https://doi.org/10.1007/978-81-322-2526-3_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free