Simulation output analysis for local area computer networks
A local area network model has for many access protocols the property that the underlying stochastic process is not a Markov chain with a countable state space. But if this process is a generalized semi-Markov process means have been reported in the literature how point estimates with asymptotic confidence intervals for the throughput characteristics can be obtained. This paper provides similar means for the estimation of delay characteristics, i.e., access times, which can be represented as passage times in generalized semi-Markov processes. A geometric trials criterion for recurrence is used to establish the regenerative process of passage times which is used for the estimation procedures. Simulation results are given for delays in a token and a slotted ring with four stations.
- Estimation Methods for Delays in Non-regenerative Discrete-Event Systems
- scientific article; zbMATH DE number 610385
- scientific article; zbMATH DE number 4046838
- Estimation methods for passage times using one-dependent cycles
- Modeling local area computer networks with consideration for time probabilistic characteristics
- The efficiency of variance reduction in manufacturing and service systems: the comparison of the control variates and stratified sampling
- Estimation methods for passage times using one-dependent cycles
- scientific article; zbMATH DE number 610385 (Why is no real title available?)
- Estimation Methods for Delays in Non-regenerative Discrete-Event Systems
- On transience and recurrence in irreducible finite-state stochastic systems
- scientific article; zbMATH DE number 4187083 (Why is no real title available?)
This page was built for publication: Simulation output analysis for local area computer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761938)