Pseudo-conservation laws in cyclic-service systems with a class of limited service policies

O.J. Boxma and B. Meister, Waiting-time approximations for cyclic-service systems with switch-over times, Perform. Eval. Rev. 14(1986)254–262.

O.J. Boxma and W.P. Groenendijk, Pseudo-conservation laws in cyclic-service systems, J. Appl. Prob. 24(1987)949–964.

K.C. Chang and D. Sandhu, Analysis of anM/G/1 queue with vacations and exhaustive limited service policy, Report 0489, Information and Decision Systems Laboratory, Rensselaer Polytechnic Institute, Troy, NY (July 1989).

K.C. Chang, Performance modeling of token-passing protocols with time-out mechanisms, Doctoral Dissertation, Rensselaer Polytechnic Institute, Troy, NY (1990).

K.C. Chang and D. Sandhu, Mean waiting time approximation for cyclic-service systems with exhaustive limited service policy,Proc. IEEE INFOCOM (1991), pp. 1168–1177; also to appear in Perform. Eval.

D. Everitt, A conservation-type law for the token ring with limited service, Brit. Telecom Tech. J. 4(1986)51–56.

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.

FDDI token ring media access control — ANSI Standard X3.139 (1987).

M.J. Ferguson and Y.J. Aminetzah, Exact results for nonsymmetric token ring systems, IEEE Trans. Commun. COM-33(1985)223–231.

S.W. Fuhrmann. Inequalities for cyclic service systems with limited service disciplines,Proc. GLOBECOM (1987). pp. 182–186.

O. Hashida. A study of multiqueues in communication control. Doctoral Dissertation, University of Tokyo, Tokyo (1981), in Japanese.

IEEE Standard 802.4-1985. Token-passing bus access method and physical layer specifications (1985).

IEEE Standard 802.5-1985. Token-passing ring access method and physical layer specifications (1985).

L. Kleinrock, A conservation law for a wide class of queueing disciplines, Naval Res. Logist. Quart. 12(1965)181–192.

L. Kleinrock,Queueing Systems, Vol. 1: Theory (Wiley, 1975).

P.J. Kuehn, Multiqueue systems with non-exhaustive cyclic service, Bell Syst. Tech. J. 58(1979)671–698.

K.K. Leung, Waiting time distribution for cyclic-service systems with probabilistically-limited service, IEEE J. Sel. Areas Commun. SAC-9(1991)185–193.

D. Sarkar and W.I. Zangwill, Expected waiting time for nonsymmetric cyclic queueing systems — exact results and applications. Manag. Sci. 35(1989)1463–1474.

L.D. Servi and D.D. Yao, Stochastic bounds for queueing systems with limited service schedules, Perform. Eval. 9(1989)247–260.

M.M. Srinivasan, An approximation for mean waiting times in cyclic server systems with non-exhaustive service, Perform. Eval. 9(1988)17–33.

H. Takagi,Analysis of Polling Systems (The MIT Press, Cambridge, MA, 1986).

H. Takagi, Queueing analysis of vacation models. Part I:M/G/1 and Part II:M/G/1 with vacations, Report No. TR87-0032. Tokyo Research Laboratory, Tokyo (1987).

H. Takagi, Queueing analysis of polling models: An update, in:Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (Elsevier Science/North-Holland, Amsterdam, 1990). pp. 267–318.

Tedijanto, Exact results for the cyclic-service queue with a Bernoulli schedule, Perform. Eval. 11(1990)107–115.

K.S. Watson, Performance evaluation of cyclic service strategies — a survey, in:Performance '84, ed. E. Gelenbe (Elsevier Science/North-Holland, Amsterdam, 1984), pp. 521–533.