Efficient isochronous traffic management in DQDB

The PA scheme in the DQDB network is suitable for the constant-rate and connection-oriented transmission. In this study, we propose a periodic assignment scheme, which classifies isochronous connections into several harmonic classes according to their periods. The main advantage of the proposed scheme is that by assigning the same unit channel to connections of the same class, these connections can be established as long as the total required bandwidth is no greater than the available bandwidth of the unit channel. We study three assignment policies based on the harmonic case of the pinwheel algorithm [6, 8]. These assignment policies are evaluated in terms of their blocking probabilities through both simulation and analysis. We found that the Busy-First policy, which tries to assign a new isochronous connection with a unit channel already carrying other connections of the same class, is the most suitable one.