Hardcover ISBN: | 978-0-8218-3306-3 |
Product Code: | TRANS2/207 |
List Price: | $175.00 |
MAA Member Price: | $157.50 |
AMS Member Price: | $140.00 |
eBook ISBN: | 978-1-4704-3418-2 |
Product Code: | TRANS2/207.E |
List Price: | $165.00 |
MAA Member Price: | $148.50 |
AMS Member Price: | $132.00 |
Hardcover ISBN: | 978-0-8218-3306-3 |
eBook: ISBN: | 978-1-4704-3418-2 |
Product Code: | TRANS2/207.B |
List Price: | $340.00 $257.50 |
MAA Member Price: | $306.00 $231.75 |
AMS Member Price: | $272.00 $206.00 |
Hardcover ISBN: | 978-0-8218-3306-3 |
Product Code: | TRANS2/207 |
List Price: | $175.00 |
MAA Member Price: | $157.50 |
AMS Member Price: | $140.00 |
eBook ISBN: | 978-1-4704-3418-2 |
Product Code: | TRANS2/207.E |
List Price: | $165.00 |
MAA Member Price: | $148.50 |
AMS Member Price: | $132.00 |
Hardcover ISBN: | 978-0-8218-3306-3 |
eBook ISBN: | 978-1-4704-3418-2 |
Product Code: | TRANS2/207.B |
List Price: | $340.00 $257.50 |
MAA Member Price: | $306.00 $231.75 |
AMS Member Price: | $272.00 $206.00 |
-
Book DetailsAmerican Mathematical Society Translations - Series 2Advances in the Mathematical SciencesVolume: 207; 2002; 217 ppMSC: Primary 60
This volume is dedicated to F. I. Karpelevich, an outstanding Russian mathematician who made important contributions to applied probability theory. The book contains original papers focusing on several areas of applied probability and its uses in modern industrial processes, telecommunications, computing, mathematical economics, and finance.
It opens with a review of Karpelevich's contributions to applied probability theory and includes a bibliography of his works. Other articles discuss queueing network theory, in particular, in heavy traffic approximation (fluid models).
The book is suitable for graduate students, theoretical and applied probabilists, computer scientists, and engineers.
ReadershipGraduate students, theoretical and applied probabilists, computer scientists, and engineers.
-
Table of Contents
-
Chapters
-
A. Ya. Kreinin and Y. Suhov — Karpelevich’s contribution to applied probability
-
O. J. Boxma, S. Schlegel and U. Yechiali — A note on an $M/G/1$ queue with a waiting server, timer, and vacations
-
S. Foss and S. Zachary — Asymptotics for the maximum of a modulated random walk with heavy-tailed increments
-
J. M. Harrison — Stochastic networks and activity analysis
-
V. Kalashnikov — Stability bounds for queueing models in terms of weighted metrics
-
F. I. Karpelevich, V. A. Malyshev, A. I. Petrov, S. A. Pirogov and A. N. Rybko — Context-free evolution of words
-
M. Kelbert, S. Rachev and Y. Suhov — The maximum of a tree-indexed random process, with applications
-
J. Martin — Stochastic bounds for fast Jackson networks
-
M. Menshikov and D. Petritis — Markov chains in a wedge with excitable boundaries
-
M. Mitzenmacher and B. Vöcking — Selecting the shortest of two queues, improved
-
A. N. Rybko, A. L. Stolyar and Y. M. Suhov — Stability of global LIFO networks
-
S. Shakkottai and A. L. Stolyar — Scheduling for multiple flows sharing a time-varying channel: The exponential rule
-
M. G. Shur — New ratio limit theorems for Markov chains
-
E. J. Thomas — Stability of patchwork-JSQ feedback networks
-
-
RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
This volume is dedicated to F. I. Karpelevich, an outstanding Russian mathematician who made important contributions to applied probability theory. The book contains original papers focusing on several areas of applied probability and its uses in modern industrial processes, telecommunications, computing, mathematical economics, and finance.
It opens with a review of Karpelevich's contributions to applied probability theory and includes a bibliography of his works. Other articles discuss queueing network theory, in particular, in heavy traffic approximation (fluid models).
The book is suitable for graduate students, theoretical and applied probabilists, computer scientists, and engineers.
Graduate students, theoretical and applied probabilists, computer scientists, and engineers.
-
Chapters
-
A. Ya. Kreinin and Y. Suhov — Karpelevich’s contribution to applied probability
-
O. J. Boxma, S. Schlegel and U. Yechiali — A note on an $M/G/1$ queue with a waiting server, timer, and vacations
-
S. Foss and S. Zachary — Asymptotics for the maximum of a modulated random walk with heavy-tailed increments
-
J. M. Harrison — Stochastic networks and activity analysis
-
V. Kalashnikov — Stability bounds for queueing models in terms of weighted metrics
-
F. I. Karpelevich, V. A. Malyshev, A. I. Petrov, S. A. Pirogov and A. N. Rybko — Context-free evolution of words
-
M. Kelbert, S. Rachev and Y. Suhov — The maximum of a tree-indexed random process, with applications
-
J. Martin — Stochastic bounds for fast Jackson networks
-
M. Menshikov and D. Petritis — Markov chains in a wedge with excitable boundaries
-
M. Mitzenmacher and B. Vöcking — Selecting the shortest of two queues, improved
-
A. N. Rybko, A. L. Stolyar and Y. M. Suhov — Stability of global LIFO networks
-
S. Shakkottai and A. L. Stolyar — Scheduling for multiple flows sharing a time-varying channel: The exponential rule
-
M. G. Shur — New ratio limit theorems for Markov chains
-
E. J. Thomas — Stability of patchwork-JSQ feedback networks