Author : Gideon Weiss
Publisher : Cambridge University Press
Page : 447 pages
File Size : 15,46 MB
Release : 2021-10-14
Category : Business & Economics
ISBN : 1108415326
A graduate text on theory and methods using applied probability techniques for scheduling service, manufacturing, and information networks.
Author : Hong Chen
Publisher : Springer Science & Business Media
Page : 407 pages
File Size : 13,90 MB
Release : 2013-04-17
Category : Mathematics
ISBN : 1475753012
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.
Author : Frank Kelly
Publisher : Cambridge University Press
Page : 233 pages
File Size : 44,97 MB
Release : 2014-02-27
Category : Computers
ISBN : 1107035775
A compact, highly-motivated introduction to some of the stochastic models found useful in the study of communications networks.
Author : Sean Meyn
Publisher : Cambridge University Press
Page : 33 pages
File Size : 43,81 MB
Release : 2008
Category : Mathematics
ISBN : 0521884411
From foundations to state-of-the-art; the tools and philosophy you need to build network models.
Author : Michael Neely
Publisher : Springer Nature
Page : 199 pages
File Size : 36,32 MB
Release : 2022-05-31
Category : Computers
ISBN : 303179995X
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
Author : Libin Jiang
Publisher : Morgan & Claypool Publishers
Page : 156 pages
File Size : 24,14 MB
Release : 2010-10-10
Category : Technology & Engineering
ISBN : 1608454622
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
Author : Tuan Phung-Duc
Publisher : Springer Nature
Page : 393 pages
File Size : 36,39 MB
Release : 2019-08-22
Category : Computers
ISBN : 3030271811
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.
Author : Shaler Stidham Jr.
Publisher : CRC Press
Page : 385 pages
File Size : 38,42 MB
Release : 2009-03-27
Category : Business & Economics
ISBN : 142001000X
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
Author : Thomas G. Robertazzi
Publisher : Springer Science & Business Media
Page : 418 pages
File Size : 10,14 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 1461211646
Intended for a first course in performance evaluation, this is a self-contained treatment covering all aspects of queuing theory. It starts by introducing readers to the terminology and usefulness of queueing theory and continues by considering Markovian queues in equilibrium, Littles law, reversibility, transient analysis, and computation, plus the M/G/1 queuing system. It then moves on to cover networks of queues, and concludes with techniques for numerical solutions, a discussion of the PANACEA technique, discrete time queueing systems and simulation, and stochastic Petri networks. The whole is backed by case studies of distributed queueing networks arising in industrial applications. This third edition includes a new chapter on self-similar traffic, many new problems, and solutions for many exercises.
Author : Gunter Bolch
Publisher : John Wiley & Sons
Page : 901 pages
File Size : 24,23 MB
Release : 2006-04-14
Category : Technology & Engineering
ISBN : 0471565253
Critically acclaimed text for computer performance analysis--now in its second edition The Second Edition of this now-classic text provides a current and thorough treatment of queueing systems, queueing networks, continuous and discrete-time Markov chains, and simulation. Thoroughly updated with new content, as well as new problems and worked examples, the text offers readers both the theory and practical guidance needed to conduct performance and reliability evaluations of computer, communication, and manufacturing systems. Starting with basic probability theory, the text sets the foundation for the more complicated topics of queueing networks and Markov chains, using applications and examples to illustrate key points. Designed to engage the reader and build practical performance analysis skills, the text features a wealth of problems that mirror actual industry challenges. New features of the Second Edition include: * Chapter examining simulation methods and applications * Performance analysis applications for wireless, Internet, J2EE, and Kanban systems * Latest material on non-Markovian and fluid stochastic Petri nets, as well as solution techniques for Markov regenerative processes * Updated discussions of new and popular performance analysis tools, including ns-2 and OPNET * New and current real-world examples, including DiffServ routers in the Internet and cellular mobile networks With the rapidly growing complexity of computer and communication systems, the need for this text, which expertly mixes theory and practice, is tremendous. Graduate and advanced undergraduate students in computer science will find the extensive use of examples and problems to be vital in mastering both the basics and the fine points of the field, while industry professionals will find the text essential for developing systems that comply with industry standards and regulations.
