Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T19:38:38.526Z Has data issue: false hasContentIssue false

Queueing with alternating priorities, treated as random walk on the lattice in the plane

Published online by Cambridge University Press:  14 July 2016

Micha Yadin*
Affiliation:
Technion—Israel Institute of Technology and Kansas State University

Extract

The queueing system with alternating priorities has been discussed recently in numerous articles (Maxwell [1], Avi Itzhak, Maxwell, Miller [2], Neuts, Yadin [3], and others). Consider a system which consists of several queueing units. Each unit is independent in the sense that it has its own waiting line which is generated by an independent Poisson stream of customers. However, all of the units are served by a single server who allocates his time between the units.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable