Prioritized demand assignment protocols and their evaluation

Publisher Website
Google Scholar
Abstract
A class of message-based or station-based priority protocols for demand-assignment-based local area networks (LANs), such as Token Bus, HYPERbus, LCN, etc., is defined. It is shown how existing priority protocols can be represented within this class and how they can be extended for a more efficient realization with regard to both delay and capacity of prioritized channel access in LANs. An analytic approach for analyzing multiple-access systems operating under prioritized demand assignment protocols is introduced. The approach permits the modeling of station-dependent and priority-dependent arrival rates and generally distributed transmission times. The introduced finite-population model is especially appropriate for prioritized systems where the number of users per priority class is typically small and users place different service demands on the system. For modeling systems with large populations of users, an approximate model, which is shown to be significantly more computationally efficient than the exact model without imposing additional modeling restrictions, is introduced. >

This publication has 12 references indexed in Scilit: