{"id":"https://openalex.org/W2920948375","doi":"https://doi.org/10.23919/ifipnetworking46909.2019.8999395","title":"Topology discovery using path interference","display_name":"Topology discovery using path interference","publication_year":2019,"publication_date":"2019-05-20","ids":{"openalex":"https://openalex.org/W2920948375","doi":"https://doi.org/10.23919/ifipnetworking46909.2019.8999395","mag":"2920948375"},"language":"en","primary_location":{"id":"doi:10.23919/ifipnetworking46909.2019.8999395","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ifipnetworking46909.2019.8999395","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IFIP Networking Conference (IFIP Networking)","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/A5110603147","display_name":"Anurag Rai","orcid":"https://orcid.org/0009-0004-7658-1945"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anurag Rai","raw_affiliation_strings":["Laboratory for Information and Decision Systems, MIT, USA","Laboratory for Information and Decision Systems, MIT, Cambridge, MD, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision Systems, MIT, USA","institution_ids":[]},{"raw_affiliation_string":"Laboratory for Information and Decision Systems, MIT, Cambridge, MD, USA","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":["Laboratory for Information and Decision Systems, MIT, USA","Laboratory for Information and Decision Systems, MIT, Cambridge, MD, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision Systems, MIT, USA","institution_ids":[]},{"raw_affiliation_string":"Laboratory for Information and Decision Systems, MIT, Cambridge, MD, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110603147"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3577,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.59166266,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9959999918937683,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9959999918937683,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9898999929428101,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9736999869346619,"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/network-topology","display_name":"Network topology","score":0.8594493865966797},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7830832004547119},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6673742532730103},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.6231927871704102},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5311305522918701},{"id":"https://openalex.org/keywords/interference","display_name":"Interference (communication)","score":0.5186866521835327},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5061396956443787},{"id":"https://openalex.org/keywords/logical-topology","display_name":"Logical topology","score":0.5031062960624695},{"id":"https://openalex.org/keywords/extension-topology","display_name":"Extension topology","score":0.4736282229423523},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4393949508666992},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3544284999370575},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34523916244506836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2675202786922455},{"id":"https://openalex.org/keywords/general-topology","display_name":"General topology","score":0.20510581135749817},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14726915955543518},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10626143217086792},{"id":"https://openalex.org/keywords/topological-space","display_name":"Topological space","score":0.08867642283439636}],"concepts":[{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.8594493865966797},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7830832004547119},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6673742532730103},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.6231927871704102},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5311305522918701},{"id":"https://openalex.org/C32022120","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference (communication)","level":3,"score":0.5186866521835327},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5061396956443787},{"id":"https://openalex.org/C117729477","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Logical topology","level":3,"score":0.5031062960624695},{"id":"https://openalex.org/C143913944","wikidata":"https://www.wikidata.org/wiki/Q5421952","display_name":"Extension topology","level":4,"score":0.4736282229423523},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4393949508666992},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3544284999370575},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34523916244506836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2675202786922455},{"id":"https://openalex.org/C129089157","wikidata":"https://www.wikidata.org/wiki/Q621550","display_name":"General topology","level":3,"score":0.20510581135749817},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14726915955543518},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10626143217086792},{"id":"https://openalex.org/C81332173","wikidata":"https://www.wikidata.org/wiki/Q179899","display_name":"Topological space","level":2,"score":0.08867642283439636},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/ifipnetworking46909.2019.8999395","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ifipnetworking46909.2019.8999395","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IFIP Networking Conference (IFIP Networking)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.4699999988079071,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1762430620","https://openalex.org/W1999288870","https://openalex.org/W2001622826","https://openalex.org/W2016348860","https://openalex.org/W2030670655","https://openalex.org/W2049287714","https://openalex.org/W2098865491","https://openalex.org/W2106860967","https://openalex.org/W2117825463","https://openalex.org/W2136110891","https://openalex.org/W2144553078","https://openalex.org/W2166692257","https://openalex.org/W2177058407"],"related_works":["https://openalex.org/W1879279916","https://openalex.org/W2011675579","https://openalex.org/W2232402608","https://openalex.org/W3151408574","https://openalex.org/W2188936290","https://openalex.org/W1995429570","https://openalex.org/W1977313940","https://openalex.org/W2367709134","https://openalex.org/W2208374148","https://openalex.org/W4385451359"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,6,12,16,22,43,54,81],"problem":[3,57],"of":[4,8],"inferring":[5],"topology":[7,55,111],"a":[9,30,89,102],"network":[10,44],"using":[11],"measurements":[13,109],"available":[14],"at":[15],"end":[17],"nodes,":[18],"without":[19],"cooperation":[20],"from":[21,84],"internal":[23],"nodes.":[24],"To":[25],"this":[26,50],"end,":[27],"we":[28,52,79],"provide":[29],"simple":[31],"method":[32],"to":[33,67,87],"obtain":[34],"path":[35],"interference":[36],"which":[37],"identifies":[38],"whether":[39],"two":[40],"paths":[41],"in":[42],"intersect":[45],"with":[46,73],"each":[47],"other.":[48],"Using":[49],"information,":[51],"formulate":[53],"inference":[56],"as":[58],"an":[59],"integer":[60],"program":[61],"and":[62,75],"develop":[63,88],"polynomial":[64],"time":[65],"algorithms":[66,86],"solve":[68],"it":[69],"optimally":[70],"for":[71,91,110],"networks":[72],"tree":[74],"ring":[76],"topologies.":[77,94],"Finally,":[78],"use":[80],"insight":[82],"developed":[83],"these":[85],"heuristic":[90,100],"identifying":[92],"general":[93],"Simulation":[95],"results":[96],"show":[97],"that":[98,106],"our":[99],"outperforms":[101],"recently":[103],"proposed":[104],"algorithm":[105],"uses":[107],"distance":[108],"discovery.":[112]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}