Deterministic service guarantees in IEEE 802.12 networks .I. The single-hub case

We study the problem of allocating resources in single-hub and cascaded 802.12 networks. We show that the use of the 802.12 high-priority access mechanism, when combined with admission control, allows the network to provide small deterministic delay bounds in large cascaded network topologies with potentially many hundreds of hosts. The first part of this work is to analyze relevant 802.12 network performance parameters. In the second part, we describe the scheduling model and define the admission control conditions. Experimental results received with a UNIX kernel-based implementation in a standard 802.12 test network confirm our theoretical results for network parameters, throughput, and delay bounds. In this paper, the single-hub topology is analyzed.