Performance evaluation of closed tandem queueing networks with finite buffers

DOI10.1016/0166-5316(95)00022-4MaRDI QIDQ3122373zbMATH OpenOpenAlexWikidataFDO

Authors Abdellatif Bouhchouch, Yannick Frein, Yves Dallery

Publication date 27 February 1997

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(95)00022-4

zbMATH Keywords

Approximate analysisBlocking after serviceClosed tandem queueing networksDecompositionFinite buffersGeneral service times

Mathematics Subject Classification ID

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

Recommendations

• An approximate analysis of open tandem queueing networks with blocking and general service times
• An Approximation Method for Tandem Queues with Blocking
• Performance analysis of multi-server tandem queues with finite buffers and blocking
• An approximate analysis of tandem queues with general blocking nodes
• An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking

Cited in

(17)

• Closed-form expected queueing times of a tandem system with finite intermediate buffer: A recursive approach
• Analysis of an open tandem queueing network with population constraint and constant service times
• Approximate techniques for general closed queueing networks with subnetworks having population constraints
• A decomposition approximation for finite-buffered flow lines of exponential queues
• Performance evaluation of open queueing networks with arbitrary configuration and finite buffers
• Throughput estimation in cyclic queueing networks with blocking
• scientific article; zbMATH DE number 2088471 (Why is no real title available?)
• Mean waiting time approximation of tandem queueing systems based on performance ratio
• Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation
• A Variable Buffer-Size Model and Its Use in Analyzing Closed Queueing Networks with Blocking
• An Approximation Method for Tandem Queues with Blocking
• Approximate analysis of single-server tandem queues with finite buffers
• Tandem Behaviour of a Telecommunication System with Repeated Calls: A Markovian Case with Buffers
• A Simple And Quick Approximation Algorithm For Tandem, Split And Merge Queueing Networks With Blocking
• PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS
• Loss tandem networks with blocking -- a semi-Markov approach
• An approximate analysis of open tandem queueing networks with blocking and general service times

This page was built for publication: Performance evaluation of closed tandem queueing networks with finite buffers

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