ANALYSIS OF OPEN DISCRETE-TIME QUEUING-NETWORKS - A REFINED DECOMPOSITION APPROACH

This paper deals with approximate analysis methods for open queueing n etworks. External and internal flows from and to the nodes are charact erized by renewal processes with discrete time distributions of their interarrival times. Stationary distributions of the waiting time, the queue size and the interdeparture times are obtained using efficient d iscrete time algorithms for single server (GI/G/1) and multi-server (G I/D/c) nodes with deterministic service. The network analysis is exten ded to semi-Markovian representations of each how among the nodes, whi ch include parameters of the autocorrelation function.