Two new fair and efficient algorithms for slot reuse in DQDB MANs

Several algorithms for the implementation of the slot reuse function in DQDB MANs are studied through simulation in order to investigate their efficiency and fairness. While it is shown that even, simpler algorithms are capable of achieving quite good performance, the fair distribution of access opportunities among nodes is found to be difficult to obtain. Novel modifications of two existing algorithms are then proposed and shown to provide better performance and fairness than the previous versions.