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

@article{Walrand2013CongestionCR,
  title={Congestion Control, Routing and Scheduling in Communication Networks: A Tutorial},
  author={Jean C. Walrand and Abhay Parekh},
  journal={IEICE Transactions},
  year={2013},
  volume={96-B},
  pages={2714-2723}
}
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… CONTINUE READING
3 Citations
19 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Towards protocols for internetwork communication,

  • V. Cerf, B. Kahn
  • IFIP/TC6.1, NIC 18764,
  • 1973
Highly Influential
8 Excerpts

E

  • M. J. Neely
  • Modiano, and C.P. Li, “Fairness and optimal…
  • 2005
2 Excerpts

Convex Optimization

  • S. Boyd, L. Vandenberghe
  • Cambridge University Press
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…