Abstract
Cyclic polling systems are frequently used as models for the performance evaluation of token passing Local Area Networks (LANs) such as Token Ring or Token Bus and High Speed Local Area Networks (HSLANs), e.g., FDDI (Fiber Distributed Data Interface). The model is characterized by Poisson arrival processes, general independent packet service and switchover times and infinite buffer lengths. Frequently, the service disciplines exhaustive service or limited service are considered, because many results for these disciplines are available in the literature [14, 15]. However, they are not always appropriate for modeling the time-limited service disciplines defined in the standards for Token Ring, Token Bus and FDDI.
In this paper, we concentrate on these time-limited service disciplines to which little attention has been payed due to the complexity they impose on the mathematical model. Both the synchronous service discipline (fixed maximum service time) and the asynchronous service discipline (cycle time dependent maximum service time) are considered. Our approach is based on the use of the pseudo-conservation law, for which new approximate expressions for the mean unfinished work left behind by the server in a queue will be derived. With these expressions new pseudo-conservation laws for the weighted sum of the mean waiting times are obtained. They are used to determine the mean waiting times in symmetric systems. With additional assumptions relating the mean waiting times to the second moment of the cycle time solutions for asymmetric systems are obtained. Finally, the results of the analysis are validated by comparison to simulation results.
This work was done while the author was with the Institute of Communications Switching and Data Technics of the University of Stuttgart, Germany. It was supported in part by the NATO under grant CRG 900108.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
O.J. Boxrna, W.P. Groenendijk, “Pseudo-Conservation Laws in Cyclic-Service Systems,” Journal of Applied Probability, Vol. 24, No. 4, Dec. 1987, pp. 949–964.
O.J. Boxma, B.W. Meister, “Waiting-Time Approximations for Cyclic-Service Systems with Switchover Times,” Performance Evaluation, Vol. 7, No. 4, Nov. 1987, pp. 299–308.
D. Everitt, “Simple Approximations for Token Rings,” IEEE Transactions on Communications, Vol. 34, No. 7, July 86, pp. 719–721.
D. Everitt, “A Note on the Pseudoconservation Laws for Cyclic Service Systems with Limited Service Disciplines,” IEEE Transactions on Communications, Vol. 37, No. 3, July 1989, pp. 781–783.
FDDI Token Ring Media Access Control (MAC),ANSI X3.139–1987, ISO 9314–2: 1989.
S.W. Fuhrmaim, “Symmetric Queues Served in Cyclic Order,” Operations Research Letters, Vol. 4, No. 3, Oct. 1985, pp. 139–144.
S.W. Fuhrmann, R.B. Cooper, “Stochastic Decompositions in the M/G/l Queue with Generalized Vacations,” Operations Research, Vol. 33, No. 5, Sept.-Oct. 1985, pp. 1117–1129.
W.P. Groenendijk, Conservation Laws in Polling Systems, Dissertation, Centrum voor Wiskunde en Informatica ( CWI ), Amsterdam, 1989.
D. Karvelas, A. Leon-Garcia, “Performance Analysis of the Medium Access Control Protocol of the FDDI Token Ring Network,” Proc. GLOBECOM 88, Ft. Lauderdale, FL, USA, Nov. 1988, pp. 1119–1123.
D. Karvelas, A. Leon-Garcia, “A General Approach to the Delay Analysis of Symmetric Token Ring Networks,” Proc. INFOCOM 91, Bel Harbour, FL, USA, April 1991, pp. 181–190.
L. Kiemrock, Queueing Systems, Vol. 2: Computer Applications, John Wiley k, Sons, New York, USA, 1976.
P.J. Kühn, “Multiqueue Systems with Nonexhaustive Cyclic Service,” The Bell System Technical Journal, Vol. 58, No. 3, March 1979, pp. 671–698.
R.O. LaMaire, E.M. Spiegel, “FDDI Performance Analysis: Delay Approximations,” Proc. GLOBECOM 90, San Diego, Ca., USA, Dec. 1990, Vol. 3, Paper 903. 1, pp. 1838–1845.
H. Takagi, Analysis of Polling Systems, The MIT Press, Cambridge, Mass., USA, 1986.
H. Takagi, “Queueing Analysis of Polling Models: An Update,” Stochastic Analysis of Computer and Communication Systems, H. Takagi (Ed.), Elsevier Science Publishers B.V. ( North-Holland), Amsterdam, The Netherlands, 1990, pp. 267–318.
M. Tangemann, “A Mean Value Analysis for Throughputs and Waiting Times of the FDDI Timed Token Protocol,” Proc. 13th International Teletraffic Congress, Copenhagen, Denmark, June 1991, pp. 173–179.
M. Tangemann, “Timer Threshold Dimensioning and Overload Control in FDDI Networks,” Proc. INFOCOM 92, Florence, Italy, May 1992, pp. 363–371.
M. Tangemann, Modelling and Analysis of High-Speed Local Area Networks with Time-Limited Token Passing Media Access Protocols, (german), Dissertation, Institut für Nachrichtenverarbeitung und Datenverarbeitung, Universität Stuttgart, 1993.
M. Tangemann, “Mean Waiting Time Approximations for FDDI,” submitted for publication.
Tedijanto, “Exact Results for the Cyclic-Service Queue with a Bernoulli Schedule,” Performance Evaluation, Vol. 11, No. 2, July 1990, pp. 107–115.
Token-Passing Bus Access Method and Physical Layer Specifications, IEEE Std 802.4–1990, ISO/IEC 8802–4: 1990.
Token Ring Access Method and Physical Layer Specifications, IEEE Std 802.5–1989, ISO/IEC DIS 8802–5.2: 1990.
K.S. Watson, “Performance Evaluation of Cyclic Service Strategies - A Survey,” Proc. Performance 84, E. Gelenbe (Ed.), North-Holland, pp. 521–533.
Yue, C.A. Brooks, “Performance of the Timed Token Scheme in MAP,” IEEE Transactions on Communications, Vol. 38, No. 7, July 1990, pp. 1006–1012.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tangemann, M. (1993). Mean Waiting Time Approximations for Symmetric and Asymmetric Polling Systems with Time-Limited Service. In: Walke, B., Spaniol, O. (eds) Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78495-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-78495-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57201-5
Online ISBN: 978-3-642-78495-8
eBook Packages: Springer Book Archive