Sciweavers

90 search results - page 14 / 18
» questa 2006
Sort
View
QUESTA
2006
80views more  QUESTA 2006»
13 years 7 months ago
Sojourn time distributions in the queue defined by a general QBD process
We consider a general QBD process as defining a FIFO queue and obtain the stationary distribution of the sojourn time of a customer in that queue as a matrix exponential distribut...
Toshihisa Ozawa
QUESTA
2006
110views more  QUESTA 2006»
13 years 7 months ago
Analysis of customers' impatience in queues with server vacations
Abstract Many models for customers impatience in queueing systems have been studied in the past; the source of impatience has always been taken to be either a long wait already exp...
Eitan Altman, Uri Yechiali
QUESTA
2006
119views more  QUESTA 2006»
13 years 7 months ago
Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-kno...
Ivo J. B. F. Adan, Vidyadhar G. Kulkarni
QUESTA
2006
49views more  QUESTA 2006»
13 years 7 months ago
A survey on discriminatory processor sharing
The Discriminatory Processor Sharing (DPS) model is a multi-class generalization of the egalitarian Processor Sharing model. In the DPS model all jobs present in the system are se...
Eitan Altman, Konstantin Avrachenkov, Urtzi Ayesta
QUESTA
2006
100views more  QUESTA 2006»
13 years 7 months ago
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
We compare the performance of three usual allocations (max-min fairness, proportional fairness and balanced fairness) in a communication network whose resources are shared by a ra...
Thomas Bonald, Laurent Massoulié, Alexandre...