DQDB modeling: problem complexity reduction and solution via Markov chains
Proceedings of the IFIP WG 7.3 International Conference on Performance of Distributed Systems and Integrated Communication Networks
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
| Hi-index | 0.00 |
This paper analyzes how the BWB mechanism influences the status of slots traveling on the bus (slot-occupancy-pattern process) in a DQDB network. To capture the most important dependencies between consecutive slots at light-moderate load [CONTI91c] we have modeled the slot-occupancy-pattern process via a discrete-time first-order Markov process. In this paper we use a simplified DQDB network [CONTI91b] for which we derive a closed formula for the joint probability density function for the slot-occupancy-pattern of two consecutive slots. Our formulas are used to show the relationship between load, network configuration, BWB value and the slot-occupancy-pattern process.