Download or read book Optimal Stochastic Scheduling and Routing in Queueing Networks written by Dimitrios G. Pandelis and published by . This book was released on 1994 with total page 364 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Scheduling and Control of Queueing Networks written by Gideon Weiss and published by Cambridge University Press. This book was released on 2021-10-14 with total page 448 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Download or read book Fundamentals of Queueing Networks written by Hong Chen and published by Springer Science & Business Media. This book was released on 2013-04-17 with total page 407 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Download or read book Stochastic Recursive Algorithms for Optimal Routing in Queueing Networks written by Felisa Josefina Vázquez-Abad and published by . This book was released on 1989 with total page 180 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Optimal Stochastic Scheduling of Queueing Networks written by Mark Peter Van Oyen and published by . This book was released on 1992 with total page 244 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Introduction to Queueing Networks written by J. MacGregor Smith and published by Springer. This book was released on 2018-08-28 with total page 562 pages. Available in PDF, EPUB and Kindle. Book excerpt: The book examines the performance and optimization of systems where queueing and congestion are important constructs. Both finite and infinite queueing systems are examined. Many examples and case studies are utilized to indicate the breadth and depth of the queueing systems and their range of applicability. Blocking of these processes is very important and the book shows how to deal with this problem in an effective way and not only compute the performance measures of throughput, cycle times, and WIP but also to optimize the resources within these systems. The book is aimed at advanced undergraduate, graduate, and professionals and academics interested in network design, queueing performance models and their optimization. It assumes that the audience is fairly sophisticated in their mathematical understanding, although the explanations of the topics within the book are fairly detailed.
Download or read book Customer Choice and Routing in Queueing Networks written by Sunil Kumar and published by . This book was released on 2012 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two station multiclass queueing network in which the system manager chooses the scheduling rule used, and individual customers choose routes in a self-interested manner. We show that this network can be unstable in Nash equilibrium when the scheduling rule is chosen naively by the system manager. We also design a non-trivial scheduling rule that negates the performance degradation due to self-interested routing and achieves a Nash equilibrium with excellent performance.
Download or read book Self Interested Routing in Queuing Networks written by Sunil Kumar and published by . This book was released on 2004 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two station multiclass queueing network in which the system manager chooses the scheduling rule used, and individual customers choose routes in a self-interested manner. We show that this network can be unstable in Nash equilibrium under some scheduling rules. We also design a non-trivial scheduling rule that negates the performance degradation due to self-interested routing and achieves a Nash equilibrium with performance comparable to the first-best solution.
Download or read book Stochastic Network Optimization with Application to Communication and Queueing Systems written by Michael J. Neely and published by Morgan & Claypool Publishers. This book was released on 2010 with total page 212 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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
Download or read book Stochastic Networks written by Frank Kelly and published by Cambridge University Press. This book was released on 2014-02-27 with total page 233 pages. Available in PDF, EPUB and Kindle. Book excerpt: A compact, highly-motivated introduction to some of the stochastic models found useful in the study of communications networks.
Download or read book Stochastic Network Optimization with Application to Communication and Queueing Systems written by Michael Neely and published by Springer Nature. This book was released on 2022-05-31 with total page 199 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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
Download or read book Queueing Networks with Discrete Time Scale written by Hans Daduna and published by Springer. This book was released on 2003-05-15 with total page 144 pages. Available in PDF, EPUB and Kindle. Book excerpt: Building on classical queueing theory mainly dealing with single node queueing systems, networks of queues, or stochastic networks has been a field of intensive research over the last three decades. Whereas the first breakthrough in queueing network theory was initiated by problems and work in operations research, the second breakthrough, as well as subsequent major work in the area, was closely related to computer science, particularly to performance analysis of complex systems in computer and communication science. The text reports on recent research and development in the area. It is centered around explicit expressions for the steady behavior of discrete time queueing networks and gives a moderately positive answer to the question of whether there can be a product form calculus in discrete time. Originating from a course given by the author at Hamburg University, this book is ideally suited as a text for courses on discrete time stochastic networks.
Download or read book Optimal Stochastic Scheduling of a 2 Stage Tandem Queue with Parallel Servers written by Hyun-Soo Abn, Izsk duenyas, Rachel Zhang and published by . This book was released on 1997 with total page 28 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Robust Scheduling for Queueing Networks written by Ramtin Pedarsani and published by . This book was released on 2015 with total page 101 pages. Available in PDF, EPUB and Kindle. Book excerpt: Queueing networks are used to model complicated processing environments such as data centers, call centers, transportation networks, health systems, etc. A queueing network consists of multiple interconnected queues with some routing structure, and a set of servers that have different and possibly overlapping capabilities in processing tasks (jobs) of different queues. One of the most important challenges in designing processing systems is to come up with a low-complexity and efficient scheduling policy. In this thesis, we consider the problem of robust scheduling for various types of processing networks. We call a policy robust if it does not depend on system parameters such as arrival and service rates. A major challenge in designing efficient scheduling policies for new large-scale processing networks is the lack of reliable estimates of system parameters; thus, designing a robust scheduling policy is of great practical interest. We develop a novel methodology for designing robust scheduling policies for queueing networks. The key idea of our design is to use the queue-length changes information to learn the right allocation of service resources to different tasks by stochastic gradient projection method. Our scheduling policy is oblivious to the knowledge of arrival rates and service rates of tasks in the network. Further, we propose a new fork-join processing network for scheduling jobs that are represented as directed acyclic graphs. We apply our robust scheduling policy to this fork-join network, and prove rate stability of the network under some mild assumptions. Next, we consider the stability of open multiclass queueing networks under longest-queue (LQ) scheduling. LQ scheduling is of great practical interest since (a) it requires only local decisions per group of queues; (b) the policy is robust to knowledge of arrival rates, service rates and routing probabilities of the network. Throughput-optimality of LQ scheduling policy for open multiclass queueing network is still an open problem. We resolve the open problem for a special case of multiclass queueing networks with two servers that can each process two queues, and show that LQ is indeed throughput-optimal. Finally, we consider transportation networks that can be well modeled by queueing networks. We abstractly model a network of signalized intersections regulated by fixed-time controls as a deterministic queueing network with periodic arrival and service rates. This system is characterized by a delay-differential equation. We show that there exists a unique periodic trajectory of queue-lengths, and every trajectory or solution of the system converges to this periodic trajectory, independent of the initial conditions.
Download or read book An Introduction to Queueing Networks written by Jean Walrand and published by . This book was released on 1988 with total page 408 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Handbook of Scheduling written by Joseph Y-T. Leung and published by CRC Press. This book was released on 2004-04-27 with total page 1215 pages. Available in PDF, EPUB and Kindle. Book excerpt: This handbook provides full coverage of the most recent and advanced topics in scheduling, assembling researchers from all relevant disciplines to facilitate new insights. Presented in six parts, these experts provides introductory material, complete with tutorials and algorithms, then examine classical scheduling problems. Part 3 explores scheduling models that originate in areas such as computer science, operations research. The following section examines scheduling problems that arise in real-time systems. Part 5 discusses stochastic scheduling and queueing networks, and the final section discusses a range of applications in a variety of areas, from airlines to hospitals.
Download or read book Scheduling and Congestion Control for Wireless and Processing Networks written by Libin Jiang and published by Morgan & Claypool Publishers. This book was released on 2010-10-10 with total page 156 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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
