Abstract:
In a two-node queueing network where $r$ basic entries circulate node 2 receives an additional flow of background entries from the bunker. The service durations of all the entries have phase distributions. A recurrent matrix computation algorithm is proposed for some stationary characteristics of the network performance.