Single server queueing networks with varying service times and renewal input. (2000)

• Record Type: Journal Article
• Authors: Gall, Pierre Le
• Is Part Of: Journal of applied mathematics and stochastic analysis. Volume 13:Number 4(2000)
• Page Start: 429
• Page End: 450
• Publication Date: 2000
• Subjects: queueing networks -- concentration tree -- tandem queue -- local queueing delay -- jitter delay -- agglutination phenomena -- apparent queueing delay -- buffer overload; Mathematical models -- Periodicals; Computer simulation -- Periodicals; Computer science -- Mathematics -- Periodicals; Computer science -- Mathematics; Computer simulation; Mathematical models; Applied Mathematics; Periodicals; Electronic journals; 519.22
• DOI: 10.1155/S1048953300000368
• Languages: English
• ISSNs: 1048-9533

Abstract

Abstract : Using recent results in tandem queues and queueing networks with renewal input, when successive service times of the same customer are varying (and when the busy periods are frequently not broken up in large networks), the local queueing delay of a single server queueing network is evaluated utilizing new concepts of virtual and actual delays (respectively). It appears that because of an important property, due to the underlying tandem queue effect, the usual queueing standards (related to long queues) cannot protect against significant overloads in the buffers due to some possible “ agglutination phenomenon ” (related to short queues). Usual network management methods and traffic simulation methods should be revised, and should monitor the partial traffic streams loads (and not only the server load).