Hostname: page-component-84b7d79bbc-tsvsl Total loading time: 0 Render date: 2024-07-30T07:50:59.970Z Has data issue: false hasContentIssue false
  • English
  • Français

Sojourn times in vacation and polling systems with Bernoulli feedback

Published online by Cambridge University Press:  14 July 2016

T. Takine ,
H. Takagi  and
T. Hasegawa
T. Takine*
Affiliation:
Kyoto University
H. Takagi*
Affiliation:
IBM Research Division
T. Hasegawa*
Affiliation:
Kyoto University
*
∗Postal address: Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Kyoto 606, Japan.
∗∗Postal address: IBM Tokyo Research Laboratory, 5–9, Sanbancho, Chiyodaku, Tokyo 102, Japan.
∗Postal address: Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Kyoto 606, Japan.
Get access Rights & Permissions [Opens in a new window]

Abstract

We study sojourn times in M/G/1 multiple vacation systems and multiqueue cyclic-service (polling) systems with instantaneous Bernoulli feedback. Three service disciplines, exhaustive, gated, and 1-limited, are considered for both M/G/1 vacation and polling systems. The Laplace-Stieltjes transforms of the sojourn time distributions in the three vacation systems are derived. For polling systems, we provide explicit expressions for the mean sojourn times in symmetric cases. Furthermore a pseudo-conservation law with respect to the mean sojourn times is derived for a polling system with a mixture of the three service disciplines.

Keywords

QUEUESPSEUDO-CONSERVATION LAWS
Type
Research Papers
Information
Journal of Applied Probability , Volume 28 , Issue 2 , June 1991 , pp. 422 - 432
Copyright
Copyright © Applied Probability Trust 1991 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Boxma, O. J. (1989) Workloads and waiting times in single-server systems with multiple customer classes. Queueing Systems 5, 185–214.Google Scholar
Boxma, O. J. and Groenendijk, W. P. (1987) Pseudo-conservation laws in cyclic-service systems. J. Appl. Prob. 24, 949–964.10.2307/3214218Google Scholar
D'Avignon, G. R. and Disney, R. L. (1977) Queues with instantaneous feedback. Management Sci. 24, 168–180.Google Scholar
De Moraes, L. F. M. (1989) Message delay analysis of polling schemes with limited transmission times. Res. Rep. RZ1843, IBM Zurich Res. Lab.Google Scholar
De Moraes, L. F. M. (1990) Comments on ‘Analysis and applications of a multiqueue cyclic service system with feedback’. IEEE Trans. Commun. 38, 148–149.10.1109/26.47846Google Scholar
Disney, R. L. (1981) A note on sojourn times in M/G/1 queues with instantaneous, Bernoulli feedback. Naval Res. Logist. Quart. 28, 679–684.10.1002/nav.3800280415Google Scholar
Disney, R. L., Mcnickle, D. C. and Simon, B. (1980) The M/G/1 queue with instantaneous Bernoulli feedback. Naval Res. Logist. Quart. 27, 635–644.Google Scholar
Disney, R. L., König, D. and Schmidt, V. (1984) Stationary queue-length and waiting-time distributions in single-server feedback queues. Adv. Appl. Prob. 16, 437–446.10.2307/1427078Google Scholar
Doshi, B. T. (1986) Queueing systems with vacations — a survey. Queueing Systems 1, 29–66.10.1007/BF01149327Google Scholar
Doshi, B. T. and Kaufman, J. S. (1988) Sojourn times in an M/G/1 queue. In Queueing Theory and its Applications, Liber Amicorum for J. W. Cohen, ed. Boxma, O. J. and Syski, R., Elsevier, North-Holland, Amsterdam, pp. 207–233.Google Scholar
Fontana, B. and Berzosa, C. D. (1984) Stationary queue-length distribution in an M/G/1 queue with two non-preemptive priorities and general feedback. In Performance of Computer-Communication Systems, ed. Bux, W. and Rudin, H., Elsevier, North-Holland, Amsterdam, pp. 333–347.Google Scholar
Fontana, B. and Berzosa, C. D. (1985) M/G/1 queue with N-priorities and feedback: joint queue-length distributions and response time distribution for any particular sequence. In Teletraffic Issues in an Advanced Information Society. ITC-11, ed. Akiyama, M., Elsevier, North-Holland, Amsterdam, pp. 452–458.Google Scholar
Fuhrmann, S. W. (1985) Symmetric queues served in cyclic order. Operat. Res. Let 4, 139–144.10.1016/0167-6377(85)90019-7Google Scholar
Fuhrmann, S. W. and Cooper, R. B. (1985) Stochastic decompositions in the M/G/1 queue with generalized vacations. Operat. Res. 33, 1117–1129.Google Scholar
Gupta, D. and Buzacott, J. A. (1990) A production system with two job classes, changeover times and revisitation. Queueing Systems 6, 353–368.Google Scholar
Levy, Y. and Yechiali, U. (1975) Utilization of idle time in an M/G/1 queueing system. Management Sci. 22, 202–211.Google Scholar
Sidi, M. and Levy, H. (1989) A queueing network with a single cyclically roving server. Tech. Rep. Technion, Israel.Google Scholar
Simon, B. (1984) Priority queues with feedback. J. Assoc. Comput. Mach. 31, 134–149.10.1145/2422.322420Google Scholar
Takács, L. (1963) A single server queue with feedback. Bell Syst. Tech. J. 42, 505–519.10.1002/j.1538-7305.1963.tb00510.xGoogle Scholar
Takagi, H. (1986) Analysis of Polling Systems. MIT Press, Cambridge, Mass.Google Scholar
Takagi, H. (1987) Analysis and applications of a multiqueue cyclic service system with feedback. IEEE Trans. Commun. 35, 248–250.Google Scholar
Takagi, H. (1988) Queueing analysis of polling models. ACM Comput. Surveys 20, 5–28.Google Scholar
Takagi, H. (1990) Time-dependent analysis of M/G/1 vacation models with exhaustive service. Queueing Systems 6, 369–389.10.1007/BF02411484Google Scholar
Van Den Berg, J. L., Boxma, O. J. and Groenendijk, W. P. (1989) Sojourn times in the M/G/1 queue with deterministic feedback. Stoch. Models 5, 115–129.10.1080/15326348908807101Google Scholar