Incollection,
Path optimization for elastic traffic under fairness constraints
Teletraffic Engineering in the Internet EraProceedings of the International Teletraffic Congress - ITC-I7, volume 4 of Teletraffic Science and Engineering, Elsevier, (2001)
DOI: http://dx.doi.org/10.1016/S1388-3437(01)80160-8
Abstract
We study optimal path selection and bandwidth allocation algorithms for elastic flows under fairness constraints. We assume that traffic demands between origin-destination (O-D) pairs are given and are characterized by a minimum and a maximum bandwidth requirement. We consider the case when between each O-D pair there is a set of admissible paths through which the flows realizing the demand may be routed. (We say that a set of flows realizes a demand associated with an O-D pair, if the sum of the allocated bandwidths of these flows is at least this demand.) The allocation task is thus not only to determine the bandwidth of each flow realizing the demands, but also to identify the specific path for each demand such that a fairness specific utility is maximized. In the max-min fairness case this implies the maximization of the minimum allocated bandwidth, whereas in the proportional fairness case it implies the maximization of a logarithmic utility function. As an interesting (and practically relevant) generalization, we also allow multiple paths to realize a given demand (demand-split). We propose algorithms that solve the respective optimization tasks associated with the popular max-min and proportional fair sharing constraints. We demonstrate the efficiency and usefulness of these algorithms through numerical examples based on the backbone Polish public network. We believe that the results can be used in traffic engineering of networks carrying elastic traffic.
