{"title":"Multi-log/sub 2/N self-routing networks and their applications in high speed electronic and photonic switching systems","authors":"C. Lea","doi":"10.1109/INFCOM.1989.101538","DOIUrl":null,"url":null,"abstract":"A novel class of switching networks has been proposed to remove the time and space bottlenecks in conventional RAM-controlled switching architectures. The proposed networks possess many desirable characteristics for high-speed electronic and photonic switching systems, such as tolerance of faults, O(log/sub 2/N) stages between each inlet-outlet pair, self-routing capability, easy path hunt and easy fault diagnosis. Graph theory provides the basis for the proposed networks. It is shown that the key problem in the construction of this class of networks is related to the coloring problem in graph theory.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1989.101538","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
A novel class of switching networks has been proposed to remove the time and space bottlenecks in conventional RAM-controlled switching architectures. The proposed networks possess many desirable characteristics for high-speed electronic and photonic switching systems, such as tolerance of faults, O(log/sub 2/N) stages between each inlet-outlet pair, self-routing capability, easy path hunt and easy fault diagnosis. Graph theory provides the basis for the proposed networks. It is shown that the key problem in the construction of this class of networks is related to the coloring problem in graph theory.<>