Analysis of the asymmetrical shortest two-server queueing model

DOI10.1155/S1048953398000112zbMath0922.60084MaRDI QIDQ1270299

J. W. Cohen

Publication date: 3 October 1999

Published in: Journal of Applied Mathematics and Stochastic Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/48254

zbMATH Keywords

generating functionsqueue lengthmeromorphic functionsnearest neighbor random walkasymmetrical shortest queue

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (14)

The shorter queue polling model ⋮ Stationary analysis of the shortest queue problem ⋮ Steady-state analysis of shortest expected delay routing ⋮ A finite compensation procedure for a class of two-dimensional random walks ⋮ Harmonic functions for singular quadrant walks ⋮ A 3-queue polling system with join the shortest-serve the longest policy ⋮ Matrix geometric approach for random walks: Stability condition and equilibrium distribution ⋮ Analysis of job assignment with batch arrivals among heterogeneous servers ⋮ Stationary analysis of the shortest queue first service policy ⋮ Analysis of two queues in parallel with jockeying and restricted capacities ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ Transient analysis of two queues in parallel with jockeying ⋮ On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency ⋮ A polling system with `join the shortest -- serve the longest' policy

This page was built for publication: Analysis of the asymmetrical shortest two-server queueing model