| | |
Summary: Priority Queueing with Finite Bu er Size and
Randomized Push-Out Mechanism ?
Konstantin E. Avrachenkov
INRIA Sophia Antipolis, 2004, Route des Lucioles, B.P. 93, 06902, France
Nikita O. Vilchevsky
St.Petersburg State Polytechnic University, 29, Polytechnicheskaya Str.,
St.Petersburg, 195251, Russia
Georgy L. Shevlyakov
Dept. of Information and Communications, Gwangju Institute of Science and
Technology (GIST), 1 Oryong-dong, Buk-gu, Gwangju, 500-712, South Korea
Abstract
The non-preemptive priority queueing with a nite bu er is considered. We intro-
duce a randomized push-out bu er management mechanism which allows to control
very eÆciently the loss probability of priority packets. The packet loss probabilities
for priority and non-priority traÆc are calculated using the generating function ap-
proach. In the particular case of the standard non-randomized push-out scheme we
obtain explicit analytic expressions. The theoretical results are illustrated by nu-
merical examples. The randomized push-out scheme is compared with the threshold
based push-out scheme. It turns out that the former is much easier to tune than
the latter. The proposed scheme can be applied to the Di erentiated Services of the
|
