| Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences 2003 Edition Contributor(s): Baccelli, Francois (Author), Bremaud, Pierre (Author) |
|
 |
ISBN: 3540660887 ISBN-13: 9783540660880 Publisher: Springer OUR PRICE: $104.49 Product Type: Hardcover - Other Formats Published: December 2002 Annotation: The Palm theory and the Loynes theory of stationary systems are the two pillars of the modern approach to queuing. This book, presenting the mathematical foundations of the theory of stationaryqueuing systems, contains a thorough treatment of both of these. This approach helps to clarify the picture, in that it separates the task of obtaining the key system formulas from that of proving convergence to a stationary state and computing its law. The theory is constantly illustrated by classical results and models: Pollaczek-Khintchin and Tacacs formulas, Jackson and Gordon-Newell networks, multiserver queues, blocking queues, loss systems etc., but it also contains recent and significant examples, where the tools developed turn out to be indispensable. Several other mathematical tools which are useful within this approach are also presented, such as the martingale calculus for point processes, or stochastic ordering for stationary recurrences. This thoroughly revised second edition contains substantial additions - in particular, exercises and their solutions - rendering this now classic reference suitable for use as a textbook. |
| Additional Information |
| BISAC Categories: - Mathematics | Probability & Statistics - General - Medical |
| Dewey: 519.82 |
| LCCN: 2002191197 |
| Series: Stochastic Modelling and Applied Probability |
| Physical Information: 0.95" H x 6.34" W x 9.64" (1.40 lbs) 334 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: Queueing theory is a fascinating subject in Applied Probability for two con- tradictory reasons: it sometimes requires the most sophisticated tools of stochastic processes, and it often leads to simple and explicit answers. More- over its interest has been steadily growing since the pioneering work of Erlang in 1917 on the blocking of telephone calls, to the more recent applications on the design of broadband communication networks and on the performance evaluation of computer architectures. All this led to a huge literature, articles and books, at various levels of mathematical rigor. Concerning the mathematical approach, most of the explicit results have been obtained when specific assumptions (Markov, re- newal) are made. The aim of the present book is in no way to give a systematic account of the formulas of queueing theory and their applications, but rather to give a general framework in which these results are best understood and most easily derived. What knowledge of this vast literature is needed to read the book? As the title of the book suggests, we believe that it can be read without prior knowledge of queueing theory at all, although the unifying nature of the proposed framework will of course be more meaningful to readers who already studied the classical Markovian approach. |