Congestion Control, Routing and Scheduling in Communication Networks: A Tutorial

Jean WALRAND  Abhay K. PAREKH  

Publication
IEICE TRANSACTIONS on Communications   Vol.E96-B   No.11   pp.2714-2723
Publication Date: 2013/11/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E96.B.2714
Print ISSN: 0916-8516
Type of Manuscript: INVITED PAPER (Special Section on Progress in Information Network Science)
Category: 
Keyword: 
distributed algorithm,  congestion control,  routing,  scheduling,  multiple access,  utility maximization,  backpressure,  entropy relaxation,  

Full Text: FreePDF(820.2KB)


Summary: 
In communication networks, congestion control, routing, and multiple access schemes for scheduling transmissions are typically regulated by distributed algorithms. Engineers designed these algorithms using clever heuristics that they refined in the light of simulation results and experiments. Over the last two decades, a deeper understanding of these algorithms emerged through the work of researchers. This understanding has a real potential for improving the design of protocols for data centers, cloud computing, and even wireless networks. Since protocols tend to be standardized by engineers, it is important that they become familiar with the insights that emerged in research. We hope that this paper might appeal to practitioners and make the research results intuitive and useful. The methods that the paper describes may be useful for many other resource allocation problems such as in call centers, manufacturing lines, hospitals and the service industry.