{"id":"https://openalex.org/W2256834551","doi":"https://doi.org/10.1587/transcom.2015ebp3203","title":"Towards Route Dynamics in AS-Level Path Prediction","display_name":"Towards Route Dynamics in AS-Level Path Prediction","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2256834551","doi":"https://doi.org/10.1587/transcom.2015ebp3203","mag":"2256834551"},"language":"en","primary_location":{"id":"doi:10.1587/transcom.2015ebp3203","is_oa":false,"landing_page_url":"https://doi.org/10.1587/transcom.2015ebp3203","pdf_url":null,"source":{"id":"https://openalex.org/S2493627025","display_name":"IEICE Transactions on Communications","issn_l":"0916-8516","issn":["0916-8516","1745-1345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Communications","raw_type":"journal-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/A5037817436","display_name":"Shen Su","orcid":"https://orcid.org/0000-0003-2744-3584"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shen SU","raw_affiliation_strings":["Harbin Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113587199","display_name":"Binxing Fang","orcid":null},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Binxing FANG","raw_affiliation_strings":["Harbin Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology","institution_ids":["https://openalex.org/I204983213"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037817436"],"corresponding_institution_ids":["https://openalex.org/I204983213"],"apc_list":null,"apc_paid":null,"fwci":0.4285,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.76987102,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"E99.B","issue":"2","first_page":"412","last_page":"421"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.989799976348877,"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"}},"topics":[{"id":"https://openalex.org/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.989799976348877,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9884999990463257,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9745000004768372,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8705184459686279},{"id":"https://openalex.org/keywords/border-gateway-protocol","display_name":"Border Gateway Protocol","score":0.7134177684783936},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.6221190690994263},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.5920934081077576},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5224332213401794},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49692395329475403},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4940360188484192},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4924376904964447},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4779486656188965},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4529425799846649},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4488056004047394},{"id":"https://openalex.org/keywords/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.43917766213417053},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.42285627126693726},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.41342929005622864}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8705184459686279},{"id":"https://openalex.org/C178086212","wikidata":"https://www.wikidata.org/wiki/Q11155","display_name":"Border Gateway Protocol","level":5,"score":0.7134177684783936},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.6221190690994263},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.5920934081077576},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5224332213401794},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49692395329475403},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4940360188484192},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4924376904964447},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4779486656188965},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4529425799846649},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4488056004047394},{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.43917766213417053},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.42285627126693726},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.41342929005622864},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1587/transcom.2015ebp3203","is_oa":false,"landing_page_url":"https://doi.org/10.1587/transcom.2015ebp3203","pdf_url":null,"source":{"id":"https://openalex.org/S2493627025","display_name":"IEICE Transactions on Communications","issn_l":"0916-8516","issn":["0916-8516","1745-1345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W2083793737","https://openalex.org/W2085963983","https://openalex.org/W2096186938","https://openalex.org/W2100415265","https://openalex.org/W2108673686","https://openalex.org/W2110318628","https://openalex.org/W2120652359","https://openalex.org/W2123117910","https://openalex.org/W2135258446","https://openalex.org/W2140590125","https://openalex.org/W2142065670","https://openalex.org/W2165126126","https://openalex.org/W2168618039","https://openalex.org/W2170920894","https://openalex.org/W3151026382","https://openalex.org/W4238334627","https://openalex.org/W4251650116","https://openalex.org/W4253139975"],"related_works":["https://openalex.org/W2369878062","https://openalex.org/W2181601090","https://openalex.org/W2541547212","https://openalex.org/W2142584761","https://openalex.org/W3127002380","https://openalex.org/W2885726394","https://openalex.org/W2117516174","https://openalex.org/W2041853321","https://openalex.org/W1483211869","https://openalex.org/W2751383119"],"abstract_inverted_index":{"Predicting":[0],"the":[1,30,54,92,110,128,139,157,168,175,185],"routing":[2,41,48,100,148,161,173],"paths":[3,74,93,111],"between":[4,170],"any":[5],"given":[6],"pair":[7],"of":[8,36,132],"Autonomous":[9],"Systems":[10],"(ASes)":[11],"is":[12],"very":[13],"useful":[14],"in":[15,75,113,130],"network":[16,79,134],"diagnosis,":[17],"traffic":[18],"engineering,":[19],"and":[20,51,97,155,174],"protocol":[21],"analysis.":[22],"Existing":[23],"methods":[24,62],"address":[25],"this":[26,99],"problem":[27],"by":[28,163],"resolving":[29],"best":[31,55],"path":[32,56,64,85,129,158],"with":[33,141],"a":[34,83],"snapshot":[35],"BGP":[37,114],"(Border":[38],"Gateway":[39],"Protocol)":[40],"tables.":[42],"However,":[43],"due":[44],"to":[45,67,102,120,126,144],"route":[46,69,106,117],"deficiencies,":[47],"policy":[49],"changes,":[50],"other":[52],"causes,":[53],"changes":[57],"over":[58],"time.":[59],"Consequently,":[60],"existing":[61],"for":[63,109],"prediction":[65,159],"fail":[66],"capture":[68],"dynamics.":[70],"To":[71],"predict":[72,127],"AS-level":[73],"dynamic":[76],"scenarios":[77],"(e.g.":[78],"failures),":[80],"we":[81,123,179],"propose":[82],"per-neighbor":[84],"ranking":[86],"model":[87,101,140,183],"based":[88],"on":[89],"how":[90],"long":[91],"have":[94],"been":[95],"used,":[96],"apply":[98],"extract":[103],"each":[104],"AS's":[105],"choice":[107,118],"configurations":[108,119],"observed":[112,177],"data.":[115],"With":[116],"multiple":[121,133],"paths,":[122,178],"are":[124],"able":[125],"case":[131],"scenarios.":[135],"We":[136],"further":[137],"build":[138],"strict":[142],"policies":[143],"ensure":[145],"our":[146,171,182],"model's":[147,172],"convergence;":[149],"formally":[150],"prove":[151],"that":[152,181],"it":[153],"converges;":[154],"discuss":[156],"capturing":[160],"dynamics":[162],"disabling":[164],"links.":[165],"By":[166],"evaluating":[167],"consistency":[169],"actually":[176],"show":[180],"outperforms":[184],"state-of-the-art":[186],"work":[187],"[4].":[188]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}