Abstract
The pseudo-conservation law for a multi-queue system with non-preemptive priority (local priority) has recently been presented in Fournier and Rosberg [9]. This note points out that the result has independently been derived in Shimogawa and Takahashi [17]. The derivation of a mean waiting time approximation based on the pseudo-conservation law is also discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
O.J. Boxma and W.P. Groenendijk, Pseudo-conservation laws in cyclic-service systems, J. Appl. Prob. 24(1987)949–964.
O.J. Boxma and B. Meister, Waiting-time approximations for cyclic-service systems with switchover times, Perf. Eval. Rev. 14(1986)254–262.
O.J. Boxma, Workloads and waiting times in single-server systems with multiple customer classes, Queueing Systems 5(1989)185–214.
W. Bux and H.L. Truong, Mean-delay approximations for cyclic-service queueing systems, Perf. Eval. 3(1983)187–196.
K. Chang and D. Sandhu, Pseudo-conservation laws in cyclic-server, multiqueue systems with a class of limited service policies,IEEE INFOCOM (1990), pp. 260–267.
D. Everitt, Simple approximations for token rings, IEEE Trans. Commun. COM-34(1986)719–721.
D. Everitt, A note on the pseudo-conservation laws for cyclic service systems with limited service disciplines, IEEE Trans. Commun. COM-37(1989)781–783.
M.J. Ferguson and Y.J. Aminetzah, Exact results for nonsymmetric token ring systems, IEEE Trans. Commun. COM-33(1985)223–231.
L. Fournier and Z. Rosberg, Expected waiting times in polling systems under priority disciplines, Queueing Systems 9(1991)419–440.
Y. Fukagawa, S. Murakami and S. Yoshida, An approximate analysis for a multiqueue with a nonpreemptive priority and cyclic service, Trans. IECE Japan J70-A(1987)1351–1354, in Japanese.
W.P. Groenendijk, Waiting-time approximations for cyclic-service systems with mixed service strategies,Proc. ITC 12, Session 1.4B, Torino (1988).
D. Karvelas and A. Leon-Garcia, Performance of integrated packet voice/data token passing ring, IEEE J. Sel. Areas Commun. SAC-4(1986)823–832.
G. Kimura and Y. Takahashi, An approximation for a token ring system with priority classes of messages, J. Inf. Proc. 10(1987)86–91.
L. Kleinrock,Queueing Systems, Vol. 2 (Wiley, New York, 1976).
P.J. Kuehn, Multi-queue systems with non-exhaustive cyclic service, Bell. Syst. Tech. J. 58(1979) 671–698.
J. Paradells-Aspas and V. Casares-Giner, Token passing system with priorities at node level, Department of Applied Mathematics, University of Barcelona, Barcelona, Spain (1989).
S. Shimogawa and Y. Takahashi, A pseudo-conservation law in a cyclic-service system with priority classes, IEICE Research Report, IN88-86 (1988), pp. 13–18.
H. Takagi,Analysis of Polling Systems (MIT Press, Cambridge, MA, 1986).
K.S. Watson, Performance evaluation of cyclic service strategies — a survey, in:Performance'84, ed. E. Gelenbe (North-Holland, Amsterdam, 1985), pp. 521–533.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shimogawa, S., Takahashi, Y. A note on the pseudo-conservation law for a multi-queue with local priority. Queueing Syst 11, 145–151 (1992). https://doi.org/10.1007/BF01159292
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01159292