|Title:||Prioritized Demand Assignment Protocols and their Evaluation
|Authors:||I. Chlamtac, O. Ganz and. Z. Koren
|Abstract:||We define a class of message or station based priority protocols for demand assignment based LAN's, such as Token Bus , HYPERbus , LCN  etc. We show 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 local area network. We introduce an analytic approach for analyzing multiple access systems operating under prioritized demand assignment protocols. The approach permits the modeling of station 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. As a special case, it can also be used, for analyzing any non-prioritized demand assignment protocol with a general distribution of transmission times which may differ from station to station and traffic intensities which can vary from one station to another. Finally, for modeling systems with large populations of users, we introduce an approximate model which we show to be significantly more computationally efficient than the exact model without imposing additional modeling restrictions.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1986/CS/CS0415), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1986
To the main CS technical reports page
Computer science department, Technion