Open Access
Congestion Control, Routing and Scheduling in Communication Networks: A Tutorial
-
Full Text Views
106
- Cite this
- Free PDF (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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E96-B No.11 pp.2714-2723
- Publication Date
- 2013/11/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E96.B.2714
- Type of Manuscript
- Special Section INVITED PAPER (Special Section on Progress in Information Network Science)
- Category
Authors
Jean WALRAND
University of California
Abhay K. PAREKH
University of California
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jean WALRAND, Abhay K. PAREKH, "Congestion Control, Routing and Scheduling in Communication Networks: A Tutorial" in IEICE TRANSACTIONS on Communications,
vol. E96-B, no. 11, pp. 2714-2723, November 2013, doi: 10.1587/transcom.E96.B.2714.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E96.B.2714/_p
Copy
@ARTICLE{e96-b_11_2714,
author={Jean WALRAND, Abhay K. PAREKH, },
journal={IEICE TRANSACTIONS on Communications},
title={Congestion Control, Routing and Scheduling in Communication Networks: A Tutorial},
year={2013},
volume={E96-B},
number={11},
pages={2714-2723},
abstract={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.},
keywords={},
doi={10.1587/transcom.E96.B.2714},
ISSN={1745-1345},
month={November},}
Copy
TY - JOUR
TI - Congestion Control, Routing and Scheduling in Communication Networks: A Tutorial
T2 - IEICE TRANSACTIONS on Communications
SP - 2714
EP - 2723
AU - Jean WALRAND
AU - Abhay K. PAREKH
PY - 2013
DO - 10.1587/transcom.E96.B.2714
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E96-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2013
AB - 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.
ER -
English
