期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2013
卷号：4
期号：1
页码：106-108
语种：English
出版社：Ayushmaan Technologies
摘要：A queue is a waiting line (like customers waiting at a supermarket checkout counter); queueing theory is the mathematical theory of waiting lines. More generally, queueing theory is concerned with the mathematical modeling and analysis of systems that provide service to random demands. A queueing model is an abstract description of such a system. Typically, a queueing model represents.1. The system’s physical configuration, by specifying the number and arrangement of the servers, which provide service to the customers.2. The stochastic (that is, probabilistic or statistical) nature of the demands, by specifying the variability in the arrival process and in the service process.For example, in the context of computer communications, a communications channel might be a server, and the messages the customers; the (random) times at which messages request the use ofthe channel would be the arrival process, and the (random) lengths of service time that the messages hold the channel while being transmitted would constitute the service process. Another example is a computer system where a programmer (customer) sitting at a terminal requests access to a CPU (server) for the processing of a transaction; both the arrival time of the request for access and the amount of processing time requested are random. Then, the mathematical analysis of the models would yield formulas that presumably relate the physical and stochastic parameters to certain performance measures, such as average waiting time, server utilization, throughput, probability of buffer overflow, etc. The art of applied queueing theory is to construct a model that is simple enough so that it yields to mathematical analysis, yet contains sufficient detail so that its performance measures reflect the behavior of the real system.
