An Efficient Convolution Algorithm for the Non-Markovian Two-Node Cyclic Network
Consider a closed cyclic queueing model that consists of two nodes and a total of M customers. Each node buffer can accommodate all M customers. Node 1 has N≤M servers, each having an exponential service time with rate λ. The second node consists of a single server with a general service time distri...
Saved in:
Main Authors: | Muhammad El-Taha, Thomas Michaud |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/5550363 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An estimation of efficiency of filtering algorithms of state vector of small-sized observed object with non-Markovian approximation of trajectory
by: B. A. Zaikin, et al.
Published: (2021-08-01) -
Non-Markovian quantum exceptional points
by: Jhen-Dong Lin, et al.
Published: (2025-02-01) -
Consequences of non-Markovian healing processes on epidemic models with recurrent infections on networks
by: José Carlos M Silva, et al.
Published: (2025-01-01) -
An Energy-Efficient Node Selection Algorithm in Bearings-Only Target Tracking Sensor Networks
by: Xiaoxiao Jiang, et al.
Published: (2014-02-01) -
EFFICIENT MALICIOUS NODE DETECTION IN WIRELESS SENSOR NETWORKS USING RABIN-KARP ALGORITHM
by: T Devapriya, et al.
Published: (2024-12-01)