Alternative strategies for improving the fairness in an analytical model of DQDB networks
B. Mukherjee, Soumitro Banerjee
Abstract
B. Mukherjee, Soumitro Banerjee
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.>
OpenAlex reports 48 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.>
Key concepts: Distributed-queue dual-bus, Computer science, Computer network, Bandwidth (computing), Queue, Scheme (mathematics), Markov chain, Distributed computing