Ticket circulation protocol: A simple access protocol for dual bus architecture
Information Sciences: an International Journal
Bandwidth allocation for isochronous connections in DQDB using the PA scheme
Computer Communications
Delay analysis of DQDB networks with slot preuse and reuse
Computer Communications
Research: Fairness and efficiency of slot reuse algorithms in DQDB MANS
Computer Communications
Improving the performance of distributed queue dual bus with slot reuse at overload conditions
Computer Communications
| Hi-index | 0.07 |
In dual unidirectional bus networks, packets usually occupy fixed-length slots form the sending station to the end of the network. An erasure node is a specialized station which recognizes packets which have passed their destination stations and releases the slots for subsequent use. The authors derive the optimal locations for erasure nodes and show analytically, for uniform traffic, that only several erasure nodes are needed to achieve throughput close to twice the nominal network bandwidth. The results are tested by simulation of the DQDB (distributed queue dual bus) protocol, which demonstrates a realistic improvement of 40% with only three erasure nodes. Fair access among the stations is improved as well. The authors generalize the analytic results by providing an algorithm for determining the optimal erasure node locations and the throughput improvement, given any arbitrary traffic pattern. The application of this methodology to the related problem of bridged subnetworks is briefly discussed