Discrete time analysis of a slotted transmission system
type: Item
instance of: scholarly article
title: Discrete time analysis of a slotted transmission system
zbMATH Open document ID: 0678.60097
DOI: 10.1016/0305-0548(89)90012-9
author: B. van Arem
published in: Computers \& Operations Research
publication date: 1989-01-01T00:00:00Z
full work available at URL: discrete-time-analysis-of-a-slotted-transmission-system(a81fb078-a8cf-4c35-a113-672185193403).html
review text: A synchronized (gated) queueing model is analyzed in order to predict performance of some slotted transmission systems. In the model N sources that alternate between active and passive periods are assumed. The time is slotted, and a packet (i.e., fixed length message) can start transmission only at the beginning of a frame. The number of packets generated in a frame forms a finite, irreducible and aperiodic Markov chain. Motivation and examples of such a chain are also presented in the paper. Finally, to finish the description, in every frame a maximum number of packets R can be transmitted. If a packet cannot be sent in a frame, then it is buffered. The main interest lies in the evaluation of the buffer size. This is done by a standard technique, namely, by establishing the probability generating function of the buffer size in a steady state condition. This generating function, due to the Markovian input, has a form of a matrix equation, which is solved numerically to produce some useful results. Finally, the theoretical results (obtained numerically) are verified by a simulation.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 4111760
zbMATH Keywords: queueing model
zbMATH Keywords: evaluation of the buffer size
zbMATH Keywords: probability generating function
zbMATH Keywords: simulation
Wikidata QID: Q61950313
MaRDI profile type: Publication
OpenAlex ID: W2131343433
cites work: Some remarks on discrete-time buffers with correlated arrivals
cites work: Channels that Cooperatively Service a Data Stream and Voice Messages
cites work: A Fluid Reservoir Regulated by a Birth-Death Process
cites work: Simulating Stable Stochastic Systems: III. Regenerative Processes and Discrete-Event Simulations
cites work: Simulating Stable Stochastic Systems, II: Markov Chains
Recommended article: A discrete model for the efficient analysis of time-varying narrowband communication channels
Recommended article: Discrete equivalent time integration methods for transient analysis
Recommended article: Q4894836
Recommended article: Analysis of steady-state and transient delay in discrete-time single-arrival and batch-arrival systems
Recommended article: Analysis and synthesis of discrete-time systems
Recommended article: Analysis of periodically time-varying discrete-time systems in spectral domain
Recommended article: Discrete Time-Frequency Characterizations of Dispersive Linear Time-Varying Systems
Recommended article: Delay analysis of a discrete-time multiclass slot-bound priority system
Recommended article: Analysis of continuous-time switching networks
description: scientific article; zbMATH DE number 4111760