{"id":"https://openalex.org/W2169258684","doi":"https://doi.org/10.1109/ispan.2002.1004296","title":"Routing algorithms based on 2D turn model for irregular networks","display_name":"Routing algorithms based on 2D turn model for irregular networks","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2169258684","doi":"https://doi.org/10.1109/ispan.2002.1004296","mag":"2169258684"},"language":"en","primary_location":{"id":"doi:10.1109/ispan.2002.1004296","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2002.1004296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","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/A5083694130","display_name":"Akiya Jouraku","orcid":"https://orcid.org/0000-0003-3264-8293"},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"A. Jouraku","raw_affiliation_strings":["Department of Computer Science, Keio University, Yokohama, Kanagawa, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Keio University, Yokohama, Kanagawa, Japan","institution_ids":["https://openalex.org/I203951103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029236003","display_name":"Michihiro Koibuchi","orcid":"https://orcid.org/0000-0002-5790-6992"},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"M. Koibuchi","raw_affiliation_strings":["Department of Computer Science, Keio University, Yokohama, Kanagawa, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Keio University, Yokohama, Kanagawa, Japan","institution_ids":["https://openalex.org/I203951103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040819990","display_name":"H. Amano","orcid":"https://orcid.org/0000-0002-3473-9861"},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"H. Amano","raw_affiliation_strings":["Department of Computer Science, Keio University, Yokohama, Kanagawa, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Keio University, Yokohama, Kanagawa, Japan","institution_ids":["https://openalex.org/I203951103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008451312","display_name":"Akira Funahashi","orcid":"https://orcid.org/0000-0003-0605-239X"},"institutions":[{"id":"https://openalex.org/I178574317","display_name":"Mie University","ror":"https://ror.org/01529vy56","country_code":"JP","type":"education","lineage":["https://openalex.org/I178574317"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"A. Funahashi","raw_affiliation_strings":["Department of Information Technology, Mie University, Tsu, Mie, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Mie University, Tsu, Mie, Japan","institution_ids":["https://openalex.org/I178574317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2363,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.90745064,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"289","last_page":"294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10829","display_name":"Interconnection Networks and Systems","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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9973999857902527,"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.7575325965881348},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6307364702224731},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.5928434133529663},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.5794838070869446},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.4814669191837311},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4542144536972046},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.45371943712234497},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43007487058639526},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.42901116609573364},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4289408326148987},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4129381477832794},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3974945545196533},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.31601956486701965},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2315305769443512},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22927743196487427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13743171095848083},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08478140830993652}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7575325965881348},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6307364702224731},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.5928434133529663},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.5794838070869446},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.4814669191837311},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4542144536972046},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.45371943712234497},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43007487058639526},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.42901116609573364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4289408326148987},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4129381477832794},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3974945545196533},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.31601956486701965},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2315305769443512},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22927743196487427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13743171095848083},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08478140830993652},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ispan.2002.1004296","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2002.1004296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.97.2385","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.2385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.am.ics.keio.ac.jp/proj/anlys/papers/ispan2002.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W88846403","https://openalex.org/W1949921224","https://openalex.org/W2114728910","https://openalex.org/W2124906592","https://openalex.org/W4245160202","https://openalex.org/W6678657297"],"related_works":["https://openalex.org/W2385464299","https://openalex.org/W197644627","https://openalex.org/W2385257642","https://openalex.org/W1483137897","https://openalex.org/W2151115859","https://openalex.org/W2384996194","https://openalex.org/W2382755934","https://openalex.org/W2120409457","https://openalex.org/W2352141937","https://openalex.org/W2559324914"],"abstract_inverted_index":{"In":[0],"order":[1],"to":[2],"solve":[3],"traffic":[4,38],"unbalancing":[5],"caused":[6],"by":[7,40],"up*/down*":[8],"routing":[9,24],"for":[10,45],"irregular":[11],"networks,":[12],"a":[13,19,28],"2D":[14,29],"direction":[15],"is":[16],"introduced":[17],"into":[18],"spanning":[20],"tree,":[21],"and":[22,58],"novel":[23],"algorithms":[25,36,53],"based":[26],"on":[27],"turn":[30],"model":[31],"are":[32],"proposed.":[33],"The":[34],"proposed":[35,52],"improve":[37,54],"balancing":[39],"carefully":[41],"selecting":[42],"prohibited":[43],"turns":[44],"deadlock-freedom.":[46],"Simulation":[47],"results":[48],"demonstrate":[49],"that":[50],"the":[51,56,59,62],"both":[55],"performance":[57],"stability":[60],"of":[61],"networks.":[63]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}