62 search results - page 2 / 13 » Priority queueing systems: from probability generating funct... |
QUESTA
2006
13 years 5 months ago
2006
Priority queueing systems come natural when customers with diversified delay requirements have to wait to get service. The customers that cannot tolerate but small delays get serv...
TOMACS
2002
13 years 5 months ago
2002
Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying rand...
PE
2008
Springer
13 years 5 months ago
2008
Springer
We present the transient analysis of the system content in a two-class discrete-time MX /D/1 priority queue. In particular, we derive an expression for the generating function of ...
WSC
2000
13 years 6 months ago
2000
This paper deals with estimating small tail probabilities of the steady-state waiting time in a GI/GI/1 queue with heavy-tailed (subexponential) service times. The problem of esti...
QUESTA
2007
13 years 4 months ago
2007
We propose a new queueing model named the acquisition queue. It differs from conventional queueing models in that the server not only serves customers, but also performs acquisit...