0
Your cart

Your cart is empty

Books > Professional & Technical > Energy technology & engineering > Electrical engineering

Buy Now

Scheduling and Congestion Control for Wireless and Processing Networks (Paperback) Loot Price: R891
Discovery Miles 8 910
Scheduling and Congestion Control for Wireless and Processing Networks (Paperback): Libin Jiang, Jean Walrand

Scheduling and Congestion Control for Wireless and Processing Networks (Paperback)

Libin Jiang, Jean Walrand

Series: Synthesis Lectures on Learning, Networks, and Algorithms

 (sign in to rate)
Loot Price R891 Discovery Miles 8 910 | Repayment Terms: R83 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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

General

Imprint: Springer International Publishing AG
Country of origin: Switzerland
Series: Synthesis Lectures on Learning, Networks, and Algorithms
Release date: August 2010
First published: 2010
Authors: Libin Jiang • Jean Walrand
Dimensions: 235 x 191mm (L x W)
Format: Paperback
Pages: 144
ISBN-13: 978-3-03-179991-4
Languages: English
Subtitles: English
Categories: Books > Professional & Technical > Energy technology & engineering > Electrical engineering > General
Books > Professional & Technical > Electronics & communications engineering > Communications engineering / telecommunications > General
Books > Computing & IT > Applications of computing > Artificial intelligence > General
LSN: 3-03-179991-7
Barcode: 9783031799914

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners