Results 1  10
of
1,945,429
Computing QueueLength Distributions for PowerLaw Queues
 in Proc. INFOCOM
, 1998
"... : The interest sparked by observations of longrange dependent traffic in real networks has lead to a revival of interest in nonstandard queueing systems. One such queueing system is the M/G/1 queue where the servicetime distribution has infinite variance. The known results for such systems are as ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
: The interest sparked by observations of longrange dependent traffic in real networks has lead to a revival of interest in nonstandard queueing systems. One such queueing system is the M/G/1 queue where the servicetime distribution has infinite variance. The known results for such systems
ALGORITHMIC COMPUTATION OF THE TRANSIENT QUEUE LENGTH DISTRIBUTION IN THE BMAP/D/c QUEUE
, 2006
"... Abstract This paper proposes a numerically feasible algorithm for the transient queue length distribution in the BMAP/D/c queue. The proposed algorithm ensures the accuracy of the computational result and it is applicable not only to the stable case but also to the unstable case. This paper also dis ..."
Abstract
 Add to MetaCart
Abstract This paper proposes a numerically feasible algorithm for the transient queue length distribution in the BMAP/D/c queue. The proposed algorithm ensures the accuracy of the computational result and it is applicable not only to the stable case but also to the unstable case. This paper also
QueueLength Distributions for MultiPriority Queueing Systems
 in IEEE INFOCOM
, 1999
"... The bottleneck in many telecommunication systems has often been modeled by an M/G/1 queueing system with priorities. While the probability generating function for the occupancy distribution of each traffic classes can be readily obtained, the occupancy distributions have been obtainable only rarely. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The bottleneck in many telecommunication systems has often been modeled by an M/G/1 queueing system with priorities. While the probability generating function for the occupancy distribution of each traffic classes can be readily obtained, the occupancy distributions have been obtainable only rarely
A matrix geometric representation for the queue length distribution of . . .
 PERFORMANCE EVALUATION
"... ..."
Exact asymptotic queue length distribution for fractional Brownian traffic
 Advances in Performance Analysis
, 1998
"... : For a storage model with a fractional Brownian input process, an exact asymptotic expression for the queue length distribution is obtained, using a few plausible assumptions. The probability that the queue length is greater than x is shown to be asymptotically proportional to a Weibullian function ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
: For a storage model with a fractional Brownian input process, an exact asymptotic expression for the queue length distribution is obtained, using a few plausible assumptions. The probability that the queue length is greater than x is shown to be asymptotically proportional to a Weibullian
A New Method to Determine the Queue Length Distribution at an ATM Multiplexer
, 1997
"... In this paper, we develop a simple analytical technique to determine P({Q>q}), the tail of the queue length distribution, at an ATM multiplexer. The ATM multiplexer is modeled as a fluid queue serving a large number of independent sources. Our method is based on the central limit theorem and the ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
In this paper, we develop a simple analytical technique to determine P({Q>q}), the tail of the queue length distribution, at an ATM multiplexer. The ATM multiplexer is modeled as a fluid queue serving a large number of independent sources. Our method is based on the central limit theorem
Evaluating the Queue Length Distribution of an ATM Multiplexer with Multiple Time Scale Arrivals
"... For an ATM multiplexer we develop a recursive asymptotic expansion method for approximating the queue length distribution and investigate the radius of convergence of the queue asymptotic expansion series. The analysis focuses on “small ” to “moderate” buffer sizes under the conditions of strictly s ..."
Abstract
 Add to MetaCart
For an ATM multiplexer we develop a recursive asymptotic expansion method for approximating the queue length distribution and investigate the radius of convergence of the queue asymptotic expansion series. The analysis focuses on “small ” to “moderate” buffer sizes under the conditions of strictly
Queue Length Distribution In A Fifo SingleServer Queue With Multiple Arrival Streams Having Different Service Time Distributions
, 1998
"... This paper considers the queue length distribution in a class of FIFO singleserver queues with (possibly correlated) multiple arrival streams, where the service time distribution of customers from each arrival stream may differ from one another among streams. It is widely recognized that the queue ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
This paper considers the queue length distribution in a class of FIFO singleserver queues with (possibly correlated) multiple arrival streams, where the service time distribution of customers from each arrival stream may differ from one another among streams. It is widely recognized that the queue
Abstract Analysis of the QueueLength Distribution for the DiscreteTime BatchService Geo/G a,Y /1/K Queue
"... In this paper, we consider a discretetime finitecapacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and serves the customers only when the number of customers in system is at least a certain threshold value. For this queue, we ..."
Abstract
 Add to MetaCart
, we first obtain the queuelength distribution just after a service completion, using the embedded Markov chain technique. Then we establish a relationship between the queuelength distribution just after a service completion and that at a random epoch, using elementary ‘ratin=rateout’ arguments
Stationary Queue Length Distribution for M/M/1/K Queue with NonPreemptive Service Priorities
"... Abstract—This paper studies the M/M/1/K queue under nonpreemptive service priority discipline. The paper shows the state transition diagram of the Markov chain and presents the state balance equations, from which the stationary queue length distribution and other measures of interest can be obtained ..."
Abstract
 Add to MetaCart
Abstract—This paper studies the M/M/1/K queue under nonpreemptive service priority discipline. The paper shows the state transition diagram of the Markov chain and presents the state balance equations, from which the stationary queue length distribution and other measures of interest can
Results 1  10
of
1,945,429