On Slot Allocation for Time-Constrained Messages in Dual-Bus Networks
IEEE Transactions on Computers
Batch Coloring Flat Graphs and Thin
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Max-coloring paths: tight bounds and extensions
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
DQDB is a MAC protocol jointly adopted by IEEE and ANSI as the candidate protocol for MANs, and has been studied by many researchers. Previously, we laid a formal basis for guaranteeing the timely delivery of isochronous (real-time) messages with hard deadlines, and devised a slot allocation scheme for allocating pre-arbitrated (PA) slots to isochronous message streams in DQDB networks. In this paper, we extend our work and address on how to improve the performance (in terms of bandwidth utilization) of the slot allocation scheme using the concept of slot reuse. We devise several slot reuse schemes to assign spatially non-intersecting message streams to the same virtual connections (i.e., the sets of PA slots identified by the same VCI numbers). The proposed slot reuse schemes are simple, can be easily incorporated into the slot allocation scheme described previously, and require only a minor change in the current DQDB standards.