Analysis of a buffer queueing problem in discrete time

From MaRDI portal





The considered queueing model is inspired by the analysis of data communication in slotted ring local area networks. The messages between several stations are broken into fixed-length packets. The author develops the distribution of time-dependent and stationary queue-length in terms of generating functions.











This page was built for publication: Analysis of a buffer queueing problem in discrete time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q917176)