Queues with marked customers

Qi‐Ming He

119 citations0/0 files storedAdvances in Applied Probability

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Probability and Statistical Research Age of Information Optimization

Abstract

Queueing systems with distinguished arrivals are described on the basis of Markov arrival processes with marked transitions. Customers are distinguished by their types of arrival. Usually, the queues observed by customers of different types are different, especially for queueing systems with bursty arrival processes. We study queueing systems from the points of view of customers of different types. A detailed analysis of the fundamental period, queue lengths and waiting times at the epochs of arrivals is given. The results obtained are the generalizations of the results of the MAP/G/1 queue.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 119 citations exist upstream.

References

1991New results on the single server queue with a batch markovian arrival process 1991Structured Stochastic Matrices of M/G/1 Type and Their Applications.1952The theory of queues with a single server 1983The Single Server Queue 1990A single-server queue with server vacations and a class of non-renewal arrival processes 1983The Single Server Queue.1980The N/G/1 queue and its detailed analysis

Cited by

2010Markovian arrivals in stochastic modelling: a survey and some new results 2017Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks 2012Queueing system MAP|PH|N|N+R with impatient heterogeneous customers as a model of call center 2001Queue Length Distribution in a FIFO Single-Server Queue with Multiple Arrival Streams Having Different Service Time Distributions 2007A perishable inventory system with service facilities, MAP arrivals and PH — Service times 1999The Nonpreemptive Priority MAP/G/1 Queue

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.