{"id":"https://openalex.org/W4293901617","doi":"https://doi.org/10.1109/lcn53696.2022.9843759","title":"A Novel Frame Forwarding Algorithm for Switched Networks","display_name":"A Novel Frame Forwarding Algorithm for Switched Networks","publication_year":2022,"publication_date":"2022-08-26","ids":{"openalex":"https://openalex.org/W4293901617","doi":"https://doi.org/10.1109/lcn53696.2022.9843759"},"language":"en","primary_location":{"id":"doi:10.1109/lcn53696.2022.9843759","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn53696.2022.9843759","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5103103400","display_name":"Peter Willis","orcid":"https://orcid.org/0000-0002-3046-9155"},"institutions":[{"id":"https://openalex.org/I155173764","display_name":"Rochester Institute of Technology","ror":"https://ror.org/00v4yb702","country_code":"US","type":"education","lineage":["https://openalex.org/I155173764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Willis","raw_affiliation_strings":["Rochester Institute of Technology,School of Information,Rochester,NY,USA","School of Information, Rochester Institute of Technology, Rochester, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rochester Institute of Technology,School of Information,Rochester,NY,USA","institution_ids":["https://openalex.org/I155173764"]},{"raw_affiliation_string":"School of Information, Rochester Institute of Technology, Rochester, NY, USA","institution_ids":["https://openalex.org/I155173764"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006578310","display_name":"Nirmala Shenoy","orcid":"https://orcid.org/0000-0001-6695-3611"},"institutions":[{"id":"https://openalex.org/I155173764","display_name":"Rochester Institute of Technology","ror":"https://ror.org/00v4yb702","country_code":"US","type":"education","lineage":["https://openalex.org/I155173764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nirmala Shenoy","raw_affiliation_strings":["Rochester Institute of Technology,School of Information,Rochester,NY,USA","School of Information, Rochester Institute of Technology, Rochester, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rochester Institute of Technology,School of Information,Rochester,NY,USA","institution_ids":["https://openalex.org/I155173764"]},{"raw_affiliation_string":"School of Information, Rochester Institute of Technology, Rochester, NY, USA","institution_ids":["https://openalex.org/I155173764"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101532352","display_name":"Yin Pan","orcid":"https://orcid.org/0009-0005-2080-9522"},"institutions":[{"id":"https://openalex.org/I155173764","display_name":"Rochester Institute of Technology","ror":"https://ror.org/00v4yb702","country_code":"US","type":"education","lineage":["https://openalex.org/I155173764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yin Pan","raw_affiliation_strings":["Rochester Institute of Technology,Dept. of Computing Security,Rochester,NY,USA","Dept. of Computing Security, Rochester Institute of Technology, Rochester, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rochester Institute of Technology,Dept. of Computing Security,Rochester,NY,USA","institution_ids":["https://openalex.org/I155173764"]},{"raw_affiliation_string":"Dept. of Computing Security, Rochester Institute of Technology, Rochester, NY, USA","institution_ids":["https://openalex.org/I155173764"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101596135","display_name":"John F. Hamilton","orcid":"https://orcid.org/0009-0008-8392-9611"},"institutions":[{"id":"https://openalex.org/I155173764","display_name":"Rochester Institute of Technology","ror":"https://ror.org/00v4yb702","country_code":"US","type":"education","lineage":["https://openalex.org/I155173764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Hamilton","raw_affiliation_strings":["Rochester Institute of Technology,School of Mathematical Sciences,Rochester,NY,USA","School of Mathematical Sciences, Rochester Institute of Technology, Rochester, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rochester Institute of Technology,School of Mathematical Sciences,Rochester,NY,USA","institution_ids":["https://openalex.org/I155173764"]},{"raw_affiliation_string":"School of Mathematical Sciences, Rochester Institute of Technology, Rochester, NY, USA","institution_ids":["https://openalex.org/I155173764"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I155173764"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"220","last_page":"226"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":1.0,"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":1.0,"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/T10138","display_name":"Network Traffic and Congestion Control","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.9994000196456909,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/unicast","display_name":"Unicast","score":0.8034325838088989},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8019983768463135},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7154892086982727},{"id":"https://openalex.org/keywords/backup","display_name":"Backup","score":0.5549559593200684},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5547557473182678},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5368457436561584},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.52407306432724},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5037407279014587},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.49811291694641113},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4445537030696869},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.4277036786079407},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4197889566421509},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.34596383571624756},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.23050251603126526},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.20475292205810547},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16257208585739136},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12714967131614685},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09002450108528137}],"concepts":[{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.8034325838088989},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8019983768463135},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7154892086982727},{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.5549559593200684},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5547557473182678},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5368457436561584},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.52407306432724},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5037407279014587},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.49811291694641113},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4445537030696869},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.4277036786079407},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4197889566421509},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.34596383571624756},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.23050251603126526},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.20475292205810547},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16257208585739136},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12714967131614685},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09002450108528137},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcn53696.2022.9843759","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn53696.2022.9843759","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1972041827","https://openalex.org/W2104643391","https://openalex.org/W3110563764","https://openalex.org/W3124042157","https://openalex.org/W4232769685","https://openalex.org/W6786272334"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"Switched":[0],"networks":[1],"use":[2,17,53,101],"meshed":[3,74,78],"topologies":[4],"for":[5,88,97],"path":[6,63],"redundancy;":[7],"loop-free":[8],"frame":[9],"forwarding":[10],"paths":[11,85,103],"are":[12,50,66],"established":[13],"by":[14],"protocols":[15],"that":[16],"either":[18],"the":[19,32,54,61,117,120,138],"spanning":[20],"or":[21,29],"Dijkstra":[22],"tree":[23,33,55,75,79],"algorithms.":[24],"When":[25],"a":[26,72,94],"network":[27],"link":[28],"device":[30],"fails,":[31],"must":[34],"be":[35,60],"repaired,":[36],"leading":[37],"to":[38,52,82,100,115],"high":[39],"convergence":[40],"latencies":[41],"impacting":[42],"both":[43],"broadcast":[44,89],"and":[45,64,77,123,141],"unicast":[46,98],"traffic.":[47],"Unicast":[48],"frames":[49,99],"constrained":[51],"paths,":[56],"which":[57],"may":[58],"not":[59,67],"shortest":[62,102],"links":[65],"utilized":[68],"uniformly.":[69],"We":[70,91],"propose":[71,93],"new":[73,95],"algorithm":[76],"protocol":[80,121],"(MTP)":[81],"provide":[83],"non-looping":[84],"(with":[86],"backup)":[87,106],"frames.":[90],"also":[92],"scheme":[96],"(provisioned":[104],"with":[105,145],"between":[107],"end":[108],"devices.":[109],"A":[110],"novel":[111],"virtual":[112],"ID":[113],"technique":[114],"construct":[116],"trees":[118],"makes":[119],"robust":[122],"provides":[124],"fast":[125],"failure":[126],"recovery.":[127],"In":[128],"this":[129],"article,":[130],"we":[131],"present":[132],"implementation":[133],"details":[134],"of":[135],"MTP":[136],"on":[137],"GENI":[139],"testbed":[140],"compare":[142],"its":[143],"performance":[144],"state-of-the-art":[146],"loop-avoidance":[147],"protocols.":[148]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}