Fair Networks
So far, in Chapters 4 and 7, we have assumed that the volume for each demand is a given, fixed quantity. Now we drop this assumption and assume that the demands between node pairs can utilize any total bandwidth assigned to them by means of their path flows, perhaps within certain bounds (in the limiting case when the lower bounds on demand volumes are equal to the upper bounds, we arrive back at the classical problems with fixed demand volumes). With such elastic demands a natural question arises: what should be the principle governing the distribution of demand volumes within given network resources (link capacities) leading to assignments fulfilling some kind of a fairness criterion? An intuitive way to solve this ...
Get Routing, Flow, and Capacity Design in Communication and Computer Networks now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
