{"title":"Spanning tree algorithm for routing in hierarchical MANs","authors":"S. Casale, V. Catania, A. Puliafito, L. Vita","doi":"10.1109/MELCON.1989.50133","DOIUrl":null,"url":null,"abstract":"The authors present a hierarchical three-level MAN (metropolitan area network) which is capable of interconnecting a large number of LANs (local area networks). They also propose a routing strategy based on a spanning-tree-type algorithm which allows optimization of reconfiguration times thanks to the possibility of selective network reconfiguration, and a limited extension of the filtering database, even in networks of metropolitan dimensions. A possible implementation of the MAN is suggested.<<ETX>>","PeriodicalId":380214,"journal":{"name":"Proceedings. Electrotechnical Conference Integrating Research, Industry and Education in Energy and Communication Engineering',","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Electrotechnical Conference Integrating Research, Industry and Education in Energy and Communication Engineering',","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MELCON.1989.50133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
The authors present a hierarchical three-level MAN (metropolitan area network) which is capable of interconnecting a large number of LANs (local area networks). They also propose a routing strategy based on a spanning-tree-type algorithm which allows optimization of reconfiguration times thanks to the possibility of selective network reconfiguration, and a limited extension of the filtering database, even in networks of metropolitan dimensions. A possible implementation of the MAN is suggested.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
