Weighted fair queueing scheduling for World Wide Web proxy servers

Rachid El Abdouni Khayari; Ramin Sadre; Boudewijn R. Haverkort; Norman Zoschke

doi:10.1117/12.473383

1 July 2002 Weighted fair queueing scheduling for World Wide Web proxy servers

Rachid El Abdouni Khayari, Ramin Sadre, Boudewijn R. Haverkort, Norman Zoschke

Proceedings Volume 4865, Internet Performance and Control of Network Systems III; (2002) https://doi.org/10.1117/12.473383
Event: ITCom 2002: The Convergence of Information Technologies and Communications, 2002, Boston, MA, United States

Abstract

Current world-wide web servers as well as proxy servers rely for their scheduling on services provided by the underlying operating system. In practice, this means that some form of first-come-first-served (FCFS) scheduling is utilised. Although FCFS is a reasonable scheduling strategy for job sequences that do not show much variance, in the world-wide web (WWW), however, it has been shown that the typical object sizes requested do exhibit heavy tails. This means that the probability to observe very long jobs (very large objects) is much higher than typically predicted using an exponential model. Under these circumstances, job scheduling on the basis of shortest-job first (SJF) has been shown to perform much better, in fact, to minimise the total average waiting time, simply by avoiding situations in which short jobs have to wait for very long one. However, SJF has as disadvantage that long jobs might suffer from starvation. In order to avoid the problems of both FCFS and SJF we present in this paper a new scheduling algorithm called class-based interleaving weighted fair queueing (CI-WFQ). This algorithm uses the specific characteristics of the job stream being served, that is, the distribution of the sizes of the objects being requested, to set its parameters such that good mean reponse times are obtained and starvation does not occur. In the paper, the new scheduling approach is introduced and compared, using trace-driven simulations, with existing scheduling approaches.

Citation Download Citation

Rachid El Abdouni Khayari, Ramin Sadre, Boudewijn R. Haverkort, and Norman Zoschke "Weighted fair queueing scheduling for World Wide Web proxy servers", Proc. SPIE 4865, Internet Performance and Control of Network Systems III, (1 July 2002); https://doi.org/10.1117/12.473383

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available