A Unified Framework for Transient Analysis in Queueing Networks

View at publisher Summarise with VIRAT
Authors: Taojun Wang, Qing Wang, Jingshan Li
Cited by: 0
References: 24

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This paper presents a unified framework for transient analysis of cascaded M/M/c/K networks with split and merge under multiple service policies, including first-come-first-served (FCFS), priority, percentage, and circulate. A history-buffer mechanism is introduced to preserve temporal arrival composition, enabling propagation of nonstationary departures across interconnected nodes without enlarging the state space. Coupled with time-dependent Kolmogorov forward equations, a stable explicit iteration is developed to compute transient queue-length distributions. Numerical experiments verify that the proposed method can accurately reproduce full transient dynamics across multi-stage networks.

Fields of Study & Subjects

Advanced Queuing Theory Analysis Petri Nets in System Modeling Age of Information Optimization

Publication details

Journal / source
IEEE Robotics and Automation Letters
Volume
11
Issue
5
Pages
6210–6217
Publication date
25 March 2026
Language
EN