EFFECTIVE ERASURE NODE ALGORITHM FOR SLOT REUSE IN DQDB

Citation
Hs. Hassanein et al., EFFECTIVE ERASURE NODE ALGORITHM FOR SLOT REUSE IN DQDB, IEE proceedings. Communications, 141(3), 1994, pp. 196-202
Citations number
13
Categorie Soggetti
Engineering, Eletrical & Electronic
ISSN journal
13502425
Volume
141
Issue
3
Year of publication
1994
Pages
196 - 202
Database
ISI
SICI code
1350-2425(1994)141:3<196:EENAFS>2.0.ZU;2-9
Abstract
The distributed queue dual bus (DQDB) protocol, which has been specifi ed by the IEEE 802.6 as the metropolitan area networks (MANs) standard , has an undesirable feature in that already received (i.e. read) busy slots continue to propagate downstream unnecessarily. The use of spec ial nodes, known as erasure nodes, allows conversion of read slots to empty, so that down-stream nodes may reuse these slots. This should re sult in an increase of the total throughput of the network. The author s introduce and evaluate the performance of an erasure node algorithm. The algorithm keeps track of past activities on both buses to effecti vely balance the slot erasure and the request cancellation functions. It is shown that this algorithm possesses a number of features which m ake it superior to existing algorithms.