The queueing system considered consist of r. independent arrival channels and s independent service channels. These systems are assumed to be in heavy traffic, that is, the traffic intensity is greater than or equal to 1. Functional laws of the iterated logarithm are obtained for the queue length, departure, load, and waiting time processes. As immediate corollaries, the ordinary laws of the iterated logarithm are obtained for these processes. Finally, as an application of the functional law of the iterated logarithm, a limit theorem is obtained for the fraction of time the queue length process is above a given function. (Author).
This book is dedicated to Jinhua Cao on the occasion of his 80th birthday. Jinhua Cao is one of the most famous reliability theorists. His main contributions include: published over 100 influential scientific papers; published an interesting reliability book in Chinese in 1986, which has greatly influenced the reliability of education, academic research and engineering applications in China; initiated and organized Reliability Professional Society of China (the first part of Operations Research Society of China) since 1981. The high admiration that Professor Cao enjoys in the reliability community all over the world was witnessed by the enthusiastic response of each contributor in this book. The contributors are leading researchers with diverse research perspectives. The research areas of the book iclude a broad range of topics related to reliability models, queueing theory, manufacturing systems, supply chain finance, risk management, Markov decision processes, blockchain and so forth. The book consists of a brief Preface describing the main achievements of Professor Cao; followed by congratulations from Professors Way Kuo and Wei Wayne Li, and by Operations Research Society of China, and Reliability Professional Society of China; and further followed by 25 articles roughly grouped together. Most of the articles are written in a style understandable to a wide audience. This book is useful to anyone interested in recent developments in reliability, network security, system safety, and their stochastic modeling and analysis.
This book constitutes the refereed proceedings of the 18th International Conference on Analytical and Stochastic Modeling Techniques and Applications, ASMTA 2011, held in Venice, Italyin June 2011. The 24 revised full papers presented were carefully reviewed and selected from many submissions.The papers are organized in topical sections on queueing theory, software and computer systems, statistics and inference, telecommunication networks, and performance and performability.
On May 10-12, 1973 a Conference on Mathematical Methods in Graph Theory was held at Western Michigan University in Kalamazoo. The theme of this Conference was recent advances in the application of analytic and algebraic methods to the analysis of queues and queueing networks. In addition some discussion was given to statistical analy ses in queues, control problems and graphical methods. A total of 83 individuals from both industry and academic estab lishments participated in the Conference. A list of these partici pants can be found on page 373. A total of 18 papers were presented, with sUbstantial time being devoted to their informal discussion. This volume constitutes the proceedings of the Conference, and includes all papers presented. TABLE OF CONTENTS MARCEL F. NEUTS The Markov Renewal Branching Process • 1 RALPH L. DISNEY and W. PETER CHERRY Some Topics in Queueing Network Theory 23 JULIAN KEILSON Convexity and Complete Monotonicity in Queueing Distributions and Associated Limit Behavior . • • • • • . . • • • •• • • 45 G. F. NEWELL Graphical Representation of Queue Evolution for Multiple-Server Systems • . • • • • • • • • • • 63 N. U. PRABHU Wiener-Hopf Techniques in Queueing Theory 81 / IAJOS TAKACS Occupation Time Problems in the Theory of Queues 91 TAPAN P. BAGCHI and J. G. C. TEMPLETON Some Finite waiting Space Bulk Queueing Systems 133 U.
Queueing Systems Volume 1: Theory Leonard Kleinrock This book presents and develops methods from queueing theory in sufficient depth so that students and professionals may apply these methods to many modern engineering problems, as well as conduct creative research in the field. It provides a long-needed alternative both to highly mathematical texts and to those which are simplistic or limited in approach. Written in mathematical language, it avoids the "theorem-proof" technique: instead, it guides the reader through a step-by-step, intuitively motivated yet precise development leading to a natural discovery of results. Queueing Systems, Volume I covers material ranging from a refresher on transform and probability theory through the treatment of advanced queueing systems. It is divided into four sections: 1) preliminaries; 2) elementary queueing theory; 3) intermediate queueing theory; and 4) advanced material. Important features of Queueing Systems, Volume 1: Theory include- * techniques of duality, collective marks * queueing networks * complete appendix on z-transforms and Laplace transforms * an entire appendix on probability theory, providing the notation and main results needed throughout the text * definition and use of a new and convenient graphical notation for describing the arrival and departure of customers to a queueing system * a Venn diagram classification of many common stochastic processes 1975 (0 471-49110-1) 417 pp. Fundamentals of Queueing Theory Second Edition Donald Gross and Carl M. Harris This graduated, meticulous look at queueing fundamentals developed from the authors' lecture notes presents all aspects of the methodology-including Simple Markovian birth-death queueing models; advanced Markovian models; networks, series, and cyclic queues; models with general arrival or service patterns; bounds, approximations, and numerical techniques; and simulation-in a style suitable to courses of study of widely varying depth and duration. This Second Edition features new expansions and abridgements which enhance pedagogical use: new material on numerical solution techniques for both steady-state and transient solutions; changes in simulation language and new results in statistical analysis; and more. Complete with a solutions manual, here is a comprehensive, rigorous introduction to the basics of the discipline. 1985 (0 471-89067-7) 640 pp.
Martingale Limit Theory and Its Application discusses the asymptotic properties of martingales, particularly as regards key prototype of probabilistic behavior that has wide applications. The book explains the thesis that martingale theory is central to probability theory, and also examines the relationships between martingales and processes embeddable in or approximated by Brownian motion. The text reviews the martingale convergence theorem, the classical limit theory and analogs, and the martingale limit theorems viewed as the rate of convergence results in the martingale convergence theorem. The book explains the square function inequalities, weak law of large numbers, as well as the strong law of large numbers. The text discusses the reverse martingales, martingale tail sums, the invariance principles in the central limit theorem, and also the law of the iterated logarithm. The book investigates the limit theory for stationary processes via corresponding results for approximating martingales and the estimation of parameters from stochastic processes. The text can be profitably used as a reference for mathematicians, advanced students, and professors of higher mathematics or statistics.
