{"id":"https://openalex.org/W2135800242","doi":"https://doi.org/10.1109/iscc.2003.1214147","title":"On efficient max-min fair routing algorithms","display_name":"On efficient max-min fair routing algorithms","publication_year":2004,"publication_date":"2004-03-30","ids":{"openalex":"https://openalex.org/W2135800242","doi":"https://doi.org/10.1109/iscc.2003.1214147","mag":"2135800242"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2003.1214147","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2003.1214147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081391892","display_name":"Micha\u0142 Pi\u00f3ro","orcid":"https://orcid.org/0000-0002-9347-9764"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]},{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["PL","SE"],"is_corresponding":false,"raw_author_name":"M. Pioro","raw_affiliation_strings":["Department of Communication Systems, Lund University, Lund, Sweden","Institute of Telecommunications, Warsaw University of Technology, Warszawa, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communication Systems, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Institute of Telecommunications, Warsaw University of Technology, Warszawa, Poland","institution_ids":["https://openalex.org/I108403487"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111966915","display_name":"P Nilsson","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"P. Nilsson","raw_affiliation_strings":["Department of Communication Systems, Lund University, Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communication Systems, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068192154","display_name":"Eligijus Kubilinskas","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"E. Kubilinskas","raw_affiliation_strings":["Department of Communication Systems, Lund University, Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communication Systems, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016692893","display_name":"G\u00e1bor Fodor","orcid":"https://orcid.org/0000-0002-2289-3159"},"institutions":[{"id":"https://openalex.org/I1306339040","display_name":"Ericsson (Sweden)","ror":"https://ror.org/05a7rhx54","country_code":"SE","type":"company","lineage":["https://openalex.org/I1306339040"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"G. Fodor","raw_affiliation_strings":["Ericsson Research Limited, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ericsson Research Limited, Stockholm, Sweden","institution_ids":["https://openalex.org/I1306339040"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"365","last_page":"372"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.6887614727020264},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6736822128295898},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.6480405330657959},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5772186517715454},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.5607443451881409},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5546801090240479},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.45874863862991333},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45465871691703796},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42974603176116943},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.33957478404045105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23587623238563538},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22675901651382446},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.21168482303619385}],"concepts":[{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.6887614727020264},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6736822128295898},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.6480405330657959},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5772186517715454},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.5607443451881409},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5546801090240479},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.45874863862991333},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45465871691703796},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42974603176116943},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.33957478404045105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23587623238563538},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22675901651382446},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.21168482303619385},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iscc.2003.1214147","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2003.1214147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","raw_type":"proceedings-article"},{"id":"pmh:oai:lup.lub.lu.se:7a0c0cbd-8f35-44e0-a1bc-11fff3f7a671","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/612742","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W54868700","https://openalex.org/W1670635083","https://openalex.org/W1964201422","https://openalex.org/W1967102908","https://openalex.org/W1980375431","https://openalex.org/W1997231674","https://openalex.org/W2114265329","https://openalex.org/W2131956462","https://openalex.org/W2159715570","https://openalex.org/W2338905098","https://openalex.org/W2613173048","https://openalex.org/W4240896209","https://openalex.org/W6602225317","https://openalex.org/W6641519951","https://openalex.org/W6683633954"],"related_works":["https://openalex.org/W757657516","https://openalex.org/W2539097916","https://openalex.org/W2944616377","https://openalex.org/W3127002380","https://openalex.org/W2889464401","https://openalex.org/W4377970799","https://openalex.org/W2251995179","https://openalex.org/W2556128816","https://openalex.org/W2351878639","https://openalex.org/W2181601090"],"abstract_inverted_index":{"In":[0,93],"the":[1,5,21,62,70,73,82,87,120],"paper,":[2],"we":[3,96],"consider":[4],"problem":[6],"of":[7,33,42,59,72,89,134],"routing":[8,99,147],"and":[9,36,39,100,119,152],"bandwidth":[10,22,101],"allocation":[11,102],"in":[12,31,150],"networks":[13],"that":[14,20,56,90,98],"support":[15],"elastic":[16],"traffic.":[17],"We":[18,126],"assume":[19],"demand":[23,63,88],"between":[24,44],"each":[25,45],"source-destination":[26],"(S-D)":[27],"pair":[28,47],"is":[29,48,79,113,148],"specified":[30],"terms":[32],"a":[34,40,57,155],"minimum":[35,83],"maximum":[37],"value,":[38],"set":[41,58],"flows":[43,60,78],"S-D":[46,67,91],"allowed":[49],"to":[50,76,114,131],"realize":[51],"these":[52,77],"demands.":[53],"(We":[54],"say":[55],"realizes":[61],"associated":[64],"with":[65,154],"an":[66,107,141],"pair,":[68],"if":[69],"sum":[71],"bandwidths":[74],"allocated":[75],"greater":[80],"than":[81],"value":[84],"assumed":[85],"for":[86],"pair).":[92],"this":[94,135],"setting,":[95],"show":[97],"can":[103],"be":[104,115],"formulated":[105],"as":[106],"optimization":[108],"problem,":[109],"where":[110],"network":[111],"utilization":[112],"maximized":[116],"under":[117],"capacity":[118],"widely":[121],"used":[122],"max-min":[123],"fairness":[124],"constraints.":[125],"describe":[127],"three":[128],"different":[129],"algorithms":[130],"solve":[132],"variants":[133],"problem.":[136],"The":[137],"most":[138],"important":[139],"one,":[140],"efficient,":[142],"original":[143],"algorithm":[144],"assuming":[145],"multipath":[146],"studied":[149],"detail":[151],"illustrated":[153],"numerical":[156],"example.":[157]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}