{"id":"https://openalex.org/W2784039452","doi":"https://doi.org/10.1109/allerton.2017.8262733","title":"Distributed flow balancing over unreliable communication links","display_name":"Distributed flow balancing over unreliable communication links","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2784039452","doi":"https://doi.org/10.1109/allerton.2017.8262733","mag":"2784039452"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2017.8262733","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2017.8262733","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"article","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/A5029937345","display_name":"Apostolos I. Rikos","orcid":"https://orcid.org/0000-0002-8737-1984"},"institutions":[{"id":"https://openalex.org/I34771391","display_name":"University of Cyprus","ror":"https://ror.org/02qjrjx09","country_code":"CY","type":"education","lineage":["https://openalex.org/I34771391"]}],"countries":["CY"],"is_corresponding":true,"raw_author_name":"Apostolos I. Rikos","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus","institution_ids":["https://openalex.org/I34771391"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030551100","display_name":"Christoforos N. Hadjicostis","orcid":"https://orcid.org/0000-0002-1706-708X"},"institutions":[{"id":"https://openalex.org/I34771391","display_name":"University of Cyprus","ror":"https://ror.org/02qjrjx09","country_code":"CY","type":"education","lineage":["https://openalex.org/I34771391"]}],"countries":["CY"],"is_corresponding":false,"raw_author_name":"Christoforos N. Hadjicostis","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus","institution_ids":["https://openalex.org/I34771391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029937345"],"corresponding_institution_ids":["https://openalex.org/I34771391"],"apc_list":null,"apc_paid":null,"fwci":0.4144,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68442668,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"165","last_page":"172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9976999759674072,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9817000031471252,"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/computer-science","display_name":"Computer science","score":0.6987189054489136},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6844658851623535},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5760168433189392},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5611264705657959},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5605331659317017},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5281327366828918},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5128181576728821},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5071401596069336},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4380246698856354},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4211430549621582},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.39872488379478455},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34136462211608887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2551012933254242},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21489134430885315},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18432649970054626},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08032292127609253}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6987189054489136},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6844658851623535},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5760168433189392},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5611264705657959},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5605331659317017},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5281327366828918},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5128181576728821},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5071401596069336},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4380246698856354},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4211430549621582},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.39872488379478455},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34136462211608887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2551012933254242},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21489134430885315},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18432649970054626},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08032292127609253},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2017.8262733","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2017.8262733","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1966037807","https://openalex.org/W1969847947","https://openalex.org/W1986517672","https://openalex.org/W2034269606","https://openalex.org/W2036939027","https://openalex.org/W2040933229","https://openalex.org/W2074796812","https://openalex.org/W2094813068","https://openalex.org/W2122205547","https://openalex.org/W2124379958","https://openalex.org/W2126895748","https://openalex.org/W2139638440","https://openalex.org/W2157529519","https://openalex.org/W2165956524","https://openalex.org/W2568011532","https://openalex.org/W2570645601","https://openalex.org/W2611515161","https://openalex.org/W3044238769","https://openalex.org/W3106753174"],"related_works":["https://openalex.org/W2038088825","https://openalex.org/W1975203667","https://openalex.org/W2370328482","https://openalex.org/W4287882779","https://openalex.org/W2046896701","https://openalex.org/W2140169421","https://openalex.org/W2034343496","https://openalex.org/W1969477020","https://openalex.org/W2588283177","https://openalex.org/W1562183146"],"abstract_inverted_index":{"We":[0,67,107,135,183],"consider":[1],"the":[2,48,51,54,58,61,64,83,148,167,174,189,194],"distributed":[3,70],"flow-balancing":[4],"problem":[5],"in":[6,74,79,118,123,160],"networks":[7],"of":[8,17,50,53,60,63,81,193],"nodes":[9,113,152],"that":[10,109,119],"are":[11,181],"interconnected":[12],"via":[13],"directed":[14],"edges,":[15],"each":[16,46,76],"which":[18,75],"admits":[19],"a":[20,24,69],"positive":[21,36],"flow":[22,71,155,179],"within":[23],"certain":[25,91],"interval,":[26],"captured":[27],"by":[28],"lower":[29,175],"and":[30,95,105,132,169,176,191],"upper":[31,177],"limits.":[32],"A":[33],"digraph":[34],"with":[35,157],"flows":[37,52,62,84],"on":[38,85,90,173],"its":[39,86,102],"(directed)":[40],"edges":[41,56,88],"is":[42,78,114],"flow-balanced":[43],"if,":[44],"for":[45],"node,":[47],"sum":[49,59],"incoming":[55],"equals":[57],"outgoing":[65,87],"edges.":[66],"develop":[68],"balancing":[72],"algorithm":[73,150],"node":[77],"charge":[80],"updating":[82],"based":[89],"values":[92],"it":[93,120],"maintains":[94],"updates,":[96],"using":[97],"corresponding":[98],"information":[99],"available":[100],"from":[101],"immediate":[103],"in-":[104],"out-neighbors.":[106],"assume":[108],"communication":[110,130,140],"between":[111,128],"neighboring":[112],"bidirectional,":[115],"but":[116],"unreliable":[117],"may":[121],"result":[122],"possible":[124],"packet":[125],"drops,":[126],"independently":[127],"different":[129],"links":[131,141],"link":[133],"directions.":[134],"show":[136],"that,":[137],"even":[138],"when":[139],"drop":[142],"packets":[143],"occasionally":[144],"(but":[145],"not":[146],"always),":[147],"proposed":[149,195],"allows":[151],"to":[153,187],"reach":[154],"balancing,":[156],"probability":[158],"one,":[159],"an":[161],"asymptotic":[162],"fashion,":[163],"as":[164,166],"long":[165],"necessary":[168],"sufficient":[170],"circulation":[171],"conditions":[172],"edge":[178],"limits":[180],"satisfied.":[182],"also":[184],"provide":[185],"examples":[186],"illustrate":[188],"operation":[190],"performance":[192],"algorithm.":[196]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
