{"id":"https://openalex.org/W2501416127","doi":"https://doi.org/10.1109/meco.2016.7525755","title":"Paired transitions algorithm of communication links in computer networks based on subnet routing method","display_name":"Paired transitions algorithm of communication links in computer networks based on subnet routing method","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2501416127","doi":"https://doi.org/10.1109/meco.2016.7525755","mag":"2501416127"},"language":"en","primary_location":{"id":"doi:10.1109/meco.2016.7525755","is_oa":false,"landing_page_url":"https://doi.org/10.1109/meco.2016.7525755","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 5th Mediterranean Conference on Embedded Computing (MECO)","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/A5087618456","display_name":"Dmitry Perepelkin","orcid":"https://orcid.org/0000-0003-4775-5745"},"institutions":[{"id":"https://openalex.org/I4210149385","display_name":"Ryazan State Radio Engineering University","ror":"https://ror.org/04y34yk39","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210149385"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Dmitry Alexandrovich Perepelkin","raw_affiliation_strings":["Faculty of Computer Science, Ryazan State Radio Engineering University, RSREU, Russia"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Ryazan State Radio Engineering University, RSREU, Russia","institution_ids":["https://openalex.org/I4210149385"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086268918","display_name":"Ilya Yurievich Tsyganov","orcid":null},"institutions":[{"id":"https://openalex.org/I4210149385","display_name":"Ryazan State Radio Engineering University","ror":"https://ror.org/04y34yk39","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210149385"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Ilya Yurievich Tsyganov","raw_affiliation_strings":["Faculty of Computer Science, Ryazan State Radio Engineering University, RSREU, Russia"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Ryazan State Radio Engineering University, RSREU, Russia","institution_ids":["https://openalex.org/I4210149385"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087618456"],"corresponding_institution_ids":["https://openalex.org/I4210149385"],"apc_list":null,"apc_paid":null,"fwci":2.6058,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.9065027,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"2","issue":null,"first_page":"260","last_page":"263"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9995999932289124,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9995999932289124,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9890000224113464,"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.9790999889373779,"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/subnet","display_name":"Subnet","score":0.8325617909431458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7652537822723389},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7411196231842041},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5561083555221558},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4745948016643524},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4671674966812134},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.465899795293808},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4586517810821533},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.43730786442756653},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4254821538925171},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4152452349662781},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40762627124786377},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3273937702178955},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.288113534450531}],"concepts":[{"id":"https://openalex.org/C21099817","wikidata":"https://www.wikidata.org/wiki/Q7631721","display_name":"Subnet","level":2,"score":0.8325617909431458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7652537822723389},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7411196231842041},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5561083555221558},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4745948016643524},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4671674966812134},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.465899795293808},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4586517810821533},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.43730786442756653},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4254821538925171},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4152452349662781},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40762627124786377},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3273937702178955},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.288113534450531}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/meco.2016.7525755","is_oa":false,"landing_page_url":"https://doi.org/10.1109/meco.2016.7525755","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 5th Mediterranean Conference on Embedded Computing (MECO)","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":7,"referenced_works":["https://openalex.org/W2050316053","https://openalex.org/W2101364936","https://openalex.org/W2114119696","https://openalex.org/W2144056042","https://openalex.org/W2147167313","https://openalex.org/W2169718371","https://openalex.org/W6684968835"],"related_works":["https://openalex.org/W2314157120","https://openalex.org/W2382831994","https://openalex.org/W1817053572","https://openalex.org/W2371042914","https://openalex.org/W2376231728","https://openalex.org/W3015233512","https://openalex.org/W2339073167","https://openalex.org/W2978166001","https://openalex.org/W1536482519","https://openalex.org/W2349623602"],"abstract_inverted_index":{"The":[0,16,58],"majority":[1],"of":[2,35,53,60,68,79,98,105],"modern":[3],"routing":[4,54],"algorithms":[5,21,50],"in":[6,40,48],"computer":[7,41,61,81],"networks":[8],"is":[9,32],"based":[10],"on":[11,103],"Bellman-Ford":[12],"and":[13,27],"Dijkstra's":[14],"algorithms.":[15],"efforts":[17,69],"to":[18,23,65,70,89,94],"calculate":[19],"these":[20],"lead":[22],"the":[24,33,87,91,96],"complexity":[25],"O(N3)":[26],"O(N2)":[28],"correspondingly.":[29],"Here":[30],"N":[31],"number":[34],"communication":[36,45],"nodes":[37],"or":[38],"routers":[39],"network.":[42],"When":[43],"changing":[44],"links":[46],"bandwidth":[47],"given":[49],"total":[51],"recalculation":[52],"tables":[55],"takes":[56],"place.":[57],"increase":[59],"network":[62,82,99],"size":[63],"leads":[64],"polynomial":[66],"growth":[67],"perform":[71],"this":[72],"operation.":[73],"This":[74],"work":[75],"offers":[76],"theoretical":[77],"research":[78],"segmented":[80],"graph":[83,106],"model":[84],"which":[85],"gave":[86],"opportunity":[88],"develop":[90],"algorithm":[92],"allowing":[93],"reconstruct":[95],"tree":[97],"segment":[100],"best":[101],"routes":[102],"conditions":[104],"edges":[107],"weight":[108],"change.":[109]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}