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.
- 1 D, P. Heyman, "Data-transport Performance Analysis of Fasnet," Bell System Technical Journal 62, 8, Oct. 1983, pp. 2547-2560.Google ScholarCross Ref
- 2 A.G. Konheim and B. Meister, "Waiting Lines and Times in a System with Polling," J. ACM 21, 3, July 1974, pp. 470- 490. Google ScholarDigital Library
- 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.Google Scholar
- 4 M. Schwartz, Telecommunications Networks: Protocols, Modeling and Analysis, Addison-Wesley, 1987. Google ScholarDigital Library
- 5 "Token Ring Access Method and Physical Layer Specifications," The Institute of Electrical and Electronics Engineers, Inc., 1985.Google Scholar
Index Terms
- Performance of priorities on an 802.5 token ring
Recommendations
Performance of priorities on an 802.5 token ring
SIGCOMM '87: Proceedings of the ACM workshop on Frontiers in computer communications technologyThe 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 ...
Mixed gated/exhaustive service in a polling model with priorities
In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority customers. At the ...
Comments