Discrete-event control of stochastic networks : multimodularity and regularity
Author(s)
Bibliographic Information
Discrete-event control of stochastic networks : multimodularity and regularity
(Lecture notes in mathematics, 1829)
Springer, c2003
- : pbk
Available at / 67 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
: pbk.L/N||LNM||182903065075
-
INTERNATIONAL CHRISTIAN UNIVERSITY LIBRARY図
V.1829410.8/L507/v.182906035042,
: pbk410.8/L507/v.182906035042 -
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
: pbkDC22:003.5/AL792070600440
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. [305]-310) and index
ISSN: 00758434
Description and Table of Contents
Description
Opening new directions in research in both discrete event dynamic systems as well as in stochastic control, this volume focuses on a wide class of control and of optimization problems over sequences of integer numbers. This is a counterpart of convex optimization in the setting of discrete optimization. The theory developed is applied to the control of stochastic discrete-event dynamic systems. Some applications are admission, routing, service allocation and vacation control in queuing networks. Pure and applied mathematicians will enjoy reading the book since it brings together many disciplines in mathematics: combinatorics, stochastic processes, stochastic control and optimization, discrete event dynamic systems, algebra.
Table of Contents
- Preface.- Part I: Theoretical Foundations: Multimodularity, Convexity and Optimization
- Balanced Sequences
- Stochastic Event Graphs.- Part II: Admission and Routing Control: Admission Control in Stochastic Event Graphs
- Applications in Queuing Networks
- Optimal Routing
- Optimal Routing in two Deterministic Queues.- Part III: Several Extensions: Networks with no Buffers
- Vacancies, Service Allocation and Polling
- Monotonicity of Feedback Control.- Part IV: Comparisons: Comparison of Queues with Discrete-time Arrival Processes
- Simplex Convexity
- Orders and Bounds for Multimodular Functions
- Regular Ordering.- References.- Index.
by "Nielsen BookData"