Network Flow Models
If the weak were to
Tide across the rapids of life
With your help,
What do you stand to lose?
Bhupen Hazarika (based on a translation by Pradip Acharya)
Abstract
In a computer network, an important function is to carry traffic efficiently, given the routing paradigm in place. This efficiency is achieved through traffic engineering. In this chapter, we discuss common traffic engineering goals such as minimum cost routing, minimization of the most congested links (“load balancing”), and minimization of the average delay by presenting network flow models for these goals. Mathematical formulations for these traffic engineering optimization problems for given routing requirements are presented ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access