| 书目名称 | Scheduling and Congestion Control for Wireless and Processing Networks | | 编辑 | Libin Jiang,Jean Walrand | | 视频video | | | 丛书名称 | Synthesis Lectures on Learning, Networks, and Algorithms | | 图书封面 |  | | 描述 | 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 | | 出版日期 | Book 2010 | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-031-79992-1 | | isbn_softcover | 978-3-031-79991-4 | | isbn_ebook | 978-3-031-79992-1Series ISSN 2690-4306 Series E-ISSN 2690-4314 | | issn_series | 2690-4306 | | copyright | Springer Nature Switzerland AG 2010 |
The information of publication is updating
|
|
发表于 2025-3-21 18:58:13
