@inbook{e3e70604590d45779c96fb66b513583f,
title = "Maximum flow routing with weighted max-min fairness",
abstract = "Max-min is an established fairness criterion for allocating bandwidth for flows. In this work we look at the combined problem of multi-path routing and bandwidth allocation such that the flow allocation for each connection will be maximized and fairness will be maintained. We use the weighted extension of the max-min criterion to allocate bandwidth in proportion to the flows' demand. Our contribution is an algorithm which, for the first time, solves the combined routing and bandwidth allocation problem for the case where flows are allowed to be splitted along several paths. We use multi commodity flow (MCF) formulation which is solved using linear programming (LP) techniques. These building blocks are used by our algorithm to derive the required optimal routing and allocation.",
author = "Miriam Allalouf and Yuval Shavitt",
year = "2004",
doi = "10.1007/978-3-540-30193-6_28",
language = "אנגלית",
isbn = "9783540232384",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "278--287",
editor = "Josep Sol{\'e}-Pareta and Jordi Domingo-Pascual and Michael Smirnov and {Van Mieghem}, Piet and Edmundo Monteiro and Peter Reichl and Burkhard Stiller and Gibbens, {Richard J.} and Burkhard Stiller",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
}