Sojourn time analysis for a cyclic-service tandem queueing model with general decrementing service
Authors: 
T. Katayama, K. KobayashiAuthors Info & Claims
Pages 131 - 139
Abstract
A sojourn time analysis is provided for a cyclic-service tandem queue with general decrementing service which operates as follows: starting once a service of queue 1 in the first stage, a single server continues serving messages in queue 1 until either queue 1 becomes empty, or the number of messages decreases to k less than that found upon the server's last arrival at queue 1, whichever occurs first, where 1 @? k @? ~. After service completion in queue 1, the server switches over to queue 2 in the second stage and serves all messages in queue 2 until it becomes empty. It is assumed that an arrival stream is Poissonian, message service times at each stage are generally distributed and switch-over times are zero. This paper analyzes joint queue-length distributions and message sojourn time distributions.
References
[1]
High-throughput packet switching system. Review of the Electrical Communications Laboratories, NTT. v34 i6. 689-696.
[2]
Analysis of a finite intermediate waiting room tandem queue attended by a moving server with walking time. Trans. of IECE of Japan. vE-64 i9. 571-578.
[3]
Vacation and Priority Systems. In: Queueing Analysis: A Foundation of Performance Evaluation, Vol. 1. Elsevier Science Publisher B.V., North-Holland.
[4]
A cyclic-service tandem queueing model with semi-exhaustive service. In: Hasegawa, T., Takagi, H., Takahashi, Y. (Eds.), Performance of Distributed and Parallel Systems, North-Holland. pp. 173-183.
[5]
Analysis of dynamic priority queue. Commun. Statist-Stochastic Models. v6 i3. 415-444.
[6]
On the optimal control of two queues with server set-up times and its analysis. SIAM J. Comput. v16 i2. 399-420.
[7]
Open bandit processes and optimal scheduling of queueing networks. Adv. Appl. Prob. v20 i2. 447-472.
[8]
Polling systems: Applications, modeling and optimization. IEEE Trans. on Commun. v38 i10. 1750-1760.
[9]
Semi-Markov analysis of two queues in series attended by a single server. Bull. Soc. Math. Belgique. v22. 355-367.
[10]
Two queues in series attended by a single server. Bull. Soc. Math. Belgique. v25. 160-176.
[11]
Two queues in tandem attended by a single server. Oper. Res. v25 i1. 140-147.
[12]
A single server tandem queue. J. Appl. Prob. v8 i1. 95-109.
[13]
Analysis of a tandem queueing system with gate attended by a moving server. Review of the Electrical Communications Laboratories, NTT. v29 i3/4. 254-267.
[14]
n queues in tandem attended by a single server. Rep. Stat. Appl. Res. JUSE. v26 i1. 14-19.
[15]
Relationships between time/customer stationary characteristics of tandem queues attended by a single server. J. Oper. Res. Soc. Japan. v27 i3. 191-204.
[16]
Mean sojourn times in a multi-stage tandem queue served by a single server. J. Oper. Res. Soc. Japan. v31 i2. 233-250.
[17]
A cyclic-service tandem queueing model with parallel queues in the first stage. Commun. Statist.-Stochastic Models. v4 i3. 421-443.
[18]
Performance analysis and optimization of a cyclic-service tandem queueing system with multi-class customers. Computers Math. Applic. v24 i1/2. 25-34.
[19]
Optimal control in a mass service system with several flows of demands. Engineering Cybernetics. v11 i6. 1029-1044.
[20]
Mean message waiting time in a symmetric polling system. In: Gelenbe, (Ed.), Performance '84, Models of Computer System Performance, North-Holland. pp. 293-302.
[21]
A two-queue model with semi-exhaustive alternating service. In: Courtois, P.-J., Latouche, G. (Eds.), Performance '87, North-Holland. pp. 19-37.
[22]
Introduction to the Theory of Queues. 1962. Oxford University Press, New York.
- Sojourn time analysis for a cyclic-service tandem queueing model with general decrementing service
Recommendations
Sojourn times in polling systems with various service disciplines
We consider a polling system of N queues Q"1,...,Q"N, cyclically visited by a single server. Customers arrive at these queues according to independent Poisson processes, requiring generally distributed service times. When the server visits Q"i, i=1,...,...
Sojourn time distribution in polling systems with processor-sharing policy
We consider a polling system with a single server and multiple queues where customers arrive at the queues according to independent Poisson processes. The server visits and serves the queues in a cyclic order. The service discipline at all queues is ...
A Tandem Queueing model for an appointment-based service system
We develop a queueing model for an appointment-based service system that consists of two queues in tandem: the appointment queue followed by the service queue. Customers join the appointment queue when they call for appointments, stay there (not ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © © 1995.
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Published: 01 November 1995
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025