|Title:||AN EFFICIENT PRIORITY MECHANISM FOR RINGS
|Authors:||R. Cohen and A. Segall
|Abstract:||The paper presents a new scheme for handling priorities in a token ring Local Area Network. The scheme of the IEEE -802.5 standard suffers from two principal drawbacks that are addressed in the present paper: it allows frame multiplication for a limited duration. and in some situations. a long time is required to achieve the desired priority level. This paper describes and proves a new priority mechanism that satisfies all properties of the standard, while effacing the abovementioned drawbacks.|
|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/1990/CS/CS0606), 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 1990
To the main CS technical reports page
Computer science department, Technion