Scheduling and Congestion Control for Wireless and Processing Networks

Scheduling and Congestion Control for Wireless and Processing Networks

Libin Jiang, Jean Walrand
ISBN: 9781608454617 | PDF ISBN: 9781608454624
Copyright © 2010 | 156 Pages | Publication Date: 01/01/2010

BEFORE YOU ORDER: You may have Academic or Corporate access to this title. Click here to find out: 10.2200/S00270ED1V01Y201008CNT006

Ordering Options: Paperback $35.00   E-book $28.00   Paperback & E-book Combo $43.75

Why pay full price? Members receive 15% off all orders.
Learn More Here

Read Our Digital Content License Agreement (pop-up)

Purchasing Options:

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 propose a "deficit maximum weight" (DMW) algorithm to achieve throughput optimality and maximize the net utility of the production in SPNs.

Table of Contents

Scheduling in Wireless Networks
Utility Maximization in Wireless Networks
Distributed CSMA Scheduling with Collisions
Stochastic Processing networks

About the Author(s)

Libin Jiang, University of California, Berkeley
Libin Jiang received the bachelor of engineering degree in electronic engineering and nformation science from the University of Science and Technology of China, Hefei, China, in 2003,the master of philosophy degree in information engineering from the Chinese University of Hong Kong, Shatin,Hong Kong, in 2005, and the Ph.D. degree in electrical engineering and computer sciences from the University of California, Berkeley, in 2009. His research interest includes wireless networks, communications, and game theory. He received the David Sakrison Memorial Prize for outstanding doctoral research in UC Berkeley, and the best presentation award in the ACM Mobihoc'09 S3 Workshop.

Jean Walrand, University of California, Berkeley
Jean Walrand received his Ph.D. in EECS from UC Berkeley, and has been on the faculty of that department since 1982. He is the author of An Introduction to Queueing Networks (Prentice Hall, 1988) and of Communication Networks: A First Course (2nd ed. McGraw-Hill,1998), and co-author of High-Performance Communication Networks (2nd ed, Morgan Kaufman, 2000) and of Scheduling and Congestion Control for Communication and Processing Networks (Morgan & Claypool, 2010). His research interests include stochastic processes, queuing theory, communication networks, game theory and the economics of the Internet. Prof. Walrand is a Fellow of the Belgian American Education Foundation and of the IEEE, and a recipient of the Lanchester Prize and of the Stephen O. Rice Prize.

Browse by Subject
ACM Books
IOP Concise Physics
0 items

Note: Registered customers go to: Your Account to subscribe.

E-Mail Address:

Your Name: