Abstract
In this paper, we analyse the message waiting times in a local area network (LAN) that uses the demand‐priority access method. This is a priority‐based round‐robin arbitration method where the central controller (the repeater) polls its connected ports to determine which have transmission requests pending and the requests' priority classes. We model it as a 2‐priority M/G/1 queue with multiple server vacations and switchover time between service periods. The service discipline is nonpreemptive and the length of the switchover time is dependent upon the priority class of the preceding message served as well as that of the message to be served next. We provide an approximate analysis for the waiting times of both message classes and derive expressions for the Laplace–Stieltjes transforms (LST) of the stationary distributions and the mean waiting times. We conclude with numerical and simulation results to show the applicability and accuracy of the analytical model.
Similar content being viewed by others
References
A. Albrecht, J. Curcio, D. Dove, S. Goody and M. Spratt, An overview of IEEE 802.12 demand priority, in: Proc. of IEEE Globecom '94 (December 1994) pp. 263-268.
R.W. Conway, W.L. Maxwell and L.W. Miller, Theory of Scheduling (Addison-Wesley, Reading, MA, 1967).
A. Heck, Introduction to Maple (Springer, Berlin, 1993).
IEEE standards for local and Metropolitan area networks: Demand priority access method physical layer and repeater specification for 100 Mb/s operation, IEEE P802.12. (Approved at 6/14/95 Standards Board meeting.)
O. Kella and U. Yechiali, Priorities in M/G/1 queue with server vacations, Naval Research Logistics 35 (1988) 23-34.
Maple V Release 3 (Waterloo Maple Software, Waterloo, Ontario, Canada).
M. Murata and H. Takagi, Mean waiting times in nonpreemptive M/G/1 queues with server switchover times, in: Teletraffic Analysis and Computer Performance Evaluation, eds. O.J. Boxma, J.W. Cohen and H.C. Tijms (North-Holland, Amsterdam, 1986) pp. 395-407.
H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems, Part 1 (North-Holland, Amsterdam, 1991).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Seah, W.K., Takahashi, Y. & Hasegawa, T. Analysis of demand‐priority access using a priority queue with server vacations and message dependent switchover times. Telecommunication Systems 10, 243–268 (1998). https://doi.org/10.1023/A:1019127319114
Issue Date:
DOI: https://doi.org/10.1023/A:1019127319114