International Research journal of Management Science and Technology

  ISSN 2250 - 1959 (online) ISSN 2348 - 9367 (Print) New DOI : 10.32804/IRJMST

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 57    Submit Your Rating     Cite This   Download        Certificate

MATHEMATICAL STUDY OF BUSY PERIOD PROCESS IN DISCREATE QUEUEING SYSTEMS

    1 Author(s):  VIRENDRA KUMAR

Vol -  9, Issue- 9 ,         Page(s) : 154 - 157  (2018 ) DOI : https://doi.org/10.32804/IRJMST

Abstract

In the present paper we shall consider a process of queue size starting with L(0) (>0) packets in the system at the beginning of the first slot until it becomes zero, the that is, a busy period process. Let L(n) be the queue size immediately after the nth slot. where n = 1,2.. Let  be the number of packets served before the system becomes empty

1. Konheim. A.G. and Meister, B. 1974. Waiting lines and times in a system with polling. Journal of the Association for Computing macinery: Vol.21, No. 3. (July), ppA70-490.
2. Takagi. H. 1986. Analysis of Polling Systems. The MIT Press, Cambridge, Massachusetts. 
3. Kobayashi. H 1978. Modeling and Analysis : An introduction to system performance evaluation methodology. Addison Wesley Publishing Company, Reading Massachusetts. ISBN : 0-201-14457-3 

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details