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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Idle and Busy Period Analysis of Two Class Data Traffic through Queueing Technique

by Syed Asif Ali Shah, Wajiha Shah
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 109 - Number 4
Year of Publication: 2015
Authors: Syed Asif Ali Shah, Wajiha Shah
10.5120/19178-0652

Syed Asif Ali Shah, Wajiha Shah . Idle and Busy Period Analysis of Two Class Data Traffic through Queueing Technique. International Journal of Computer Applications. 109, 4 ( January 2015), 26-28. DOI=10.5120/19178-0652

@article{ 10.5120/19178-0652,
author = { Syed Asif Ali Shah, Wajiha Shah },
title = { Idle and Busy Period Analysis of Two Class Data Traffic through Queueing Technique },
journal = { International Journal of Computer Applications },
issue_date = { January 2015 },
volume = { 109 },
number = { 4 },
month = { January },
year = { 2015 },
issn = { 0975-8887 },
pages = { 26-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume109/number4/19178-0652/ },
doi = { 10.5120/19178-0652 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:43:54.262124+05:30
%A Syed Asif Ali Shah
%A Wajiha Shah
%T Idle and Busy Period Analysis of Two Class Data Traffic through Queueing Technique
%J International Journal of Computer Applications
%@ 0975-8887
%V 109
%N 4
%P 26-28
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Analysis of Idle and busy period of any communication system gives the overall information about system behavior when system is empty and data present in the system. In this paper we use a queueing theory approach to model the system with two class data traffic. we develop and analyze the idle and busy period of two class data traffic through queueing system using Markov chain. We also develop the markov chain for calculating the number of customers served during busy period. The length of busy period is also calculated through the construction of Markov chain. The cumulative distribution function of the busy period for each state is also calculated for the various arrival rates.

References
  1. Latouche, G. , and Ramswami, V. ,. 1993. A logarithmic reduction algorithm for quasi-birth-death processes, J. Appl. Prob. , vol. (30): 650 -674.
  2. Shah, Wajiha. , 2010. Performance Modeling of Queueing Systems using Matrix Geometric Method, Ph. D. Thesis, Faculty of Electrical Engineering and Information Technology, Vienna University of Technology, Wien, Austria, April. .
  3. Asif A. S. S. 2010. Flow Time Analysis of An Early Arrival System Using Discrete time Hypogeometrical Distribution, AMS 2010, Kota Kinabalu, Malaysia.
  4. Bocharov, P. P. 1996. Stationary Distribution of a Finite Queue with Recurrent Flow and Markov Service, Avtom. Telemekh. , Vol. (9): 66–78.
  5. B. Van Houdt and C. Blondia,. 2004. The waiting time distribution of a type k customer in a MAP[K]/PH[K]/c (c=1,2) queue using QBD, Stochastic Models, Vol. 20, pp. 55 -69.
  6. Gupta, U. C. , Samanta, S. K. , and Sharma, R. K. . . 2000. Computing queueing length and waiting time distributions in finite-buffer discrete-time multi-server queues with late and early arrivals, Computers and Mathematics with Applications, vol. (48): 1557- 1573.
  7. Bocharov, P. P. 1996. Stationary Distribution of a Finite Queue with Recurrent Flow and Markov Service, Avtom. Telemekh. , No. 9, 66–78.
  8. Thomas G. Robertazzi. Computer Networks and Systems Queueing Theory and Performance Evaluation. Springer Verlag, New York, 1994.
Index Terms

Computer Science
Information Sciences

Keywords

Idle period busy period two class data traffic queueing system Markov chain

Powered by PhDFocusTM