A Simple And Quick Approximation Algorithm For Tandem, Split And Merge Queueing Networks With Blocking

DOI10.1080/03155986.1994.11732258MaRDI QIDQ4834080zbMATH OpenOpenAlexFDO

Authors Elias Yannopoulos, Attahiru Sule Alfa

Publication date 23 May 1995

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1994.11732258

zbMATH Keywords

approximation algorithmaverage sojourn timeblockingqueueing networks

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queues and service in operations research (90B22)

Recommendations

• An approximate analysis of open tandem queueing networks with blocking and general service times
• An Approximation Method for Tandem Queues with Blocking
• An approximate analysis of tandem queues with general blocking nodes
• Performance evaluation of closed tandem queueing networks with finite buffers
• General open and closed queueing networks with blocking: a unified framework for approximation

Cited in

(5)

• Higher order approximations for the single server queue with splitting, merging and feedback
• Algorithmic and approzimation analyses of the split and match queue
• A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks
• Examples of Applications of Queueing Theory in Canada
• An approximate analysis of open tandem queueing networks with blocking and general service times

This page was built for publication: A Simple And Quick Approximation Algorithm For Tandem, Split And Merge Queueing Networks With Blocking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834080)