| | |
Summary: The N-Burst/G/1 model with heavy-tailed service-times distribution
Ronit Nossenson and Hagit Attiya
Dept. of Computer Science
Technion, Haifa, 32000, Israel
ronitt@cs.technion.ac.il, hagit@cs.technion.ac.il
Abstract
This study introduces a new analytic queuing model, the
N-Burst/G/1 model with heavy-tailed service-time distribu-
tion, which captures many of the issues that affect Web
servers as observed by empirical studies. An asymptotic
calculation of the model's waiting-time distribution is pre-
sented; this relies on calculating the waiting-time distribu-
tion in the M/G/1 model with heavy-tailed service-time dis-
tribution. Finally, using real data and simulation we verify
the model's assumptions and demonstrate its accuracy.
1. Introduction
Empirical studies show that Web servers suffer from
both self-similar document arrival process and heavy-tailed
service-time distribution [7, 8, 14].
|
