Articles liés à Scheduling and Congestion Control for Wireless and...

Scheduling and Congestion Control for Wireless and Processing Networks - Couverture souple

 
9781608454617: Scheduling and Congestion Control for Wireless and Processing Networks

Synopsis

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

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Acheter D'occasion

état :  Satisfaisant
Ex-library with the usual features...
Afficher cet article
EUR 24,64

Autre devise

EUR 35,88 expédition depuis Etats-Unis vers France

Destinations, frais et délais

Autres éditions populaires du même titre

9783031799914: Scheduling and Congestion Control for Wireless and Processing Networks

Edition présentée

ISBN 10 :  3031799917 ISBN 13 :  9783031799914
Editeur : Springer, 2010
Couverture souple

Résultats de recherche pour Scheduling and Congestion Control for Wireless and...

Image d'archives

Libin Jiang; Jean Walrand
Edité par Morgan & Claypool, 2010
ISBN 10 : 1608454614 ISBN 13 : 9781608454617
Ancien ou d'occasion Soft Cover

Vendeur : BookOrders, Russell, IA, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Soft Cover. Etat : Good. Ex-library with the usual features. Library label on front cover. The interior is clean and tight. Binding is good. Cover shows very light wear. Ex-Library. N° de réf. du vendeur 122025

Contacter le vendeur

Acheter D'occasion

EUR 24,64
Autre devise
Frais de port : EUR 35,88
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Libin, Jiang,Jean, Walrand
ISBN 10 : 1608454614 ISBN 13 : 9781608454617
Ancien ou d'occasion paperback

Vendeur : suffolkbooks, Center moriches, NY, Etats-Unis

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

paperback. Etat : Very Good. Fast Shipping - Safe and Secure 7 days a week! N° de réf. du vendeur 3TWDDA0026KG

Contacter le vendeur

Acheter D'occasion

EUR 9,95
Autre devise
Frais de port : EUR 64,08
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier