Meny

Javascript is not activated in your browser. This website needs javascript activated to work properly.
Du är här

On efficient max-min fair routing algorithms

Författare:
Publiceringsår: 2003
Språk: Engelska
Sidor: 365-372
Publikation/Tidskrift/Serie: Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003
Dokumenttyp: Konferensbidrag
Förlag: IEEE Computer Society

Sammanfattning

In the paper, we consider the problem of routing and bandwidth allocation in networks that support elastic traffic. We assume that the bandwidth demand between each source-destination (S-D) pair is specified in terms of a minimum and maximum value, and a set of flows between each S-D pair is allowed to realize these demands. (We say that a set of flows realizes the demand associated with an S-D pair, if the sum of the bandwidths allocated to these flows is greater than the minimum value assumed for the demand of that S-D pair). In this setting, we show that routing and bandwidth allocation can be formulated as an optimization problem, where network utilization is to be maximized under capacity and the widely used max-min fairness constraints. We describe three different algorithms to solve variants of this problem. The most important one, an efficient, original algorithm assuming multipath routing is studied in detail and illustrated with a numerical example

Disputation

Nyckelord

  • Technology and Engineering
  • maxmin fair routing algorithms
  • source-destination pair
  • optimization problem
  • network utilization
  • elastic traffic
  • maxmin fairness constraints
  • multipath routing
  • bandwidth allocation

Övriga

International Symposium on Computers and Communications ISCC 2003
2003-06-30/2003-07-03
Kemer-Antalya, Turkey
Published
Yes
  • ISBN: 0-7695-1961-X

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen