DocumentCode
3496973
Title
On the approximation of the slot occupancy pattern in a DQDB network
Author
Conti, M. ; Gregori, E. ; Lenzini, L.
Author_Institution
CNR, Istituto CNUCE, Pisa, Italy
fYear
1992
fDate
4-8 May 1992
Firstpage
518
Abstract
The authors present a novel approach to distributed queue dual bus (DQDB) modeling. The innovative aspect lies in the representation of the slot-occupancy-pattern process on the forward bus. In the literature, this process has been modeled as a Bernoulli process, implying that the status (empty/busy) of consecutive slots is independent. Results presented, however, show that even at light loads the interdependence between slots is significant. The model captures some of this interdependence by using a discrete-time first-order Markov process for the slot-occupancy-pattern process on the forward bus. A simplified DQDB network is identified for which a closed formula is derived for the joint probability density function for the slot occupancy pattern of two consecutive slots. The accuracy of the results was investigated with simulation
Keywords
Markov processes; metropolitan area networks; protocols; queueing theory; DQDB network; MAN; approximation; discrete-time first-order Markov process; slot occupancy pattern; Analytical models; Bandwidth; Intelligent networks; Markov processes; Media Access Protocol; Metropolitan area networks; Performance analysis; Probability density function; Telecommunication network topology; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM '92. Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE
Conference_Location
Florence
Print_ISBN
0-7803-0602-3
Type
conf
DOI
10.1109/INFCOM.1992.263544
Filename
263544
Link To Document