General Purpose Model of Queue Dissipation Time at Service Facility with Intermittent Bulk Service Schedule
Generalization of the Modified Bessel Function and Its Generating Function
2000 Mathematics Subject Classification: 33C10, 33-02, 60K25This paper presents new generalizations of the modified Bessel function and its generating function. This function has important application in the transient solution of a queueing system.
Generalization of waiting times model
systems with resident server and generally distributed arrival and service groups.
GI/M/1 queueing systems with service rates depending on the length of queue
Heterogeneous queueing systems with balking
Identification of waiting time distribution of M/G/1, M x/G/1, GI r/M/1 queueing systems.
Imbedded Markov Chains in Queueing Systems M-G-1 and G1-M-1 with Limited Waiting Room
Immediate service in a Beneš-type G/G/1 queueing system
Inequalities for multiserver queues and a tandem queue
Infinite queueing systems with tree structure
We focus on invariant measures of an interacting particle system in the case when the set of sites, on which the particles move, has a structure different from the usually considered set . We have chosen the tree structure with the dynamics that leads to one of the classical particle systems, called the zero range process. The zero range process with the constant speed function corresponds to an infinite system of queues and the arrangement of servers in the tree structure is natural in a number...
Intégrabilité des temps de renouvellement des files d'attente et applications
Interloss time in loss system.
Isomorphs of a class of queueing systems.
Iterative Methods for Overflow Queuing Models I.
Iterative Methods for Overflow Queuing Models II.
Joint distribution of the busy and idle periods of a discrete modified queue
For a discrete modified queue, , where the service times of all customers served during any busy period are independent random variables with not necessarily identical distribution functions, the joint distribution of the busy period, the subsequent idle period and the number of customers served during the busy period is derived. The formulae presented are in a convenient form for practical use. The paper is a continuation of [5], where the discrete modified queue has been studied.
Joint distribution of the number of customers in the queue and the number of batches served at time within a busy period
Joint distribution of waiting time and queue size for single server queues [Book]
Lévy processes conditioned on having a large height process
In the present work, we consider spectrally positive Lévy processes not drifting to and we are interested in conditioning these processes to reach arbitrarily large heights (in the sense of the height process associated with ) before hitting . This way we obtain a new conditioning of Lévy processes to stay positive. The (honest) law of this conditioned process (starting at ) is defined as a Doob -transform via a martingale. For Lévy processes with infinite variation paths, this martingale...