Download now Free registration required
This paper addresses the problem of how to service web requests quickly in order to minimize the client response time. Some of the recent work uses the idea of the Shortest Remaining Processing Time scheduling (SRPT) in Web servers in order to give preference to requests for short files. However, by considering only the size of the file for determining the priority of requests, the previous works lack in capturing potentially useful scheduling information contained in the interaction between networks and end systems. To address this, this paper proposes and implements an algorithm, SWIFT, that focuses on both server and network characteristics in conjunction.
- Format: PDF
- Size: 122.7 KB