A tandem network with a sharing buffer

DOI10.1016/j.apm.2011.03.018zbMath1225.90029OpenAlexW2054745319MaRDI QIDQ646215

Zhaotong Lian, Wen-Hui Zhou

Publication date: 11 November 2011

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2011.03.018

zbMATH Keywords

sojourn timeloss probabilitytandem networkbuffer sharing

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (1)

Equilibrium Strategies and Optimal Control for a Double-Ended Queue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tandem network with MAP inputs
• Performance analysis and buffer allocations in some open assembly systems.
• Operator-geometric stationary distributions for markov chains, with application to queueing models
• The Output Processes of Serial Production Lines of Exponential Machines with Finite Buffers
• Sequential Arrays of Waiting Lines
• A Sequence of Two Servers with No Intermediate Queue
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• An analytical solution for a tandem queue with blocking

This page was built for publication: A tandem network with a sharing buffer