Diffusion Approximation Model of Multiserver Stations with Losses
Author(s) -
Tadeusz Czachórski,
Jean-Michel Fourneau,
Tomasz Nycz,
Ferhan Pekergin
Publication year - 2009
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2009.02.054
Subject(s) - queueing theory , server , heavy traffic approximation , computer science , formalism (music) , layered queueing network , queue , diffusion , mathematical optimization , computer network , mathematics , real time computing , discrete mathematics , physics , visual arts , art , musical , thermodynamics
The article presents a diffusion approximation model of a G/G/N/N station – N parallel servers without queueing. Diffusion approximation allows us to include in queueing models fairly general assumptions. First of all it gives us a tool to consider in a natural way transient states of queues, which is very rare in classical queueing models. Then we may consider input streams with general interarrival time distributions and servers with general service time distributions. Single server models may be easily incorporated into a network of queues. Here, we apply the diffusion approximation formalism to study transient behaviour of G/G/N/N station and use it to construct a model of a typical call centre and to study the sliding window mechanism, a popular Call Admission Control (CAC) algorithm
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom