Congestion control, routing and scheduling in communication networks : A tutorial

3Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

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. © 2013 The Institute of Electronics, Information and Communication Engineers.

Cite

CITATION STYLE

APA

Walrand, J., & Prekh, A. K. (2013). Congestion control, routing and scheduling in communication networks : A tutorial. IEICE Transactions on Communications, E96-B(11), 2714–2723. https://doi.org/10.1587/transcom.E96.B.2714

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free