CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

PH/PH/1 Bulk Arrival and Bulk Service Queue

by Ramshankar.r, Rama Ganesan, Ramanarayanan.r
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 109 - Number 3
Year of Publication: 2015
Authors: Ramshankar.r, Rama Ganesan, Ramanarayanan.r
10.5120/19171-0642

Ramshankar.r, Rama Ganesan, Ramanarayanan.r . PH/PH/1 Bulk Arrival and Bulk Service Queue. International Journal of Computer Applications. 109, 3 ( January 2015), 27-33. DOI=10.5120/19171-0642

@article{ 10.5120/19171-0642,
author = { Ramshankar.r, Rama Ganesan, Ramanarayanan.r },
title = { PH/PH/1 Bulk Arrival and Bulk Service Queue },
journal = { International Journal of Computer Applications },
issue_date = { January 2015 },
volume = { 109 },
number = { 3 },
month = { January },
year = { 2015 },
issn = { 0975-8887 },
pages = { 27-33 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume109/number3/19171-0642/ },
doi = { 10.5120/19171-0642 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:43:51.527553+05:30
%A Ramshankar.r
%A Rama Ganesan
%A Ramanarayanan.r
%T PH/PH/1 Bulk Arrival and Bulk Service Queue
%J International Journal of Computer Applications
%@ 0975-8887
%V 109
%N 3
%P 27-33
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper studies two stochastic bulk arrivals and bulk services PH/PH/1 queue Models (A) and (B) with k_(1 ) and k_2 as the number of phases of PH arrival and PH service distributions respectively. The system has infinite storing capacity and the arrival and service sizes are finite valued random variables. Matrix partitioning method is used to study the models. In Model (A) the maximum of the arrival sizes is greater than the maximum of the service sizes and the infinitesimal generator is partitioned as blocks of k_1 k_2 times the maximum of the arrival sizes for analysis. In Model (B) the maximum of the arrival sizes is less than the maximum of the service sizes. The generator is partitioned using blocks of k_1 k_2 times the maximum of the service sizes. Block circulant matrix structure is noticed in the basic system generator. The stationary queue length probabilities, its expected values, its variances and probabilities of empty levels are derived for the two models using matrix geometric methods. Numerical examples are presented for illustration.

References
  1. Aissani. A. and Artalejo. J. R. 1998. On the single server retrial queue subject to break downs, Que. Sys. 30, 309-321.
  2. Ayyappan. G, Muthu Ganapathy Subramanian. A and Gopal Sekar. 2010. M/M/1 retrial queueing system with loss and feedback under pre-emptive priority service, IJCA, 2, N0. 6,-27-34.
  3. D. Bini, G. Latouche, and B. Meini. 2005. Numerical methods for structured Markov chains, Oxford Univ. Press.
  4. Chakravarthy. S. R and Neuts. M. F. 2014. Analysis of a multi-server queueing model with MAP arrivals of special customers,SMPT,-Vol. 43,79-95,
  5. Gaver, D. , Jacobs, P. , Latouche, G, 1984. Finite birth-and-death models in randomly changing environments. AAP. 16,715–731
  6. Latouche. G, and Ramaswami. V, (1998). Introduction to Matrix Analytic Methods in Stochastic Modeling, SIAM. Philadelphia.
  7. Neuts. M. F. 1981. Matrix-Geometric Solutions in Stochastic Models: An algorithmic Approach, The Johns Hopkins Press, Baltimore
  8. Neuts. M. F and Nadarajan. R, 1982. A multi-server queue with thresholds for the acceptance of customers into service, OperationsResearch,Vol. 30,No. 5,948-960.
  9. Noam Paz, and Uri Yechali, 2014 An M/M/1 queue in random environment with disaster, Asia- Pacific Journal of OperationalResearch01/2014;31(30. DOI:101142/S021759591450016X
  10. William J. Stewart, The matrix geometric / analytic methods for structured Markov Chains, N. C State University www. sti. uniurb/events/sfmo7pe/slides/Stewart-2pdf
  11. Rama Ganesan, Ramshankar and Ramanarayanan R, 2014, M/M/1 Bulk Arrival and Bulk Service Queue with Randomly Varying Environment , IOSR-JM, Vol10, Issue. 6 Ver. III(Nov-Dec2014)pp58-66.
Index Terms

Computer Science
Information Sciences

Keywords

Block Sizes Stationary Probability Infinitesimal Generator and Matrix Geometric Approach.

Powered by PhDFocusTM