| Performance of priorities on an 802.5 token ring |
| Full text |
Pdf
(695 KB)
|
| Source
|
ACM SIGCOMM Computer Communication Review
archive
Volume 17 , Issue 5 (Oct./Nov. 1987)
table of contents
Pages: 58 - 66
Year of Publication: 1987
ISSN:0146-4833
Also published in ...
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 19, Citation Count: 0
|
|
|
ABSTRACT
The IEEE 802.5 token ring allows the user to define multiple message priorities. The priority mechanism is implemented using a reservation scheme whereby packets attempt to reserve the token. We present an analytic model that predicts mean delay for each priority level. We show that operation of the priority mechanism is not free; that is, there is a well-defined cost (measured in terms of increased average message delay) associated with its implementation, and that in general there is minimal discrimination made between the various priority levels. We also show that the cost of the priority mechanism is an easily computable function of various network parameters. One of the circumstances where the priority mechanism results in a large discrimination between priorities is when service is limited to a single packet per received token. We show that single-packet-per-token service is necessary (but not sufficient) to gain maximum benefit from priority operation. Our main conclusion is that the network user will not, in general, receive much benefit from the priority mechanism since the priority mechanism can in fact increase slightly the delay for all priorities. The exception to this statement occurs when the network is operating under fairly extreme conditions which are well defined, and which we believe are unlikely in most installations.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
D, P. Heyman, "Data-transport Performance Analysis of Fasnet," Bell System Technical Journal 62, 8, Oct. 1983, pp. 2547-2560.
|
 |
2
|
|
| |
3
|
J.H. Peden, "Performance Analysis of the IEEE 802.5 Token Ring," Master's Thesis, Department of Computer Science, University of Virginia, Jan. 1987.
|
| |
4
|
|
| |
5
|
"Token Ring Access Method and Physical Layer Specifications," The Institute of Electrical and Electronics Engineers, Inc., 1985.
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|