Libros importados con hasta 50% OFF + Envío Gratis a todo USA  Ver más

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Scheduling and Congestion Control for Wireless and Processing Networks (in English)
Type
Physical Book
Publisher
Language
English
Pages
144
Format
Paperback
Dimensions
23.5 x 19.1 x 0.9 cm
Weight
0.29 kg.
ISBN13
9783031799914
Edition No.
1

Scheduling and Congestion Control for Wireless and Processing Networks (in English)

Jean Walrand (Author) · Libin Jiang (Author) · Springer · Paperback

Scheduling and Congestion Control for Wireless and Processing Networks (in English) - Jiang, Libin ; Walrand, Jean

Physical Book

$ 28.41

$ 29.99

You save: $ 1.58

5% discount
  • Condition: New
It will be shipped from our warehouse between Thursday, June 06 and Friday, June 07.
You will receive it anywhere in United States between 1 and 3 business days after shipment.

Synopsis "Scheduling and Congestion Control for Wireless and Processing Networks (in English)"

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

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews