Scheduling and Congestion Control for Wireless and Processing Networks
- Indbinding:
- Paperback
- Sideantal:
- 160
- Udgivet:
- 18. august 2010
- Størrelse:
- 191x9x235 mm.
- Vægt:
- 312 g.
- 8-11 hverdage.
- 13. december 2024
På lager
Forlænget returret til d. 31. januar 2025
Normalpris
Abonnementspris
- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
Beskrivelse af Scheduling and Congestion Control for Wireless and Processing Networks
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
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
Brugerbedømmelser af Scheduling and Congestion Control for Wireless and Processing Networks
Giv din bedømmelse
For at bedømme denne bog, skal du være logget ind.Andre købte også..
Find lignende bøger
Bogen Scheduling and Congestion Control for Wireless and Processing Networks findes i følgende kategorier:
- Business og læring > Computer og IT
- Reference, information og tværfaglige emner > Forskning og information: generelt > Informationsteori > Kybernetik og systemteori
- Teknologi, ingeniørvidenskab og landbrug > Elektronik og kommunikationsteknik > Elektronik teknik
- Teknologi, ingeniørvidenskab og landbrug > Elektronik og kommunikationsteknik > Kommunikationsteknik / telekommunikation
- Databehandling og informationsteknologi > Programmering / softwareudvikling > Programmeringssprog og scriptsprog
- Databehandling og informationsteknologi > Informatik > Kunstig intelligens
© 2024 Pling BØGER Registered company number: DK43351621