Skip to main content
SpringerLink
Log in

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

  • Section III Polling Systems
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper considers a cyclic-service system with a class of limited service policies that consists of exhaustive limited, gated limited and general decrementing policies. Under these policies, the number of customers served consecutively during a server visit is limited by a vector of integers. The major results in this paper are derivations of expected amount of work left in the queues at the server departures for these three policies. Exact expressions of weighted sum of mean waiting times, known as pseudo-conservation laws, are subsequently obtained. The conservation laws for this class of policies contain unknown boundary probabilities. We estimate these probabilities using corresponding server vacation models. Numerical results presented for the exhaustive limited policy are noted to be very accurate compared with simulation results. Moreover, we have obtained analytical bounds for the weighted sums. Finally, we present a conservation law with mixed service policies, and mean waiting times for symmetric systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

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

    Google Scholar 

  3. 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).

    Google Scholar 

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

    Google Scholar 

  5. 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.

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

    Google Scholar 

  7. D. Everitt, Simple approximations for token rings, IEEE Trans. Commun. COM-34(1986)719–721.

    Google Scholar 

  8. 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.

    Google Scholar 

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

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

    Google Scholar 

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

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

    Google Scholar 

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

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

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

    Google Scholar 

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

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  23. 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).

    Google Scholar 

  24. 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.

    Google Scholar 

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

    Google Scholar 

  26. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research Division, Thomas J. Watson Research Center, 10598, Yorktown Heights, NY, USA

    Kow C. Chang

  2. Electrical, Computer, and Systems Engineering Department, Rensselaer Polytechnic Institute, 12180, Troy, NY, USA

    Deniz Sandhu

Authors
  1. Kow C. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deniz Sandhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was completed while the author was in the Ph.D. program at Rensselaer Polytechnic Institute.

This work was partially supported by the Center for Advanced Technologies of the New York State.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, K.C., Sandhu, D. Pseudo-conservation laws in cyclic-service systems with a class of limited service policies. Ann Oper Res 35, 209–229 (1992). https://doi.org/10.1007/BF02188705

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02188705

Keywords

Search

Navigation