.png){kind=icon}
.png){kind=icon}
Return
Comparing approximations in the ASIP tandem queue
.png){kind=icon}
OA
AI
DOI：10.1016/j.peva.2025.102523.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Asymmetric Inclusion Process (ASIP) models unidirectional transport with particle clustering, yet remains analytically intractable for systems beyond small sizes. To address this, we develop two approximation methods: the replica mean-field (RMF) limit, providing a first-order approximation, and the power series algorithm (PSA), a numerical scheme based on traffic intensity expansions. We evaluate these approximations against Monte Carlo simulations for general systems and prior exact results for homogeneous ASIP systems. Both methods yield accurate estimates, with PSA closely matching simulations for both homogeneous and heterogeneous systems, while RMF performing well for early sites but being slightly impacted downstream or as load increases. These approximations offer practical and computationally efficient alternatives to simulation, enabling detailed performance analysis of ASIP tandem queues where exact solutions are unavailable.
Keywords:
Asymmetric Inclusion Process (ASIP)
Replica Mean-Field Limit (RMF)
Power Series Algorithm (PSA)
Sites occupancies distribution
Stochastic networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
0.8
Papers:
38
Citations:
851
Organization
View more organizations