Results 91 to 100 of about 1,330 (109)

Calculating joint queue-length distributions in product-form queuing networks

Journal of the ACM, 1989
A new computational algorithm called distribution analysis by chain (DAC) is developed. This algorithm computes joint queue-length distributions for product-form queuing networks with single-server fixed rate, infinite server, and queue-dependent service centers.
Edmundo de Souza e Silva
exaly   +3 more sources

Stepwise explicit solution for the joint distribution of queue length of a MAP single-server service queueing system with splitting and varying batch size delayed-feedback

International Journal of Mathematics in Operational Research, 2016
Applying truncation, augmentation and tridiagonalisation on infinite block matrices with infinite block matrix elements and duality properties of G/M/1 and M/G/1, and considering two Poisson arrivals as a MAP queueing network, we develop a stepwise algorithm to explicitly compute the joint distribution of the number of tasks in a system (queue length).
Aliakbar Montazer Haghighi, Dimitar P Mishev   +1 more
exaly   +2 more sources

On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach

Transportation Research Part B: Methodological, 2017
Abstract This paper is motivated by recent results in the design of signal plans for Manhattan that highlight the importance of providing signal control algorithms with an analytical description of between-link dependencies. This is particularly important for congested networks prone to the occurrence of spillbacks.
Carolina Osorio, Carter Wang
openaire   +1 more source

The Joint Stationary Multivariate Queue Length Distribution in a Single Server Queueing System with N Queues, Arbitrary Priorities, and a General Probabilistic Inter-Queue Transition Matrix

Management Science, 1973
In modern telephone systems utilizing computers, the realization of a single server feedback queueing system often arises. In this paper, it is assumed that an originating or transferred call to such a system requires a number of different services before leaving the system as a completed or rejected call.
T. K. Wignall, E. G. Enns
openaire   +2 more sources

Joint queue-lengths and sojourn-time distributions in a general preemptive feedback queue

Performance Evaluation, 1996
Summary: A general single-server preemptive queueing model with multiple queues, priorities and feedback is considered, which includes the ordinary preemptive policy and Bernoulli feedback. In the model, there are K queues, jobs arrive according to a Poisson process at every queue, and the service time in every queue is exponential.
openaire   +2 more sources

Joint queue length distribution of multi-class, single server queues with preemptive priorities

2014
In this paper we analyze an $M/M/1$ queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes. The queuing system can be described by a multi-dimensional Markov process, where the coordinates keep track of the number of customers of each class in the system ...
Sleptchenko, A.V., Selen, J., Adan, I.J.B.F., Houtum, van, G.J.J.A.N.   +3 more
openaire   +1 more source

Bounding Queue Length Violation Probability of Joint Channel and Buffer Aware Transmission

2022
Lintao Li, Khaled B Letaief
exaly  

Fuzing license plate recognition data and vehicle trajectory data for lane-based queue length estimation at signalized intersections

Journal of Intelligent Transportation Systems: Technology, Planning, and Operations, 2020
Chaopeng Tan, Hao Wu, Yumin Cao
exaly  

Real-time queue length estimation for congested signalized intersections

Transportation Research Part C: Emerging Technologies, 2009
Henry X Liu, Xinkai Wu, Heng Hu
exaly  

Recursive formulas for the moments of queue length in the BMAP/G/1 queue

IEEE Communications Letters, 2009
Alexander Dudin, Valentina I Klimenok, Moon Ho Lee   +2 more
exaly