{"id":"https://openalex.org/W1983754820","doi":"https://doi.org/10.1145/1644993.1645020","title":"An efficient algorithm for AS path inferring","display_name":"An efficient algorithm for AS path inferring","publication_year":2009,"publication_date":"2009-08-27","ids":{"openalex":"https://openalex.org/W1983754820","doi":"https://doi.org/10.1145/1644993.1645020","mag":"1983754820"},"language":"en","primary_location":{"id":"doi:10.1145/1644993.1645020","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1644993.1645020","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 International Conference on Hybrid Information Technology","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/A5103128087","display_name":"Yang Guo-qiang","orcid":"https://orcid.org/0009-0009-5577-3071"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Guoqiang Yang","raw_affiliation_strings":["National University of Defence Technololy, China"],"affiliations":[{"raw_affiliation_string":"National University of Defence Technololy, China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102138606","display_name":"Wenhua Dou","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenhua Dou","raw_affiliation_strings":["National University of Defence Technololy, China"],"affiliations":[{"raw_affiliation_string":"National University of Defence Technololy, China","institution_ids":["https://openalex.org/I170215575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103128087"],"corresponding_institution_ids":["https://openalex.org/I170215575"],"apc_list":null,"apc_paid":null,"fwci":0.34342244,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66341518,"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":"151","last_page":"154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9987999796867371,"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/T10400","display_name":"Network Security and Intrusion Detection","score":0.9987999796867371,"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.9986000061035156,"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"}},{"id":"https://openalex.org/T11498","display_name":"Security in Wireless Sensor Networks","score":0.996999979019165,"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.7518720626831055},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6727145910263062},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5712399482727051},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5616874694824219},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5363055467605591},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.533842921257019},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.49692776799201965},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4964492917060852},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44772791862487793},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4437444806098938},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.433794766664505},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4137963652610779},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08623149991035461}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7518720626831055},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6727145910263062},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5712399482727051},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5616874694824219},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5363055467605591},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.533842921257019},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.49692776799201965},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4964492917060852},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44772791862487793},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4437444806098938},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.433794766664505},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4137963652610779},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08623149991035461},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1644993.1645020","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1644993.1645020","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 International Conference on Hybrid Information Technology","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":15,"referenced_works":["https://openalex.org/W90432960","https://openalex.org/W1559636955","https://openalex.org/W1595451540","https://openalex.org/W2044725071","https://openalex.org/W2085963983","https://openalex.org/W2105742585","https://openalex.org/W2106600328","https://openalex.org/W2108673686","https://openalex.org/W2120514843","https://openalex.org/W2125832781","https://openalex.org/W2151972741","https://openalex.org/W2159281894","https://openalex.org/W2167242931","https://openalex.org/W3103744294","https://openalex.org/W4292414168"],"related_works":["https://openalex.org/W2089134982","https://openalex.org/W4299305030","https://openalex.org/W2040347389","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W4252842032","https://openalex.org/W2113270940","https://openalex.org/W2900627138","https://openalex.org/W3103742520","https://openalex.org/W4390579151"],"abstract_inverted_index":{"Discovering":[0],"the":[1,29,55,80,87,94,105,121],"AS":[2,36,43,51,68,74,99],"paths":[3,52,69],"between":[4],"two":[5],"ASes":[6],"is":[7,47,82,86,93,127],"invaluable":[8],"for":[9,22,63],"a":[10,71],"wide":[11],"area":[12],"of":[13,79,89,96],"network":[14],"research":[15],"and":[16,40,91,109],"application":[17],"activities.":[18],"The":[19,76,101],"traditional":[20],"techniques":[21],"path":[23],"discovery":[24],"require":[25],"direct":[26],"access":[27],"to":[28,49],"source":[30],"node.":[31],"Recently,":[32],"with":[33,120],"more":[34],"accurate":[35],"relationship":[37,72],"inferring":[38,64],"algorithm":[39,62,81,102,123],"publicly":[41],"available":[42],"topology":[44],"data,":[45],"it":[46,114],"possible":[48],"infer":[50],"without":[53],"accessing":[54],"source.":[56],"This":[57],"paper":[58],"proposes":[59],"an":[60],"efficient":[61],"all":[65],"pair":[66],"shortest":[67],"in":[70,98],"annotated":[73],"graph.":[75,100],"running":[77,116,125],"time":[78,117,126],"O(NM),":[83],"where":[84],"N":[85],"number":[88,95],"nodes":[90],"M":[92],"edges":[97],"bases":[103],"on":[104],"bread-first-search":[106],"(BFS)":[107],"algorithm,":[108],"experimental":[110],"results":[111],"show":[112],"that":[113],"reduces":[115],"dramatically":[118],"compared":[119],"existing":[122],"whose":[124],"O(N3).":[128]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}