Letter to the Editor—A Note on the Waiting-Time Distribution for theM/G/1 Queue with Last-Come-First-Served Discipline

Abstract

The waiting-time distribution for an M / G /1 queue with last-come-first-served discipline has a simple structure that may be found from an argument based on the Takács server backlog process. This structure provides real-time information in a convenient form.