Scheduling and Control of Queueing Networks

Scheduling and Control of Queueing Networks PDF Author: Gideon Weiss
Publisher: Cambridge University Press
ISBN: 1108245773
Category : Mathematics
Languages : en
Pages : 448

Book Description
Applications of queueing network models have multiplied in the last generation, including scheduling of large manufacturing systems, control of patient flow in health systems, load balancing in cloud computing, and matching in ride sharing. These problems are too large and complex for exact solution, but their scale allows approximation. This book is the first comprehensive treatment of fluid scaling, diffusion scaling, and many-server scaling in a single text presented at a level suitable for graduate students. Fluid scaling is used to verify stability, in particular treating max weight policies, and to study optimal control of transient queueing networks. Diffusion scaling is used to control systems in balanced heavy traffic, by solving for optimal scheduling, admission control, and routing in Brownian networks. Many-server scaling is studied in the quality and efficiency driven Halfin–Whitt regime and applied to load balancing in the supermarket model and to bipartite matching in ride-sharing applications.

Fundamentals of Queueing Networks

Fundamentals of Queueing Networks PDF Author: Hong Chen
Publisher: Springer Science & Business Media
ISBN: 1475753012
Category : Mathematics
Languages : en
Pages : 407

Book Description
This accessible book aims to collect in a single volume the essentials of stochastic networks. Stochastic networks have become widely used as a basic model of many physical systems in a diverse range of fields. Written by leading authors in the field, this book is meant to be used as a reference or supplementary reading by practitioners in operations research, computer systems, communications networks, production planning, and logistics.

Scheduling and Control of Queueing Networks

Scheduling and Control of Queueing Networks PDF Author: Gideon Weiss
Publisher: Cambridge University Press
ISBN: 1108415326
Category : Business & Economics
Languages : en
Pages : 447

Book Description
A graduate text on theory and methods using applied probability techniques for scheduling service, manufacturing, and information networks.

Stochastic Networks

Stochastic Networks PDF Author: Frank Kelly
Publisher: Cambridge University Press
ISBN: 1107035775
Category : Computers
Languages : en
Pages : 233

Book Description
A compact, highly-motivated introduction to some of the stochastic models found useful in the study of communications networks.

Control Techniques for Complex Networks

Control Techniques for Complex Networks PDF Author: Sean Meyn
Publisher: Cambridge University Press
ISBN: 0521884411
Category : Mathematics
Languages : en
Pages : 33

Book Description
From foundations to state-of-the-art; the tools and philosophy you need to build network models.

Stochastic Network Optimization with Application to Communication and Queueing Systems

Stochastic Network Optimization with Application to Communication and Queueing Systems PDF Author: Michael Neely
Publisher: Springer Nature
ISBN: 303179995X
Category : Computers
Languages : en
Pages : 199

Book Description
This text presents a modern theory of analysis, control, and optimization for dynamic networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are developed and shown to enable constrained optimization of time averages in general stochastic systems. The focus is on communication and queueing systems, including wireless networks with time-varying channels, mobility, and randomly arriving traffic. A simple drift-plus-penalty framework is used to optimize time averages such as throughput, throughput-utility, power, and distortion. Explicit performance-delay tradeoffs are provided to illustrate the cost of approaching optimality. This theory is also applicable to problems in operations research and economics, where energy-efficient and profit-maximizing decisions must be made without knowing the future. Topics in the text include the following: - Queue stability theory - Backpressure, max-weight, and virtual queue methods - Primal-dual methods for non-convex stochastic utility maximization - Universal scheduling theory for arbitrary sample paths - Approximate and randomized scheduling theory - Optimization of renewal systems and Markov decision systems Detailed examples and numerous problem set questions are provided to reinforce the main concepts. Table of Contents: Introduction / Introduction to Queues / Dynamic Scheduling Example / Optimizing Time Averages / Optimizing Functions of Time Averages / Approximate Scheduling / Optimization of Renewal Systems / Conclusions

Scheduling and Congestion Control for Wireless and Processing Networks

Scheduling and Congestion Control for Wireless and Processing Networks PDF Author: Libin Jiang
Publisher: Morgan & Claypool Publishers
ISBN: 1608454622
Category : Technology & Engineering
Languages : en
Pages : 156

Book Description
In this book, we consider the problem of achieving the maximum throughput and utility in a class of networks with resource-sharing constraints. This is a classical problem of great importance. In the context of wireless networks, we first propose a fully distributed scheduling algorithm that achieves the maximum throughput. Inspired by CSMA (Carrier Sense Multiple Access), which is widely deployed in today's wireless networks, our algorithm is simple, asynchronous, and easy to implement. Second, using a novel maximal-entropy technique, we combine the CSMA scheduling algorithm with congestion control to approach the maximum utility. Also, we further show that CSMA scheduling is a modular MAC-layer algorithm that can work with other protocols in the transport layer and network layer. Third, for wireless networks where packet collisions are unavoidable, we establish a general analytical model and extend the above algorithms to that case. Stochastic Processing Networks (SPNs) model manufacturing, communication, and service systems. In manufacturing networks, for example, tasks require parts and resources to produce other parts. SPNs are more general than queueing networks and pose novel challenges to throughput-optimum scheduling. We proposes a "deficit maximum weight" (DMW) algorithm to achieve throughput optimality and maximize the net utility of the production in SPNs. Table of Contents: Introduction / Overview / Scheduling in Wireless Networks / Utility Maximization in Wireless Networks / Distributed CSMA Scheduling with Collisions / Stochastic Processing networks

Queueing Theory and Network Applications

Queueing Theory and Network Applications PDF Author: Tuan Phung-Duc
Publisher: Springer Nature
ISBN: 3030271811
Category : Computers
Languages : en
Pages : 393

Book Description
This book constitutes the proceedings of the 14th International Conference on Queueing Theory and Network Applications, QTNA 2019, held in Ghent, Belgium, in August 2019.The 23 full papers included in this volume were carefully reviewed and selected from 49 initial submissions. The papers are organized in topical sections on Retrial Queues; Controllable Queues; Strategic Queues; Queueing Networks; Scheduling Policies; Multidimensional Systems; and Queueing Models in Applications.

Processing Networks

Processing Networks PDF Author: J. G. Dai
Publisher: Cambridge University Press
ISBN: 1108488897
Category : Business & Economics
Languages : en
Pages : 405

Book Description
The state of the art in fluid-based methods for stability analysis, giving researchers and graduate students command of the tools.

Optimal Design of Queueing Systems

Optimal Design of Queueing Systems PDF Author: Shaler Stidham Jr.
Publisher: CRC Press
ISBN: 142001000X
Category : Business & Economics
Languages : en
Pages : 385

Book Description
The First Comprehensive Book on the SubjectFocusing on the underlying structure of a system, Optimal Design of Queueing Systems explores how to set the parameters of a queueing system, such as arrival and service rates, before putting it into operation. It considers various objectives, comparing individually optimal (Nash equilibrium), socially opt