An Erasure Node Algorithm for DQDB Networks

DQDB망 소거노드 알고리즘

In this DQDB networks, erasure nodes may be allocated on the bus and release slots which already had been read by destination nodes. An important function of the erasure node must be to eliminate as many requests as erased slots used by downstream nodes. In the networks with priorities, following two additional issues must be solved : (1) accurately to guess for which priority the erased slots is to be used, and (2) to find in a short period a request of that priority to cancel. In this paper, we propose two erasure node algorithms based on elimination of the requests. In these algorithms, the requests are eliminated excessively at low load but optimum elimination can be achieved at full load. Simulation results show that these two algorithms have similar access delay to that of existing algorithms at low load and better performance at high load.