Author: Soeren Asmussen Publisher: Springer Science & Business Media ISBN: 0387215255 Category : Mathematics Languages : en Pages : 438
Book Description
"This book is a highly recommendable survey of mathematical tools and results in applied probability with special emphasis on queueing theory....The second edition at hand is a thoroughly updated and considerably expended version of the first edition.... This book and the way the various topics are balanced are a welcome addition to the literature. It is an indispensable source of information for both advanced graduate students and researchers." --MATHEMATICAL REVIEWS
Author: Soren Asmussen Publisher: ISBN: Category : Mathematics Languages : en Pages : 336
Book Description
As well as combining a general account of applied probability and stochastic processes with a more specialized treatment of queueing theory, this book provides thorough coverage of the general tools of applied probability, such as Markov chains, renewal theory and regenerative processes.
Author: Philippe Robert Publisher: Springer Science & Business Media ISBN: 3662130521 Category : Mathematics Languages : en Pages : 406
Book Description
Queues and stochastic networks are analyzed in this book with purely probabilistic methods. The purpose of these lectures is to show that general results from Markov processes, martingales or ergodic theory can be used directly to study the corresponding stochastic processes. Recent developments have shown that, instead of having ad-hoc methods, a better understanding of fundamental results on stochastic processes is crucial to study the complex behavior of stochastic networks. In this book, various aspects of these stochastic models are investigated in depth in an elementary way: Existence of equilibrium, characterization of stationary regimes, transient behaviors (rare events, hitting times) and critical regimes, etc. A simple presentation of stationary point processes and Palm measures is given. Scaling methods and functional limit theorems are a major theme of this book. In particular, a complete chapter is devoted to fluid limits of Markov processes.
Author: Narahari U. Prabhu Publisher: Springer Science & Business Media ISBN: 1468401130 Category : Mathematics Languages : en Pages : 148
Book Description
This book is based on a course I have taught at Cornell University since 1965. The primary topic of this course was queueing theory, but related topics such as inventories, insurance risk, and dams were also included. As a text I used my earlier book, Queues and Inventories (John Wiley, New York, 1965). Over the years the emphasis in this course shifted from detailed analysis of probability models to the study of stochastic processes that arise from them, and the subtitle of the text, "A Study of Their Basic Stochastic Processes," became a more appropriate description of the course. My own research into the fluctuation theory for U:vy processes provided a new perspective on the topics discussed, and enabled me to reorganize the material. The lecture notes used for the course went through several versions, and the final version became this book. A detailed description of my approach will be found in the Introduction. I have not attempted to give credit to authors of individual results. Readers interested in the historical literature should consult the Selected Bibliography given at the end of the Introduction. The original work in this area is presented here with simpler proofs that make full use of the special features of the underlying stochastic processes. The same approach makes it possible to provide several new results. Thanks are due to Kathy King for her excellent typing of the manuscript.
Author: R. Szekli Publisher: Springer Science & Business Media ISBN: 1461225280 Category : Mathematics Languages : en Pages : 204
Book Description
This book is an introductionary course in stochastic ordering and dependence in the field of applied probability for readers with some background in mathematics. It is based on lectures and senlinars I have been giving for students at Mathematical Institute of Wroclaw University, and on a graduate course a.t Industrial Engineering Department of Texas A&M University, College Station, and addressed to a reader willing to use for example Lebesgue measure, conditional expectations with respect to sigma fields, martingales, or compensators as a common language in this field. In Chapter 1 a selection of one dimensional orderings is presented together with applications in the theory of queues, some parts of this selection are based on the recent literature (not older than five years). In Chapter 2 the material is centered around the strong stochastic ordering in many dimen sional spaces and functional spaces. Necessary facts about conditioning, Markov processes an"d point processes are introduced together with some classical results such as the product formula and Poissonian departure theorem for Jackson networks, or monotonicity results for some re newal processes, then results on stochastic ordering of networks, re~~ment policies and single server queues connected with Markov renewal processes are given. Chapter 3 is devoted to dependence and relations between dependence and ordering, exem plified by results on queueing networks and point processes among others.
Author: Richard Martin Feldman Publisher: Brooks/Cole ISBN: Category : Mathematics Languages : en Pages : 328
Book Description
In this book, Feldman and Valdez-Flores present applied probability and stochastic processes in an elementary but mathematically precise manner, with numerous examples and exercises to illustrate the range of engineering and science applications for the concepts. The book is designed to give the reader an intuitive understanding of probabilistic reasoning, in addition to an understanding of mathematical concepts and principles. Unique features of the book include a self-contained chapter on simulation (Chapter 3) and early introduction of Markov chains.
Author: Richard M. Feldman Publisher: Springer Science & Business Media ISBN: 3642051588 Category : Technology & Engineering Languages : en Pages : 397
Book Description
This book is a result of teaching stochastic processes to junior and senior undergr- uates and beginning graduate students over many years. In teaching such a course, we have realized a need to furnish students with material that gives a mathematical presentation while at the same time providing proper foundations to allow students to build an intuitive feel for probabilistic reasoning. We have tried to maintain a b- ance in presenting advanced but understandable material that sparks an interest and challenges students, without the discouragement that often comes as a consequence of not understanding the material. Our intent in this text is to develop stochastic p- cesses in an elementary but mathematically precise style and to provide suf?cient examples and homework exercises that will permit students to understand the range of application areas for stochastic processes. We also practice active learning in the classroom. In other words, we believe that the traditional practice of lecturing continuously for 50 to 75 minutes is not a very effective method for teaching. Students should somehow engage in the subject m- ter during the teaching session. One effective method for active learning is, after at most 20 minutes of lecture, to assign a small example problem for the students to work and one important tool that the instructor can utilize is the computer. So- times we are fortunate to lecture students in a classroom containing computers with a spreadsheet program, usually Microsoft’s Excel.
Author: Attahiru Alfa Publisher: Springer ISBN: 1493934201 Category : Technology & Engineering Languages : en Pages : 383
Book Description
This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are included.
Author: William J. Stewart Publisher: Princeton University Press ISBN: 1400832810 Category : Mathematics Languages : en Pages : 777
Book Description
Probability, Markov Chains, Queues, and Simulation provides a modern and authoritative treatment of the mathematical processes that underlie performance modeling. The detailed explanations of mathematical derivations and numerous illustrative examples make this textbook readily accessible to graduate and advanced undergraduate students taking courses in which stochastic processes play a fundamental role. The textbook is relevant to a wide variety of fields, including computer science, engineering, operations research, statistics, and mathematics. The textbook looks at the fundamentals of probability theory, from the basic concepts of set-based probability, through probability distributions, to bounds, limit theorems, and the laws of large numbers. Discrete and continuous-time Markov chains are analyzed from a theoretical and computational point of view. Topics include the Chapman-Kolmogorov equations; irreducibility; the potential, fundamental, and reachability matrices; random walk problems; reversibility; renewal processes; and the numerical computation of stationary and transient distributions. The M/M/1 queue and its extensions to more general birth-death processes are analyzed in detail, as are queues with phase-type arrival and service processes. The M/G/1 and G/M/1 queues are solved using embedded Markov chains; the busy period, residual service time, and priority scheduling are treated. Open and closed queueing networks are analyzed. The final part of the book addresses the mathematical basis of simulation. Each chapter of the textbook concludes with an extensive set of exercises. An instructor's solution manual, in which all exercises are completely worked out, is also available (to professors only). Numerous examples illuminate the mathematical theories Carefully detailed explanations of mathematical derivations guarantee a valuable pedagogical approach Each chapter concludes with an extensive set of exercises
Author: Soeren Asmussen
Author: Soren Asmussen
Author: Philippe Robert
Author: Narahari U. Prabhu
Author: R. Szekli
Author: Richard Martin Feldman
Author: Ralph L. Disney
Author: Richard M. Feldman
Author: Attahiru Alfa
Author: William J. Stewart