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

被引:2
|
作者
Walrand, Jean [1 ]
Parekh, Abhay K. [1 ]
机构
[1] Univ Calif Berkeley, Dept EECS, Berkeley, CA 94720 USA
基金
美国国家科学基金会;
关键词
distributed algorithm; congestion control; routing; scheduling; multiple access; utility maximization; backpressure; entropy relaxation; STABILITY;
D O I
10.1587/transcom.E96.B.2714
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:2714 / 2723
页数:10
相关论文
共 50 条