The case for persistent-connection HTTP
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Kernel Mechanisms for Service Differentiation in Overloaded Web Servers
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
Measuring the capacity of a web server
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Efficient support for P-HTTP in cluster-based web servers
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Web server support for tiered services
IEEE Network: The Magazine of Global Internetworking
Handling Multiple Bottlenecks in Web Servers Using Adaptive Inbound Controls
PIHSN '02 Proceedings of the 7th IFIP/IEEE International Workshop on Protocols for High Speed Networks
Web servers under overload: How scheduling can help
ACM Transactions on Internet Technology (TOIT)
| Hi-index | 0.00 |
Several overload admission control architectures have been developed to protect web servers from overload. Some of these architectures base their admission decision on information found in the HTTP header. In this context, persistent connections represent a challenging problem since the HTTP header of the first request does not reveal any information about the resource consumption of the requests that might follow on the same connection. In this paper, we present an architecture that prevents uncontrollable server overload caused by persistent connections. We evaluate our approach by various experiments.