Scheduling and Congestion Control for Wireless and Processing Networks

Name: Scheduling and Congestion Control for Wireless and Processing Networks
Brand: Springer Nature
SKU: 9783031799914
Availability: InStock

Best Price (Coupon Required):
Buy Scheduling and Congestion Control for Wireless and Processing Networks for $18.00 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

2 Offers Price Range: $19.99 - $35.00

BEST PRICE

Single Product Purchase

$18.00

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$19.99	$19.99		10% OFF This deals requires coupon	$18.00		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783031799914

Condition

New

Product Description

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.

Available Colors

N/A

Available Sizes

N/A

Reviews

0 reviews

5 stars

4 stars

3 stars

2 stars

1 star

Questions & Answers

Similar Products

Commonsense Cardiology

$39.99

Molecular Geometry of Body Pattern in Birds

$169.99

A Clinical Guide to Epileptic Syndromes and their Treatment

$84.99

After Sales Service in the European Community

$54.99

Evolving Computability

$54.99

Be Kind to Yourself: A 52-Week Workbook to Nurture Your Beautiful Self through the Good Times, the Messy Times, and All the Seasons in Between by Mega

$24.99