Sciweavers

302 search results - page 27 / 61
» On Queues with Inter-Arrival Times Proportional to Service T...
Sort
View
TON
2010
198views more  TON 2010»
13 years 2 months ago
On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability
Abstract-- In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a...
V. J. Venkataramanan, Xiaojun Lin
WSC
2007
13 years 10 months ago
Modeling the performance of low latency queueing for emergency telecommunications
Event simulation and analytic modeling are used to evaluate the performance of Low Latency Queueing (LLQ), a queueing discipline available in some Internet packet switching router...
Denise M. Bevilacqua Masi, Martin J. Fischer, Davi...
SOSE
2008
IEEE
14 years 2 months ago
Toward Scalable Statistical Service Selection
Selecting quality services over the Internet is tedious because it requires looking up of potential services, and yet the qualities of these services may evolve with time. Existin...
Lijun Mei, W. K. Chan, T. H. Tse
INFOCOM
1991
IEEE
13 years 11 months ago
Queueing Performance with Impatient Customers
customer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS- cessful servic...
Zheng-Xue Zhao, Shivendra S. Panwar, Donald F. Tow...
EOR
2006
107views more  EOR 2006»
13 years 7 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...