{"id":"https://openalex.org/W2963400974","doi":"https://doi.org/10.1109/infocom.2019.8737475","title":"Network Interdiction Using Adversarial Traffic Flows","display_name":"Network Interdiction Using Adversarial Traffic Flows","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2963400974","doi":"https://doi.org/10.1109/infocom.2019.8737475","mag":"2963400974"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2019.8737475","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","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/A5049286032","display_name":"Xinzhe Fu","orcid":"https://orcid.org/0000-0002-4425-3881"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xinzhe Fu","raw_affiliation_strings":["Lab for Information and Decision Systems, MIT"],"affiliations":[{"raw_affiliation_string":"Lab for Information and Decision Systems, MIT","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036587377","display_name":"Eytan Modiano","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eytan Modiano","raw_affiliation_strings":["Lab for Information and Decision Systems, MIT"],"affiliations":[{"raw_affiliation_string":"Lab for Information and Decision Systems, MIT","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049286032"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0057,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.7633384,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1765","last_page":"1773"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T10400","display_name":"Network Security and Intrusion Detection","score":0.994700014591217,"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/T10917","display_name":"Smart Grid Security and Resilience","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/interdiction","display_name":"Interdiction","score":0.9787263870239258},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.746448278427124},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6269384622573853},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6165801286697388},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5457186698913574},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4786611497402191},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4385874569416046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23890531063079834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1717590093612671},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07435241341590881}],"concepts":[{"id":"https://openalex.org/C124119293","wikidata":"https://www.wikidata.org/wiki/Q6046081","display_name":"Interdiction","level":2,"score":0.9787263870239258},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.746448278427124},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6269384622573853},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6165801286697388},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5457186698913574},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4786611497402191},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4385874569416046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23890531063079834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1717590093612671},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07435241341590881},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2019.8737475","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","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":31,"referenced_works":["https://openalex.org/W150908699","https://openalex.org/W1738845896","https://openalex.org/W1762430620","https://openalex.org/W1885568428","https://openalex.org/W1986538507","https://openalex.org/W1990818816","https://openalex.org/W1993072051","https://openalex.org/W1996684664","https://openalex.org/W2014731493","https://openalex.org/W2049776854","https://openalex.org/W2072919599","https://openalex.org/W2110438635","https://openalex.org/W2114866901","https://openalex.org/W2133494553","https://openalex.org/W2144824278","https://openalex.org/W2151239055","https://openalex.org/W2229536649","https://openalex.org/W2329063814","https://openalex.org/W2338905098","https://openalex.org/W2396284287","https://openalex.org/W2401610261","https://openalex.org/W2592577925","https://openalex.org/W2611804663","https://openalex.org/W2963400974","https://openalex.org/W3217684393","https://openalex.org/W4251616545","https://openalex.org/W4300076045","https://openalex.org/W6636851552","https://openalex.org/W6637924259","https://openalex.org/W6703734804","https://openalex.org/W6844382842"],"related_works":["https://openalex.org/W2133494553","https://openalex.org/W1994906718","https://openalex.org/W1492547505","https://openalex.org/W3036854098","https://openalex.org/W2926530173","https://openalex.org/W1993745812","https://openalex.org/W1996684664","https://openalex.org/W2169965921","https://openalex.org/W2614296109","https://openalex.org/W321473709"],"abstract_inverted_index":{"Traditional":[0],"network":[1,16,20,31,72,91,144],"interdiction":[2,32,43,60,125],"refers":[3],"to":[4,11,133],"the":[5,13,42,57,63,69,77,90,114,117,122,129,135,141,156,169,178,181],"problem":[6,78],"of":[7,15,68,71,116,140,143,180],"an":[8,97,151],"interdictor":[9,64],"trying":[10],"reduce":[12],"throughput":[14],"users":[17,145],"by":[18],"removing":[19],"edges.":[21],"In":[22],"this":[23,52],"paper,":[24],"we":[25,54,120,176],"propose":[26,96],"a":[27,101,160],"new":[28],"paradigm":[29],"for":[30,109,168],"that":[33,76,99,154,187],"models":[34],"scenarios,":[35],"such":[36],"as":[37],"stealth":[38],"DoS":[39],"attack,":[40],"where":[41,62,137],"is":[44,79,86,92,146],"performed":[45],"through":[46,112,184],"injecting":[47],"adversarial":[48],"traffic":[49],"flows.":[50],"Under":[51],"paradigm,":[53],"first":[55],"study":[56],"deterministic":[58],"flow":[59,124,173],"problem,":[61,126],"has":[65],"perfect":[66],"knowledge":[67,139],"operation":[70,142],"users.":[73],"We":[74,94,149],"show":[75],"highly":[80],"inapproximable":[81],"on":[82],"general":[83],"networks":[84,111],"and":[85,105,193],"NP-hard":[87],"even":[88],"when":[89],"acyclic.":[93],"then":[95],"algorithm":[98],"achieves":[100],"logarithmic":[102],"approximation":[103,152,166],"ratio":[104,167],"quasi-polynomial":[106,161],"time":[107,162],"complexity":[108],"acyclic":[110],"harnessing":[113],"submodularity":[115],"problem.":[118],"Next,":[119],"investigate":[121],"robust":[123,130,172],"which":[127],"adopts":[128],"optimization":[131],"framework":[132,153],"capture":[134],"case":[136],"definitive":[138],"not":[147],"available.":[148],"design":[150],"integrates":[155],"aforementioned":[157],"algorithm,":[158],"yielding":[159],"procedure":[163],"with":[164],"poly-logarithmic":[165],"more":[170],"challenging":[171],"interdiction.":[174],"Finally,":[175],"evaluate":[177],"performance":[179],"proposed":[182],"algorithms":[183],"simulations,":[185],"showing":[186],"they":[188],"can":[189],"be":[190],"efficiently":[191],"implemented":[192],"yield":[194],"near-optimal":[195],"solutions.":[196]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}