Waiting time distribution in M/D/1 queueing systems

Villy Bæk Iversen, Lars Staalhagen

    Research output: Contribution to journalJournal articleResearchpeer-review


    The well-known formula for the waiting time distribution of M/D/1 queueing systems is numerically unsuitable when the load is close to 1.0 and/or the results for a large waiting time are required. An algorithm for any load and waiting time is presented, based on the state probabilities of M/D/1. The principles are also applicable for other queueing systems
    Original languageEnglish
    JournalElectronics Letters
    Issue number25
    Pages (from-to)2184-2185
    Publication statusPublished - 1999

    Cite this