Sojourn times in queueing networks

O.J. Boxma, H. Daduna

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

    14 Downloads (Pure)

    Abstract

    From a customer's point of view, the most important performance measure in a queueing network is his sojourn time. This paper presents a survey of sojourn time results in queueing networks. Particular attention is paid to product-form networks, for which exact expressions for the joint distribution of a customer's successive sojourn times along a quasi overtake-free path are discussed. When the non-overtaking condition is violated, or when no product form exists, few analytical results are known. The paper mentions some of these results, as weil as approximation techniques for product-form networks. For networks without product form, the emphasis is put on computational techniques and on some quite general approximation methods which have recently been adapted to the sojourn time problem.
    Original languageEnglish
    Title of host publicationStochastic Analysis of Computer and Communication Systems
    EditorsH. Takagi
    Place of PublicationAmsterdam
    PublisherNorth-Holland Publishing Company
    Pages401-450
    ISBN (Print)0-444-88479-3
    Publication statusPublished - 1990

    Fingerprint

    Dive into the research topics of 'Sojourn times in queueing networks'. Together they form a unique fingerprint.

    Cite this