Extending the single-node DQDB analytical model to analyze network-wide performance

Abstract

The exact analytical model of DQDB is known to have state space explosion problem which makes its analysis intractable. The approximate single-node analytical model, introduced in a paper by Bisdikian and extended in a paper by Jing and Paterakis, has been proven to be a tractable model capable of providing valuable insight into the DQDB network behavior. In this paper, we show how to further extend the single-node model to approximately evaluate the average message delay of individual nodes for an entire network. We discuss the difficulties involved in applying the single-node model network-wide and approaches to circumvent these difficulties. We present some representative approximate mean message delay results. Finally, with the help of simulations, we study the effect of an analytical approximation— Bernoulli Slot Occupancy—on the mean message delay over DQDB networks.