Maxmin fair distribution of modular network flows on fixed paths
(2006) 5th International IFIPTC6 Networking Conference 3976. p.916927 Abstract
 In this paper a new aspect of the classical maxmin fairness fixedpath problem is investigated. The considered (multicriteria) optimization problem is almost identical to the continuousflow 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 NPhard). Through comparison with the closely related continuousflow 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... (More)
 In this paper a new aspect of the classical maxmin fairness fixedpath problem is investigated. The considered (multicriteria) optimization problem is almost identical to the continuousflow 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 NPhard). Through comparison with the closely related continuousflow 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 mixedinteger programs. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/403931
 author
 Nilsson, Pål ^{LU} and Pioro, Michal ^{LU}
 organization
 publishing date
 2006
 type
 Chapter in Book/Report/Conference proceeding
 publication status
 published
 subject
 keywords
 network optimization, maxmin fairness, modular flows
 host publication
 Networking 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. Proceedings / Lecture Notes in Computer Science
 volume
 3976
 pages
 916  927
 publisher
 Springer
 conference name
 5th International IFIPTC6 Networking Conference
 conference location
 Coimbra, Portugal
 conference dates
 20060515  20060519
 external identifiers

 wos:000238114800076
 scopus:33745875000
 ISSN
 16113349
 03029743
 ISBN
 9783540341925
 DOI
 10.1007/11753810_76
 language
 English
 LU publication?
 yes
 id
 b12134d9e3da44e693db37d7ad62f808 (old id 403931)
 date added to LUP
 20160401 12:25:01
 date last changed
 20210217 06:12:34
@inproceedings{b12134d9e3da44e693db37d7ad62f808, abstract = {In this paper a new aspect of the classical maxmin fairness fixedpath problem is investigated. The considered (multicriteria) optimization problem is almost identical to the continuousflow 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 NPhard). Through comparison with the closely related continuousflow 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 mixedinteger programs.}, author = {Nilsson, Pål and Pioro, Michal}, booktitle = {Networking 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. Proceedings / Lecture Notes in Computer Science}, isbn = {9783540341925}, issn = {16113349}, language = {eng}, pages = {916927}, publisher = {Springer}, title = {Maxmin fair distribution of modular network flows on fixed paths}, url = {http://dx.doi.org/10.1007/11753810_76}, doi = {10.1007/11753810_76}, volume = {3976}, year = {2006}, }