Sciweavers

16 search results - page 3 / 4
» Single-Server Queue with Markov-Dependent Inter-Arrival and ...
Sort
View
SIGCOMM
1996
ACM
13 years 10 months ago
Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks
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...
Pawan Goyal, Harrick M. Vin, Haichen Cheng
TOMACS
2002
113views more  TOMACS 2002»
13 years 5 months ago
Simulating heavy tailed processes using delayed hazard rate twisting
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...
Sandeep Juneja, Perwez Shahabuddin
EOR
2007
66views more  EOR 2007»
13 years 5 months ago
Analysis of the queue-length distribution for the discrete-time batch-service Geo
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...
ICPP
2005
IEEE
13 years 11 months ago
Two-Tier Resource Allocation for Slowdown Differentiation on Server Clusters
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...
IOR
2007
100views more  IOR 2007»
13 years 5 months ago
Competition in Service Industries
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,...
Gad Allon, Awi Federgruen