Abstract
This chapter explains the main ideas of this book on a few simple examples. InSection2.1, we consider the scheduling of three wireless nodes and review the maximum weighted matching (MWM) and the A-CSMA scheduling. Section 2.2 explains how to combine admission control with scheduling. Section 2.3 discusses the randomized backpressure algorithms. Section 2.4 reviews the Lagrangian method to solve convex optimization problems. We conclude the chapter with a summary of the main observations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Jiang, L., Walrand, J. (2010). Overview. In: Scheduling and Congestion Control for Wireless and Processing Networks. Synthesis Lectures on Learning, Networks, and Algorithms. Springer, Cham. https://doi.org/10.1007/978-3-031-79992-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-79992-1_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-79991-4
Online ISBN: 978-3-031-79992-1
eBook Packages: Synthesis Collection of Technology (R0)eBColl Synthesis Collection 3