{"id":"https://openalex.org/W2411080135","doi":"https://doi.org/10.1109/hpsr.2015.7483079","title":"Robust network flow against attackers with knowledge of routing method","display_name":"Robust network flow against attackers with knowledge of routing method","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W2411080135","doi":"https://doi.org/10.1109/hpsr.2015.7483079","mag":"2411080135"},"language":"en","primary_location":{"id":"doi:10.1109/hpsr.2015.7483079","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpsr.2015.7483079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","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/A5038811120","display_name":"Vorapong Suppakitpaisarn","orcid":"https://orcid.org/0000-0002-7020-395X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vorapong Suppakitpaisarn","raw_affiliation_strings":["JST, ERATO Kawarabayashi Large Graph Project"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"JST, ERATO Kawarabayashi Large Graph Project","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081411512","display_name":"Wenkai Dai","orcid":"https://orcid.org/0000-0002-2153-4250"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Wenkai Dai","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, Universit\u00e4t des Saarlandes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Universit\u00e4t des Saarlandes","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048185370","display_name":"Jean-Fran\u00e7ois Baffier","orcid":"https://orcid.org/0000-0002-8800-6356"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Jean-Francois Baffier","raw_affiliation_strings":["JFLI, The University of Tokyo"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"JFLI, The University of Tokyo","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","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/T10714","display_name":"Software-Defined Networks and 5G","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955000281333923,"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"}},{"id":"https://openalex.org/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7586377859115601},{"id":"https://openalex.org/keywords/router","display_name":"Router","score":0.69560706615448},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.6649069786071777},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.5652722716331482},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5420504808425903},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5339347720146179},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.49196574091911316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4902203679084778},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4715084135532379},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3355891704559326},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.33535236120224},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2690927982330322},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.17787861824035645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15705981850624084}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7586377859115601},{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.69560706615448},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6649069786071777},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.5652722716331482},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5420504808425903},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5339347720146179},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.49196574091911316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4902203679084778},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4715084135532379},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3355891704559326},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.33535236120224},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2690927982330322},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.17787861824035645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15705981850624084},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpsr.2015.7483079","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpsr.2015.7483079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","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":37,"referenced_works":["https://openalex.org/W183428525","https://openalex.org/W384533383","https://openalex.org/W1600490453","https://openalex.org/W1680189815","https://openalex.org/W1965641578","https://openalex.org/W1968540934","https://openalex.org/W1985282803","https://openalex.org/W1987032287","https://openalex.org/W1988160302","https://openalex.org/W2007662129","https://openalex.org/W2011838309","https://openalex.org/W2014774419","https://openalex.org/W2015788693","https://openalex.org/W2028926203","https://openalex.org/W2045483690","https://openalex.org/W2068289888","https://openalex.org/W2081956611","https://openalex.org/W2082707864","https://openalex.org/W2090359754","https://openalex.org/W2122205547","https://openalex.org/W2135291684","https://openalex.org/W2135615874","https://openalex.org/W2147118406","https://openalex.org/W2150453038","https://openalex.org/W2150626614","https://openalex.org/W2150700871","https://openalex.org/W2154194053","https://openalex.org/W2161556771","https://openalex.org/W2164728168","https://openalex.org/W2164946254","https://openalex.org/W2402734550","https://openalex.org/W4242651323","https://openalex.org/W6646820729","https://openalex.org/W6653067108","https://openalex.org/W6682095816","https://openalex.org/W6682521673","https://openalex.org/W6713532335"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327","https://openalex.org/W4206407367"],"abstract_inverted_index":{"Recently,":[0],"many":[1],"algorithms":[2],"are":[3],"proposed":[4],"to":[5],"find":[6,38],"a":[7,39,56,86],"communication":[8],"flow":[9,17,45,54,84],"that":[10,37,47,51,81,99],"is":[11,55,68,76,85],"robust":[12],"against":[13],"k-edges":[14],"failures.":[15],"That":[16],"can":[18,23],"be":[19],"weaker,":[20],"if":[21],"attackers":[22],"obtain":[24],"forwarding":[25,40],"information":[26],"in":[27,46],"each":[28],"router.":[29],"In":[30],"this":[31],"paper,":[32],"we":[33,79],"propose":[34],"an":[35],"algorithm":[36,41,60,88,101],"maximizing":[42],"the":[43,62,65,73,82],"remaining":[44],"situation.":[48],"We":[49],"show":[50,80,98],"Kishimoto's":[52],"multiroute":[53,83],"(k":[57],"+":[58,70],"1)-approximation":[59],"for":[61,89],"problem,":[63],"when":[64],"route":[66,74],"number":[67,75],"k":[69],"1.":[71],"When":[72],"optimally":[77],"chosen,":[78],"2-approximation":[87],"most":[90],"of":[91],"randomly":[92],"generated":[93],"graphs.":[94],"Our":[95],"experimental":[96],"results":[97],"our":[100],"has":[102],"15%-37%":[103],"better":[104],"performance":[105],"than":[106],"max-flow":[107],"algorithm.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}