From the news
- Chancellor Amma Addresses the Parliament of World’s Religions
- Amrita Students Qualify for the European Mars Rover Challenge
Publication Type : Conference Paper
Publisher : Wireless Networks and Computational Intelligence, Springer Berlin Heidelberg
Source : Wireless Networks and Computational Intelligence, Springer Berlin Heidelberg, Volume 292 CCIS, Berlin, Heidelberg, p.621-631 (2012)
ISBN : 9783642316869
Campus : Coimbatore
School : School of Engineering
Department : Computer Science
Verified : Yes
Year : 2012
Abstract : As Internet services become more popular and pervasive, a serious problem that arises is managing the performance of services under intense overload. Models and mechanisms proposed by researchers till date either stop answering requests or give answers based on incomplete/stale data, specifically when Web servers become saturated. The paper provides two contributions to the study of improving the performance of Web servers in terms of support for massive concurrency. Firstly it outlines the factors necessary to build scalable Web servers and the research contributions made to these. Secondly it illustrates how these factors can be combined and applied to obtain architecture for highly concurrent Internet services. The proposed scheme addresses the issues of overload and staleness effectively and ensures that more number of legitimate requests is answered with complete data. It is shown to improve Web QoS for commercial Web servers through control mechanisms that offer adaptive load shedding,improved availability, and secure transactions using a multi layered filtering scheme. Our experimental results show that the proposed architectural framework provides a simpler programming model that achieves superior performance.
Cite this Research Publication : Dr. Harini N. and Padmanabhan, T. R., “A Secured-Concurrent-Available Architecture for Improving Performance of Web Servers”, in Wireless Networks and Computational Intelligence, Berlin, Heidelberg, 2012, vol. 292 CCIS, pp. 621-631.