Computational schemes for two exponential servers where the first has a finite buffer

DOI10.1051/ro/2011101zbMath1237.60071MaRDI QIDQ3016174

Rita Zlotnikov, Moshe Haviv

Publication date: 14 July 2011

Published in: RAIRO - Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

queueing; scheduling; performance evaluation; queues and service

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Proofs of conjectures on the competition between observable and unobservable servers, The age of the arrival process in the G/M/1 and M/G/1 queues, A push-pull network with infinite supply of work, Pure threshold strategies for a two-node tandem network under partial information, On equilibrium threshold strategies when choosing between observable and unobservable queues, Strategic customer behavior in a two-stage batch processing system

Cites Work

• Unnamed Item
• The age of the arrival process in the G/M/1 and M/G/1 queues
• A push-pull network with infinite supply of work
• Fast algorithms for the characteristic polynomial
• A general class of Markov processes with explicit matrix-geometric solutions
• Spectral properties of the tandem Jackson network, seen as a quasi-birth-and-death process
• Optimal Routing Among ⋅/M/1 Queues with Partial Information
• The Differential Equations of Birth-and-Death Processes, and the Stieltjes Moment Problem
• On the Advantage of Being the First Server