Name
Abstract | ||
|---|---|---|
Current HTTP servers process requests using a first come first serve queuing policy. What this implies is that the web server must process each request as it arrives. The result is that the more requests a client makes, the more replies the server will generate in response. Unfortunately, the ban d- width of the network and the processing capabilities of the server are often limited resulting in an aggressive client, or sets of clients, consuming the majority of the server 's resources, limiting other clients' ability to use their fair allocation. While the traditional behavior of a web server works efficiently for a web site that is non-discriminating towards all clients, guara n- teeing service for preferred clients from the server itself is not yet possible. This paper describes the algorithm we have d e- signed and implemented on the Apache HTTP server, which has been shown to be effective in allocating configurable fixed percentages of bandwidth across numerous simultaneous cli- ents, independent of the aggressiveness of the cl ients' requests. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/INFCOM.2000.832239 | INFOCOM |
Keywords | Field | DocType |
service guarantee,bandwidth,web services,www,process capability,quality of service,queueing theory,optimal control,resource management,kelvin,bandwidth allocation,hardware,web server,transport protocols | Server farm,Client,Computer science,Server,Computer network,Inter-process communication,Operating system,Web server,Client–server model,AppleShare,Application server | Conference |
Citations | PageRank | References |
53 | 8.74 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kelvin Li | 1 | 169 | 19.01 |
| sugih jamin | 2 | 2669 | 493.09 |