Abstract
This study deals with the distributed queue dual bus (DQDB) (IEEE 802.6) network, and makes two independent contributions. First, the unfairness problem of DQDB is addressed, and several alternative solutions that can improve the network's fairness are proposed. They include (1) the proportional assignment scheme (PR); (2) the (multiple-request) FCFS (first come first served)-message-queue-based DQDB scheme (MD); and (3) a combination of MD and PR, denoted by MP. Implementation methods that require simple hardware in addition to the regular DQDB interface are outlined. The schemes are compared through simulation, and insights into their characteristics are gained. The performance of these schemes is also compared with that of regular DQDB and bandwidth balancing DQDB. The second contribution is the development of an analytical model of the DQDB network. By employing some constrained assumptions for analytical tractability, a Markov chain model for (an earlier version of) the entire DQDB network is formulated. The model is verified via simulation. >
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 call
