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

Summary, in English

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.

• Författare: Pål Nilsson; Michal Pioro
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• 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
• Länkar: http://dx.doi.org/10.1007/11753810_76
• Dokumenttyp: Konferensbidrag
• Förlag: Springer
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering; Communication Systems
• Nyckelord: network optimization; max-min fairness; modular flows
• Conference name: 5th International IFIP-TC6 Networking Conference
• Conference date: 2006-05-15 - 2006-05-19
• Conference place: Coimbra, Portugal
• Status: Published
• ISBN/ISSN/Övrigt: ISSN: 0302-9743; ISSN: 1611-3349; ISBN: 978-3-540-34192-5