{"id":"https://openalex.org/W2169672400","doi":"https://doi.org/10.1109/cit.2008.4594749","title":"An approach to select the best spanning tree in Metro Ethernet networks","display_name":"An approach to select the best spanning tree in Metro Ethernet networks","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W2169672400","doi":"https://doi.org/10.1109/cit.2008.4594749","mag":"2169672400"},"language":"en","primary_location":{"id":"doi:10.1109/cit.2008.4594749","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cit.2008.4594749","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 8th IEEE International Conference on Computer and Information Technology","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/A5063309157","display_name":"Ghasem Mirjalily","orcid":"https://orcid.org/0000-0002-6380-4167"},"institutions":[{"id":"https://openalex.org/I112536369","display_name":"Yazd University","ror":"https://ror.org/02x99ac45","country_code":"IR","type":"education","lineage":["https://openalex.org/I112536369"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ghasem Mirjalily","raw_affiliation_strings":["Electrical Engineering Department, Yazd University, Yazd, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Yazd University, Yazd, Iran","institution_ids":["https://openalex.org/I112536369"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110275092","display_name":"Mohammad Hadi Karimi","orcid":null},"institutions":[{"id":"https://openalex.org/I112536369","display_name":"Yazd University","ror":"https://ror.org/02x99ac45","country_code":"IR","type":"education","lineage":["https://openalex.org/I112536369"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Hadi Karimi","raw_affiliation_strings":["Electrical Engineering Department, Yazd University, Yazd, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Yazd University, Yazd, Iran","institution_ids":["https://openalex.org/I112536369"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053894855","display_name":"Fazlollah Adibnia","orcid":"https://orcid.org/0000-0003-3366-7939"},"institutions":[{"id":"https://openalex.org/I112536369","display_name":"Yazd University","ror":"https://ror.org/02x99ac45","country_code":"IR","type":"education","lineage":["https://openalex.org/I112536369"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Fazlollah Adibnia","raw_affiliation_strings":["Electrical Engineering Department, Yazd University, Yazd, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Yazd University, Yazd, Iran","institution_ids":["https://openalex.org/I112536369"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5096894841","display_name":"Shahram Rajai","orcid":null},"institutions":[{"id":"https://openalex.org/I112536369","display_name":"Yazd University","ror":"https://ror.org/02x99ac45","country_code":"IR","type":"education","lineage":["https://openalex.org/I112536369"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Shahram Rajai","raw_affiliation_strings":["Electrical Engineering Department, Yazd University, Yazd, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Yazd University, Yazd, Iran","institution_ids":["https://openalex.org/I112536369"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3918,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.9254932,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"634","last_page":"639"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998000264167786,"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.9994000196456909,"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.9965999722480774,"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/spanning-tree","display_name":"Spanning tree","score":0.8185437917709351},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7587414383888245},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6290082335472107},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5807951092720032},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.5522791147232056},{"id":"https://openalex.org/keywords/metro-ethernet","display_name":"Metro Ethernet","score":0.5381003618240356},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5285158157348633},{"id":"https://openalex.org/keywords/ethernet","display_name":"Ethernet","score":0.5277289152145386},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5262517333030701},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.48090529441833496},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.44507771730422974},{"id":"https://openalex.org/keywords/ethernet-flow-control","display_name":"Ethernet flow control","score":0.44331657886505127},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4122031629085541},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10064521431922913},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09373050928115845},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.057599157094955444}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8185437917709351},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7587414383888245},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6290082335472107},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5807951092720032},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.5522791147232056},{"id":"https://openalex.org/C151643298","wikidata":"https://www.wikidata.org/wiki/Q3050434","display_name":"Metro Ethernet","level":4,"score":0.5381003618240356},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5285158157348633},{"id":"https://openalex.org/C172173386","wikidata":"https://www.wikidata.org/wiki/Q79984","display_name":"Ethernet","level":2,"score":0.5277289152145386},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5262517333030701},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.48090529441833496},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44507771730422974},{"id":"https://openalex.org/C68178114","wikidata":"https://www.wikidata.org/wiki/Q5403359","display_name":"Ethernet flow control","level":3,"score":0.44331657886505127},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4122031629085541},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10064521431922913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09373050928115845},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.057599157094955444},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cit.2008.4594749","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cit.2008.4594749","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 8th IEEE International Conference on Computer and Information Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320324891","display_name":"Iran Telecommunication Research Center","ror":"https://ror.org/01a3g2z22"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1479863711","https://openalex.org/W1985556463","https://openalex.org/W2007201839","https://openalex.org/W2042706982","https://openalex.org/W2076680508","https://openalex.org/W2087499500","https://openalex.org/W2091657506","https://openalex.org/W2124668033","https://openalex.org/W2129605125","https://openalex.org/W2164509805","https://openalex.org/W2299214914","https://openalex.org/W3148190347","https://openalex.org/W6669613806","https://openalex.org/W6697741210"],"related_works":["https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2099915933","https://openalex.org/W4224251989","https://openalex.org/W4220861011","https://openalex.org/W2071845176","https://openalex.org/W2387385213","https://openalex.org/W2418231958","https://openalex.org/W2307044859","https://openalex.org/W1991421283"],"abstract_inverted_index":{"Ethernet":[0,28],"networks":[1],"rely":[2],"on":[3,21,62,69,72,88,103,130,173,183],"the":[4,22,49,55,97,123,141],"so-called":[5],"spanning":[6,51,57,126,143,170],"tree":[7,58,127,171],"protocol":[8,16],"(STP)":[9],"in":[10],"order":[11],"to":[12,149,156],"prevent":[13],"loops.":[14],"This":[15,39],"imposes":[17],"a":[18,42,110,117,163,184],"severe":[19],"penalty":[20],"performance":[23],"and":[24,37,53,74,90,133,159],"scalability":[25],"of":[26,35,48,99,125,190],"Metro":[27],"networks,":[29],"since":[30],"it":[31,114,151],"makes":[32],"inefficient":[33],"use":[34],"links":[36,73],"switches.":[38,75],"paper":[40],"presents":[41],"new":[43],"scheme":[44],"that":[45],"ranks":[46],"all":[47],"possible":[50],"trees":[52],"finds":[54],"best":[56,142],"not":[59,109],"only":[60],"based":[61,68,102,129,172],"shortest":[63,91],"path":[64,92],"selection":[65],"but":[66],"also":[67],"load":[70,82,86],"balancing":[71,83,87],"Actually,":[76],"we":[77,145,187],"define":[78],"three":[79],"major":[80],"criterions:":[81],"over":[84],"links,":[85],"switches":[89],"selection.":[93],"We":[94],"can":[95,146,166],"weight":[96],"importance":[98],"each":[100],"criterion":[101],"our":[104,137,191],"goal.":[105],"Our":[106],"solution":[107],"is":[108,115,128],"replacement":[111],"for":[112,119],"STP,":[113,122],"actually":[116],"complement":[118],"it.":[120],"In":[121,136,162],"construction":[124],"switch":[131,157],"IDs":[132,158],"link":[134,160,178],"costs.":[135,161,179],"approach,":[138],"after":[139],"finding":[140],"tree,":[144],"force":[147],"STP":[148,165],"select":[150,168],"by":[152,176],"assigning":[153],"proper":[154],"values":[155],"failure,":[164],"immediately":[167],"another":[169],"its":[174],"rank":[175],"changing":[177],"Through":[180],"some":[181],"simulations":[182],"typical":[185],"network,":[186],"show":[188],"effectiveness":[189],"approach.":[192]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}