Results 11 to 20 of about 461 (78)
A finite capacity bulk service queue with single vacation and Markovian arrival process
International Journal of Stochastic Analysis, Volume 2004, Issue 4, Page 337-357, 2004., 2004 Vacation time queues with Markovian arrival process (MAP) are mainly useful in modeling and performance analysis of telecommunication networks based on asynchronous transfer mode (ATM) environment. This paper analyzes a single‐server finite capacity queue wherein service is performed in batches of maximum size “b” with a minimum threshold “a” and ...
U. C. Gupta, Karabi Sikdar
wiley +1 more source
Operational behavior of the MAP/G/1 queue under N‐policy with a single vacation and set‐up
International Journal of Stochastic Analysis, Volume 15, Issue 2, Page 151-180, 2002., 2002 This paper considers the MAP/G/1 queue under N‐policy with a single vacation and set‐up. We derive the vector generating functions of the queue length at an arbitrary time and at departures in decomposed forms. We also derive the Laplace‐Stieltjes transform of the waiting time. Computation algorithms for mean performance measures are provided.
Ho Woo Lee, Boo Yong Ahn
wiley +1 more source
Single server tandem queues and queueing networks with non‐correlated successive service times
International Journal of Stochastic Analysis, Volume 14, Issue 4, Page 381-398, 2001., 2001 To evaluate the local actual queueing delay in general single server queueing networks with non‐correlated successive service times for the same customer, we start from a recent work using the tandem queue effect, when two successive local arrivals are not separated by “premature departures”.
Pierre Le Gall
wiley +1 more source
Single server queueing networks with varying service times and renewal input
International Journal of Stochastic Analysis, Volume 13, Issue 4, Page 429-450, 2000., 2000 Using recent results in tandem queues and queueing networks with renewal input, when successive service times of the same customer are varying (and when the busy periods are frequently not broken up in large networks), the local queueing delay of a single server queueing network is evaluated utilizing new concepts of virtual and actual delays ...
Pierre Le Gall
wiley +1 more source
An MX/GI/1/N queue with close‐down and vacation times
International Journal of Stochastic Analysis, Volume 12, Issue 1, Page 63-83, 1999., 1998 An MX/GI/1/N finite capacity queue with close‐down time, vacation time and exhaustive service discipline is considered under the partial batch acceptance strategy as well as under the whole batch acceptance strategy. Applying the supplementary variable technique the queue length distribution at an arbitrary instant and at a departure epoch is obtained ...
Andreas Frey, Yoshitaka Takahashi
wiley +1 more source
A diffusion model for two parallel queues with processor sharing: transient behavior and asymptotics
International Journal of Stochastic Analysis, Volume 12, Issue 4, Page 311-338, 1999., 1999 We consider two identical, parallel M/M/1 queues. Both queues are fed by a Poisson arrival stream of rate λ and have service rates equal to μ. When both queues are non‐empty, the two systems behave independently of each other. However, when one of the queues becomes empty, the corresponding server helps in the other queue.
Charles Knessl
wiley +1 more source
Multi‐dimensional quasitoeplitz Markov chains
International Journal of Stochastic Analysis, Volume 12, Issue 4, Page 393-415, 1999., 1998 This paper deals with multi‐dimensional quasitoeplitz Markov chains. We establish a sufficient equilibrium condition and derive a functional matrix equation for the corresponding vector‐generating function, whose solution is given algorithmically. The results are demonstrated in the form of examples and applications in queues with BMAP‐input, which ...
Alexander N. Dudin +1 more
wiley +1 more source
Controlling delay differentiation with priority jumps: analytical study [PDF]
, 2011 Supporting different services with different Quality of Service (QoS) requirements is not an easy task in modern telecommunication systems: an efficient priority scheduling discipline is of great importance.
Bruneel, Herwig +2 more
core +1 more source
On the ergodic distribution of oscillating queueing systems
, 2003 International Journal of Stochastic Analysis, Volume 16, Issue 4, Page 311-326, 2003.
Mykola Bratiychuk, Andrzej Chydzinski
wiley +1 more source
The stationary local sojourn time in single server tandem queues with renewal input
International Journal of Stochastic Analysis, Volume 12, Issue 4, Page 417-428, 1999., 1999 We start from an earlier paper evaluating the overall sojourn time to derive the local sojourn time in stationary regime, in a single server tandem queue of (m + 1) stages with renewal input. The successive service times of a customer may or may not be mutually dependent, and are governed by a general distribution which may be different at each sage.
Pierre Le Gall
wiley +1 more source