Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
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...
In this paper, we consider a discrete-time finite-capacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and s...
Xeung W. Yi, Nam K. Kim, Bong K. Yoon, Kyung C. Ch...
Slowdown, defined as the ratio of a request’s queueing delay to its service time, is accepted as an important quality of service metric of Internet servers. In this paper, we i...
Xiaobo Zhou, Yu Cai, C. Edward Chow, Marijke F. Au...
We analyze a general market for an industry of competing service facilities. Firms differentiate themselves by their price levels and the waiting time their customers experience,...