Book description
In this book, we consider the problem of achieving the maximum throughput and utility in a class of networks with resourcesharing 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 maximalentropy 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 MAClayer 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 throughputoptimum 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
Table of contents
 Preface
 Introduction
 Overview

Scheduling in Wireless Networks
 Model and Scheduling Problem
 CSMA Algorithm
 Idealized Algorithm
 Distributed Algorithms
 MaximalEntropy Interpretation
 Reducing Delays: Algorithm 1(b)
 Simulations
 Proof Sketch of Theorem 3.10(i)
 Further Proof Details of Theorem 3.10(i)
 Proof of Theorem 3.10(ii)
 Proof of Theorem 3.13
 General Transmission Times
 Appendices
 Summary
 Related Works
 Utility Maximization in Wireless Networks
 Distributed CSMA Scheduling with Collisions
 Stochastic Processing networks
 Stochastic Approximation
 Bibliography (1/2)
 Bibliography (2/2)
 Authors' Biographies
 Index
Product information
 Title: Scheduling and Congestion Control for Wireless and Processing Networks
 Author(s):
 Release date: October 2010
 Publisher(s): Morgan & Claypool Publishers
 ISBN: 9781608454624
You might also like
book
Signal Processing for Cognitive Radios
This book examines signal processing techniques for cognitive radios. The book is divided into three parts: …
book
Towards 5G
This book brings together a group of visionaries and technical experts from academia to industry to …
book
Fluent Python, 2nd Edition
Python’s simplicity lets you become productive quickly, but often this means you aren’t using everything it …
book
Machine Learning
This tutorial text gives a unifying perspective on machine learning by covering both probabilistic and deterministic …