Du är här

Max-min fair distribution of modular network flows on fixed paths

Författare:
Publiceringsår: 2006
Språk: Engelska
Sidor: 916-927
Publikation/Tidskrift/Serie: Networking 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. Proceedings / Lecture Notes in Computer Science
Volym: 3976
Dokumenttyp: Konferensbidrag
Förlag: Springer

Sammanfattning

In this paper a new aspect of the classical max-min fairness fixed-path problem is investigated. The considered (multi-criteria) optimization problem is almost identical to the continuous-flow problem, with the additional complicating assumption that flows must be integral. We show that such an extension makes the problem substantially more difficult (in fact NP-hard). Through comparison with the closely related continuous-flow problem, a number of properties for the solution of the extended problem are derived. An algorithm, based on sequential resolution of linear programs, that shows to be useful (produce optimal solutions) for many instances of the considered problem, is given. It follows that this algorithm can be made exact, through substituting the involved linear programs by mixed-integer programs.

Disputation

Nyckelord

  • Technology and Engineering
  • network optimization
  • max-min fairness
  • modular flows

Övrigt

5th International IFIP-TC6 Networking Conference
2006-05-15/2006-05-19
Coimbra, Portugal
Published
Yes
  • ISSN: 0302-9743
  • ISBN: 978-3-540-34192-5

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

LERU logo U21 logo