{"id":"https://openalex.org/W2291157727","doi":"https://doi.org/10.1109/glocomw.2015.7414053","title":"Parity Balancing Path Flow Decomposition and Routing","display_name":"Parity Balancing Path Flow Decomposition and Routing","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2291157727","doi":"https://doi.org/10.1109/glocomw.2015.7414053","mag":"2291157727"},"language":"en","primary_location":{"id":"doi:10.1109/glocomw.2015.7414053","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocomw.2015.7414053","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Globecom Workshops (GC Wkshps)","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/A5084888509","display_name":"Brendan Mumey","orcid":"https://orcid.org/0000-0001-7151-2124"},"institutions":[{"id":"https://openalex.org/I23732399","display_name":"Montana State University","ror":"https://ror.org/02w0trx84","country_code":"US","type":"education","lineage":["https://openalex.org/I23732399","https://openalex.org/I4210126032"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brendan Mumey","raw_affiliation_strings":["Department of Computer Science, Montana State University, Bozeman, MT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Montana State University, Bozeman, MT","institution_ids":["https://openalex.org/I23732399"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048631965","display_name":"Samareh Shahmohammadi","orcid":null},"institutions":[{"id":"https://openalex.org/I43579087","display_name":"University of Wisconsin\u2013Milwaukee","ror":"https://ror.org/031q21x57","country_code":"US","type":"education","lineage":["https://openalex.org/I43579087"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samareh Shahmohammadi","raw_affiliation_strings":["University of Wisconsin - Mikwaukee, Milwaukee, WI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin - Mikwaukee, Milwaukee, WI","institution_ids":["https://openalex.org/I43579087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110172100","display_name":"Kathryn McManus","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kathryn McManus","raw_affiliation_strings":["Stroz Friedberg, New York, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stroz Friedberg, New York, NY","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075546420","display_name":"Sean Yaw","orcid":"https://orcid.org/0000-0002-6791-2691"},"institutions":[{"id":"https://openalex.org/I23732399","display_name":"Montana State University","ror":"https://ror.org/02w0trx84","country_code":"US","type":"education","lineage":["https://openalex.org/I23732399","https://openalex.org/I4210126032"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sean Yaw","raw_affiliation_strings":["Department of Computer Science, Montana State University, Bozeman, MT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Montana State University, Bozeman, MT","institution_ids":["https://openalex.org/I23732399"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7013,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.77150996,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9990000128746033,"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.9990000128746033,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9976000189781189,"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/T10142","display_name":"Formal Methods in Verification","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.596771240234375},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5477820634841919},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4686281979084015},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4663497805595398},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46170738339424133},{"id":"https://openalex.org/keywords/data-flow-analysis","display_name":"Data-flow analysis","score":0.4249490797519684},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3384515643119812},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.27762943506240845},{"id":"https://openalex.org/keywords/data-flow-diagram","display_name":"Data flow diagram","score":0.21795427799224854},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.19796466827392578},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.06091880798339844}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.596771240234375},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5477820634841919},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4686281979084015},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4663497805595398},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46170738339424133},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.4249490797519684},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3384515643119812},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.27762943506240845},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.21795427799224854},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.19796466827392578},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.06091880798339844},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocomw.2015.7414053","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocomw.2015.7414053","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Globecom Workshops (GC Wkshps)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W2068289888","https://openalex.org/W2100699015","https://openalex.org/W2138123132","https://openalex.org/W2153776688","https://openalex.org/W2164946254","https://openalex.org/W2399312309","https://openalex.org/W2753693129","https://openalex.org/W6682597455"],"related_works":["https://openalex.org/W2380059383","https://openalex.org/W4224278052","https://openalex.org/W2063679720","https://openalex.org/W2031856784","https://openalex.org/W2018218513","https://openalex.org/W2185495545","https://openalex.org/W2075046161","https://openalex.org/W2107816610","https://openalex.org/W2409323728","https://openalex.org/W2370742329"],"abstract_inverted_index":{"We":[0,70,141],"examine":[1],"a":[2,45,80,95,116,127],"new":[3,144],"approach":[4,129],"to":[5,28,68,107,130],"finding":[6,44,131],"efficient":[7,24],"routing":[8,25,66,84],"paths":[9,26,67],"in":[10,158],"large":[11],"networks":[12,17],"(e.g.":[13],"inter-datacenter":[14],"networks).":[15],"Such":[16],"carry":[18],"many":[19],"simultaneous":[20],"data":[21],"transmissions":[22],"and":[23,99,103,148,155],"need":[27],"be":[29,39],"found":[30],"for":[31,49,58],"each":[32,59],"transmission.":[33],"One":[34],"way":[35],"this":[36,123],"problem":[37,73,88],"can":[38],"solved":[40],"is":[41,91],"by":[42],"first":[43],"multi-commodity":[46],"flow":[47,56,77,96,111,133],"solution":[48],"all":[50],"source-sink":[51],"pairs.":[52],"This":[53],"provides":[54],"traffic":[55],"information":[57],"connection":[60],"but":[61],"does":[62],"not":[63],"specify":[64],"specific":[65,87],"use.":[69],"consider":[71,90],"the":[72,92,110,113,165,171],"of":[74,83,115,119],"decomposing":[75],"these":[76],"solutions":[78,135],"into":[79],"small":[81,117],"numbers":[82],"paths.":[85],"The":[86],"we":[89,105,125],"following:":[93],"Given":[94],"with":[97,170],"source":[98],"sink":[100],"nodes":[101],"s":[102],"t,":[104],"wish":[106],"exactly":[108],"represent":[109],"as":[112],"sum":[114],"number":[118],"path":[120,139],"flows.":[121,140],"In":[122],"work,":[124],"describe":[126],"novel":[128],"good":[132],"decomposition":[134],"using":[136],"parity":[137],"balancing":[138],"present":[142],"two":[143],"algorithms":[145,167],"termed":[146],"OddCover":[147],"JointOdd-Cover":[149],"that":[150,164],"provide":[151],"theoretical":[152],"performance":[153],"guarantees":[154],"are":[156,168],"effective":[157],"practice.":[159],"Our":[160],"experimental":[161],"results":[162],"demonstrate":[163],"proposed":[166],"competitive":[169],"best":[172],"heuristic":[173],"approach.":[174]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}