Download or read book Dynamic Scheduling of Open Multiclass Queueing Networks in a Slowly Changing Environment written by Junxia Chang and published by . This book was released on 2004 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: This thesis investigates the dynamic scheduling of computer communication networks that can be periodically overloaded. Such networks are modelled as mutliclass queueing networks in a slowly changing environment. A hierarchy framework is established to search for a suitable scheduling policy for such networks through its connection with stochastic fluid models. In this work, the dynamic scheduling of a specific multiclass stochastic fluid model is studied first. Then, a bridge between the scheduling of stochastic fluid models and that of the queueing networks in a changing environment is established. In the multiclass stochastic fluid model, the focus is on a system with two fluid classes and a single server whose capacity can be shared arbitrarily among these two classes. The server may be overloaded transiently and it is under a quality of service contract which is indicated by a threshold value of each class. Whenever the fluid level of a certain class is above the designated threshold value, the penalty cost is incurred to the server. The optimal and asymptotically optimal resource allocation policies are specified for such a stochastic fluid model. Afterwards, a connection between the optimization of the queueing networks and that of the stochastic fluid models is established. This connection involves two steps. The first step is to approximate such networks by their corresponding stochastic fluid models with a proper scaling method. The second step is to construct a suitable policy for the queueing network through a successful interpretation of the stochastic fluid model solution, where the interpretation method is provided in this study. The results developed in this thesis facilitate the process of searching for a nearly optimal scheduling policy for queueing networks in a slowly changing environment.
Download or read book Dynamic Scheduling of Multiclass Queueing Networks written by Caiwei Li and published by . This book was released on 2000 with total page 228 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Stability and Scheduling in Multiclass Queueing Networks written by Cédric Westphal and published by . This book was released on 2000 with total page 268 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Dynamic Scheduling of Queueing Networks written by Jihong Ou and published by . This book was released on 1991 with total page 170 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Scheduling of Multiclass Queueing Networks written by Ioannis Ch Paschalidis and published by . This book was released on 1992 with total page 212 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 Target pursuing Policies for Scheduling and Routing in Multiclass Queueing Networks written by Chang Su and published by . This book was released on 2004 with total page 206 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Scheduling a Two station Multiclass Queueing Network in Heavy Traffic written by Lawrence M. Wein and published by . This book was released on 1988* with total page 68 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Dissertation Abstracts International written by and published by . This book was released on 2005 with total page 884 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Stability Capacity and Scheduling of Multiclass Queueing Networks written by John Jay Hasenbein and published by . This book was released on 1998 with total page 262 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Scheduling Multiclass Queueing Networks and Job Shops Using Fluid and Semidefinite Relaxations written by Jayachandran Sethuraman and published by . This book was released on 1999 with total page 158 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book INFORMS Annual Meeting written by Institute for Operations Research and the Management Sciences. National Meeting and published by . This book was released on 2003 with total page 264 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Scheduling Multiclass Queueing Networks on Parallel Servers written by Kevin D. Glazebrook 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 Queueing Modelling Fundamentals written by Professor Chee-Hock Ng and published by John Wiley & Sons. This book was released on 2008-04-30 with total page 292 pages. Available in PDF, EPUB and Kindle. Book excerpt: Queueing analysis is a vital tool used in the evaluation of system performance. Applications of queueing analysis cover a wide spectrum from bank automated teller machines to transportation and communications data networks. Fully revised, this second edition of a popular book contains the significant addition of a new chapter on Flow & Congestion Control and a section on Network Calculus among other new sections that have been added to remaining chapters. An introductory text, Queueing Modelling Fundamentals focuses on queueing modelling techniques and applications of data networks, examining the underlying principles of isolated queueing systems. This book introduces the complex queueing theory in simple language/proofs to enable the reader to quickly pick up an overview to queueing theory without utilizing the diverse necessary mathematical tools. It incorporates a rich set of worked examples on its applications to communication networks. Features include: Fully revised and updated edition with significant new chapter on Flow and Congestion Control as-well-as a new section on Network Calculus A comprehensive text which highlights both the theoretical models and their applications through a rich set of worked examples, examples of applications to data networks and performance curves Provides an insight into the underlying queuing principles and features step-by-step derivation of queueing results Written by experienced Professors in the field Queueing Modelling Fundamentals is an introductory text for undergraduate or entry-level post-graduate students who are taking courses on network performance analysis as well as those practicing network administrators who want to understand the essentials of network operations. The detailed step-by-step derivation of queueing results also makes it an excellent text for professional engineers.
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 To Queue or Not to Queue written by Refael Hassin and published by Springer Science & Business Media. This book was released on 2003 with total page 212 pages. Available in PDF, EPUB and Kindle. Book excerpt: To Queue Or Not To Queue: Equilibrium Behavior in Queueing Systems focuses on the highly interesting, practical viewpoint of customer behavior and its effect on the performance of the queueing system. The book's objectives are threefold: (1) It is a comprehensive survey of the literature on equilibrium behavior of customers and servers in queueing systems. The literature is rich and considerable, but lacks continuity. This book will provide the needed continuity and cover some issues that have not been adequately treated. (2) In addition, it will examine the known results of the field, classify them and identify where and how they relate to each other. (3) And finally, it seeks to fill a number of the gaps in the literature with new results while explicitly outlining open problems in other areas. With this book, it is the authors' paramount purpose is to motivate further research and to help researchers identify new and interesting open problems.
Download or read book Online Stochastic Combinatorial Optimization written by Pascal Van Hentenryck and published by MIT Press (MA). This book was released on 2006 with total page 256 pages. Available in PDF, EPUB and Kindle. Book excerpt: A framework for online decision making under uncertainty and time constraints, with online stochastic algorithms for implementing the framework, performance guarantees, and demonstrations of a variety of applications.
