Controlled bandwidth DQDB: achieving fairness and maximum throughput in the DQDB network
C.-C. Hwhang, A.-M. Chou
Abstract
C.-C. Hwhang, A.-M. Chou
Abstract
This paper proposes an extension of the Distributed Queue Dual Bus (DQDB) protocol called Controlled Bandwidth (CB) DQDB which satisfies various fairness criteria and achieve 100% channel utilization. The protocol can serve both light and heavy load instances. Under heavy load, the protocol allocates bandwidth to each node, according to the ratio of each nodal arrival rate to the total arrival rate. Under light load, the protocol assigns to each node its required bandwidth. Simulation results show that the CB DQDB protocol has no unfairness problem. CB DQDB converges faster than the famous Bandwidth Balancing.
OpenAlex reports 1 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 paper proposes an extension of the Distributed Queue Dual Bus (DQDB) protocol called Controlled Bandwidth (CB) DQDB which satisfies various fairness criteria and achieve 100% channel utilization. The protocol can serve both light and heavy load instances. Under heavy load, the protocol allocates bandwidth to each node, according to the ratio of each nodal arrival rate to the total arrival rate. Under light load, the protocol assigns to each node its required bandwidth. Simulation results show that the CB DQDB protocol has no unfairness problem. CB DQDB converges faster than the famous Bandwidth Balancing.
Key concepts: Computer network, Distributed-queue dual-bus, Computer science, Bandwidth (computing), Throughput, Node (physics), Queue, Protocol (science)