{"id":"https://openalex.org/W4234214763","doi":"https://doi.org/10.1109/pads.2003.1207427","title":"Reducing the size of routing tables for large-scale network simulation","display_name":"Reducing the size of routing tables for large-scale network simulation","publication_year":2004,"publication_date":"2004-02-03","ids":{"openalex":"https://openalex.org/W4234214763","doi":"https://doi.org/10.1109/pads.2003.1207427"},"language":"en","primary_location":{"id":"doi:10.1109/pads.2003.1207427","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pads.2003.1207427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Seventeenth Workshop on Parallel and Distributed Simulation, 2003. (PADS 2003). Proceedings.","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/A5053113350","display_name":"Akihito Hiromori","orcid":"https://orcid.org/0000-0002-3738-2415"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"A. Hiromori","raw_affiliation_strings":["Graduate School of Engineering Science, Osaka University, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering Science, Osaka University, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084448172","display_name":"Hirozumi Yamaguchi","orcid":"https://orcid.org/0000-0003-2273-4876"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"H. Yamaguchi","raw_affiliation_strings":["Graduate School of Information Science and Technology, Osaka University, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Osaka University, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019740585","display_name":"Keiichi Yasumoto","orcid":"https://orcid.org/0000-0003-1579-3237"},"institutions":[{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"K. Yasumoto","raw_affiliation_strings":["Graduate School of Information Science, Nara Institute of Science and Technology, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science, Nara Institute of Science and Technology, Japan","institution_ids":["https://openalex.org/I75917431"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086780937","display_name":"T. Higashino","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"T. Higashino","raw_affiliation_strings":["Graduate School of Information Science and Technology, Osaka University, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Osaka University, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091039538","display_name":"K. Taniguchi","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"K. Taniguchi","raw_affiliation_strings":["Graduate School of Information Science and Technology, Osaka University, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Osaka University, Japan","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5053113350"],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":0.2318,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.68170803,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"115","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9969000220298767,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9955000281333923,"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/routing-table","display_name":"Routing table","score":0.8369154930114746},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.7662559151649475},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7188374996185303},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.6841720938682556},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.6222008466720581},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5830788612365723},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.569707453250885},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.559988796710968},{"id":"https://openalex.org/keywords/enhanced-interior-gateway-routing-protocol","display_name":"Enhanced Interior Gateway Routing Protocol","score":0.519818902015686},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.47323405742645264},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4243784546852112},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4229309856891632},{"id":"https://openalex.org/keywords/hierarchical-routing","display_name":"Hierarchical routing","score":0.4185437262058258},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37743645906448364},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.25118085741996765}],"concepts":[{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.8369154930114746},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.7662559151649475},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7188374996185303},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.6841720938682556},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.6222008466720581},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5830788612365723},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.569707453250885},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.559988796710968},{"id":"https://openalex.org/C87044965","wikidata":"https://www.wikidata.org/wiki/Q1091139","display_name":"Enhanced Interior Gateway Routing Protocol","level":5,"score":0.519818902015686},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.47323405742645264},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4243784546852112},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4229309856891632},{"id":"https://openalex.org/C177818476","wikidata":"https://www.wikidata.org/wiki/Q12878103","display_name":"Hierarchical routing","level":5,"score":0.4185437262058258},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37743645906448364},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.25118085741996765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pads.2003.1207427","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pads.2003.1207427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Seventeenth Workshop on Parallel and Distributed Simulation, 2003. (PADS 2003). Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W30169036","https://openalex.org/W1917569681","https://openalex.org/W2031849950","https://openalex.org/W2062939617","https://openalex.org/W2127654839","https://openalex.org/W2145198503","https://openalex.org/W2156916299","https://openalex.org/W2171313289","https://openalex.org/W4241531936","https://openalex.org/W6601242463"],"related_works":["https://openalex.org/W2155400411","https://openalex.org/W2351097701","https://openalex.org/W4390546506","https://openalex.org/W2138324936","https://openalex.org/W2162880363","https://openalex.org/W2141748222","https://openalex.org/W1973373960","https://openalex.org/W2352609928","https://openalex.org/W4221115949","https://openalex.org/W2295462489"],"abstract_inverted_index":{"In":[0,163],"simulating":[1],"large-scale":[2],"networks,":[3],"due":[4],"to":[5,34,39,110,165,204],"the":[6,13,16,19,32,55,83,87,112,134,152,158,167,170,185,199,202,208],"limitation":[7],"of":[8,15,21,57,114,136,151,169,184,201,207],"available":[9],"resources":[10],"on":[11],"computers,":[12],"size":[14,113,168,200],"networks":[17],"and":[18,142],"scale":[20],"simulation":[22],"scenarios":[23],"are":[24,37,92,103],"often":[25],"restricted.":[26],"Especially,":[27],"routing":[28,46,61,75,101,115,119,125,131,139,145,155,160,171,177,187,210],"tables,":[29,76],"which":[30],"indicate":[31],"directions":[33],"forward":[35],"packets,":[36],"considered":[38],"consume":[40],"memory":[41],"space.":[42],"A":[43],"simple":[44,124],"general":[45,123,144,154],"table":[47,132,141,156,179,203,211],"requires":[48,70],"O(N/sup":[49],"2/)":[50],"space":[51,72],"where":[52],"N":[53],"is":[54],"number":[56],"nodes.":[58],"An":[59],"algorithmic":[60,138,159],"approach":[62],"recently":[63],"proposed":[64],"by":[65,147],"Heung":[66],"et":[67],"al.":[68],"only":[69],"O(N)":[71],"for":[73],"representing":[74],"however":[77],"this":[78],"can":[79],"be":[80],"applied":[81],"in":[82,94,212],"case":[84],"that":[85,180,194],"all":[86],"routes":[88],"between":[89],"two":[90],"nodes":[91],"contained":[93],"a":[95,107,122,130,143,149,175],"spanning":[96],"tree":[97],"(i.e.":[98],"very":[99],"limited":[100],"strategies":[102],"allowed).":[104],"We":[105],"propose":[106],"new":[108],"method":[109,128,196],"reduce":[111,166,198],"tables":[116],"under":[117],"any":[118],"strategy.":[120],"Given":[121],"table,":[126,146,172],"our":[127,195],"represents":[129,181],"as":[133],"combination":[135],"an":[137],"based":[140,161,178],"translating":[148],"part":[150,183],"given":[153,186,209],"into":[157],"one.":[162],"order":[164],"we":[173],"find":[174],"(near-optimal)algorithmic":[176],"most":[182],"table.":[188],"Our":[189],"experimental":[190],"results":[191],"have":[192],"shown":[193],"could":[197],"10":[205],"%":[206],"hierarchical":[213],"networks.":[214]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}