A foreground-background time sharing queue with general service times

2005 ◽  
pp. 103-125
Author(s):  
C. Guimaraes
Keyword(s):  
Time Sharing ◽  
General Service Times ◽  
Service Times ◽  
General Service

scholarly journals Cyclic queueing networks with subexponential service times

2004 ◽  
Vol 41 (03) ◽  
pp. 791-801
Author(s):  
H. Ayhan ◽  
Z. Palmowski ◽  
S. Schlegel
Keyword(s):  
Queueing Networks ◽  
Time Distribution ◽  
Waiting Times ◽  
Queueing Network ◽  
Service Time Distribution ◽  
Tail Behavior ◽  
Cycle Times ◽  
General Service Times ◽  
Service Times ◽  
General Service

For a K-stage cyclic queueing network with N customers and general service times, we provide bounds on the nth departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service-time distribution is subexponential.

scholarly journals A simple proof of a result of Iglehart and Shedler

1985 ◽  
Vol 17 (1) ◽  
pp. 239-241
Author(s):  
Mark Berman
Keyword(s):  
Confidence Intervals ◽  
Simple Proof ◽  
Passage Time ◽  
Alternative Proof ◽  
Multiclass Networks ◽  
Simple Alternative ◽  
General Service Times ◽  
Service Times ◽  
General Service ◽  
Networks Of Queues

Iglehart and Shedler (1983) prove that the ‘labelled jobs’ method for estimation of passage-time characteristics in closed multiclass networks of queues with general service times provides asymptotically shorter confidence intervals than does the ‘marked job’ method. A simple alternative proof of this result, under slightly more restrictive conditions, is given here.

Sign in / Sign up

Export Citation Format

Share Document