Deterministic service guarantees in 802.12 networks. II. The cascaded network case

For part I see Hewlett Packard Technical Report HPL-97-147 (1997). Part I studied the problem of allocating resources in shared single hub 802.12 networks. We described the packet scheduling model and defined the admission control conditions which enable the network to provide deterministic service guarantees. In this paper we analyse cascaded (multihub) 802.12 topologies. We derive the relevant network parameters and show that the admission control conditions defined in part I also apply to cascaded topologies when used with these parameters. Experimental results were achieved with a UNIX kernel based implementation in cascaded test networks. These confirm the theoretical results received for network parameters, throughput and end-to-end delay.