ACM Home Page
Please provide us with feedback. Feedback
Tandem queue with server slow-down
Full text PdfPdf (241 KB)
Source
ACM SIGMETRICS Performance Evaluation Review archive
Volume 35 ,  Issue 3  (December 2007) table of contents
WORKSHOP SESSION: Sigmetrics 2007 students workshop table of contents
Pages 51-52  
Year of Publication: 2007
ISSN:0163-5999
Authors
D. I. Miretskiy  University of Twente, AE Enschede, The Netherlands
W. R. W. Scheinhardt  University of Twente, AE Enschede, The Netherlands
M. R. H. Mandjes  University of Amsterdam, Amsterdam, The Netherlands
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1328690.1328712
What is a DOI?

ABSTRACT

We study how rare events happen in the standard two-node tandem Jackson queue and in a generalization, the socalled slow-down network, see [2]. In the latter model the service rate of the first server depends on the number of jobs in the second queue: the first server slows down if the amount of jobs in the second queue is above some threshold and returns to its normal speed when the number of jobs in the second queue is below the threshold. This property protects the second queue, which has a finite capacity B, from overflow. In fact this type of overflow is precisely the rare event we are interested in. More precisely, consider the probability of overflow in the second queue before the entire system becomes empty. The starting position of the two queues may be any state in which at least one job is present.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
V. Anantharam, P. Heidelberger and P. Tsoucas (1990). Analysis of rare events in continuous time Markov chains via time reversal and fluid approximation. IBM Research Report RC 16280.
 
2
N. D. van Foreest, M. R. H. Mandjes, J. C. W. van Ommeren, W. R. W. Scheinhardt (2005). A tandem queue with server slow-down and blocking. Stochastic Models 21 (2--3), 695--724.
3
4
 
5
 
6
S. Parekh, J. Walrand (1989). A quick simulation method for excessive backlogs in networks of queues. IEEE Transactions on Automatic Control 34, 54--66.

Collaborative Colleagues:
D. I. Miretskiy: colleagues
W. R. W. Scheinhardt: colleagues
M. R. H. Mandjes: colleagues