Abstract
The paper analyzes the performance of a DQDB station with a finite buffer capacity. The authors take a per-node approach to the analysis and make a Bernoulli assumption for the bus outcomes. The model, which is based on a discrete-time Markov chain, is solved by means of EPA (equilibrium point analysis). By utilizing this method, one can calculate the steady-state probabilities of the Markov chain; then, one can evaluate throughput, average bus access delay and average MAC delay. The accuracy of the analytical results are examined through simulation. For light to medium loads, the analytical results show little discrepancy when compared to simulation results. A small discrepancy is found for some stations, and it is explained in part by the correlation between outcomes of consecutive slots, which is not captured in the the model. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
