Stationary deterministic flows: II. The Single-server queue

DOI10.1016/0304-3975(87)90112-5zbMath0635.68027DBLPjournals/tcs/GelenbeF87OpenAlexW1991283595WikidataQ56992504 ScholiaQ56992504MaRDI QIDQ1097690

David Finkel, Erol Gelenbe

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90112-5

zbMATH Keywords

stability conditionsLittle's lawqueueing systemssingle-server queuediscrete state spacebirth-and-death equations

Mathematics Subject Classification ID

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

Related Items (4)

Stationary deterministic flows in discrete systems. I ⋮ Asymptotic time averages and frequency distributions ⋮ Deterministic analysis of queueing systems with heterogeneous servers ⋮ Sample-path analysis of processes with imbedded point processes

Cites Work

• Stationary deterministic flows in discrete systems. I
• Technical Note—A Last Word on L = λW
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stationary deterministic flows: II. The Single-server queue