Spelling suggestions: "subject:"queuing theory"" "subject:"bqueuing theory""
Construction of preconditioners for queueing networks /Ching, Wai-ki. January 1994 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1994. / Includes bibliographical references (leaves 43-45).
Topics in state dependent queues and queueing networks.Srinivasan, Rengarajan, Carleton University. Dissertation. Mathematics. January 1988 (has links)
Thesis (Ph. D.)--Carleton University, 1988. / Also available in electronic format on the Internet.
Queueing models involving buffersGöbel, F. January 1974 (has links)
Thesis--Amsterdam. / Summary in English and Dutch. Includes bibliographical references (p. 87-88).
Robustness of queueing modelsSherlekar, Virendra Sharad. January 1970 (has links)
Thesis (M.S.)--University of Wisconsin--Madison, 1970. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.
Variance reduction techniques for simulated queuing processesCarson, John S. January 1978 (has links)
Thesis--Wisconsin. / Vita. Includes bibliographical references (leaves 108-110).
Simulation of queuing systemsWolf, Franklin Kreamer. January 1962 (has links)
Thesis (M.S.)--University of Wisconsin--Madison, 1962. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 68-70).
Approximation models and approaches for computing performance measures that arise in single server queueing systemsKumaran, Jayesh. Liefvoort, Appie van de. January 2006 (has links)
Thesis (Ph. D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2006. / "A dissertation in telecommunications networking and computer networking." Advisor: Appie van de Liefvoort. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Jan. 29, 2007. Includes bibliographical references (leaves 108-116). Online version of the print edition.
Departure processes from MAP/PH/1 queuesGreen, David Anthony. January 1999 (has links) (PDF)
Bibliography: leaves 145-150. A MAP/PH/1 queue is a queue having a Markov arrival process (MAP), and a single server with phase-type (PH-type) distributed service time. This thesis considers the departure process of these types of queues, using matrix analytic methods, the Jordan canonical form of matrices, non-linear filtering and approximation techniques.
On-line optimal and adaptive control of a queuing systemYuan, Joseph Sze-Chiang January 1972 (has links)
A number of on-line control methods have been studied for the operational control of a queuing system. Time-series models have been used, in contrast to the probability models usual in the traditional approach to such problems. It is shown that most queuing processes can be formulated as multistage control problems to which modern control theory can be applied. The various control techniques applicable to a queuing system can be divided into two classes: decision and regulator control. In obtaining the control strategies, this thesis draws heavily from dynamic programming, least-squares estimation, the discrete maximum principle and gradient techniques. The uncertainties encountered in the queuing system can be overcome with an adaptive control method. The open-loop-feedback-optimal control technique has been stressed here due to its simplicity. Applications of the methods to various fields have also been studied. Extension of the method to long interval control is immediate in all the cases. Although the optimal control of a queuing system has been discussed, the methods are general enough to be applied to other areas. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate
General case of single channel queuesTan, Thiam Soon January 1969 (has links)
This thesis attempts to evaluate Low's hypothesis that for a single channel, single phase, steady state, infinite queue, the system length depends only on (1) the square of the coefficient of variation of the inter-arrival time distribution, C[formula omitted],(2) the square of the coefficient of variation of the service time distribution, C[formula omitted], and (3) the ratio of mean arrival rate to mean service rate [formula omitted]. In order to support the hypothesis, Low developed a set of curves by using simulation method. However, his simulation model is considered inadequate in representing actual queueing situation. A different simulation model has been employed instead and is used to test the classical queue models as well as the general arbitrary queues. The conclusion has been reached that in spite of the differences between the actual and expected results, the hypothesis is empirically true. Moreover, for any single channel queue with given values of C[formula omitted] and C[formula omitted], the system length L increases exponentially with the utilization factor, regardless of the patterns of arrival and service time distributions. The reader is expected to have a basic knowledge of standard queueing theory and some of its applications. / Business, Sauder School of / Graduate
Page generated in 0.067 seconds