The theory of networks of single server queues and the tandem queue model

9Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider the stochastic behavior of networks of single server queues when successive service times of a given customer are highly correlated. The study is conducted in two particular cases: 1) networks in heavy traffic, and 2) networks in which all successive service times have the same value (for a given customer), in order to avoid the possibility of breaking up the busy periods. We then show how the local queueing delay (for an arbitrary customer) can be derived through an equivalent tandem queue on the condition that one other local queueing delay is added: the jitter delay due to the independence of partial traffic streams. We consider a practical application of the results by investigating the influence of long packets on the queueing delay of short packets in modern packet switched telecommunication networks. We compare these results with the results given by traffic simulation methods to conclude that there is good agreement between results of calculation and of traffic simulation. ©1997 by North Atlantic Science Publishing Company.

Cite

CITATION STYLE

APA

Le Gall, P. (1997). The theory of networks of single server queues and the tandem queue model. Journal of Applied Mathematics and Stochastic Analysis, 10(4), 363–381. https://doi.org/10.1155/S1048953397000427

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free