{"title":"全光网络规则拓扑的比较","authors":"M. Marsan, A. Bianco, Emilio Leonardi, F. Neri","doi":"10.1109/INFCOM.1993.253251","DOIUrl":null,"url":null,"abstract":"Two regular meshed topologies are compared in terms of their possible use for implementing large all-optical wavelength routing communication networks or interconnection systems. It is assumed that the networks provide full connectivity among users and operate with either packet or circuit switching in a wavelength-division-multiplexing (WDM) environment, so that source-destination pairs are identified through a frequency and a physical path. The topologies considered are the K-dimensional bidirectional square lattice and the shuffle topology. The comparison is based on the maximum and average distance between nodes, and on the minimum number of identifiers (frequencies in the WDM comb) necessary to discriminate all source-destination pairs.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"A comparison of regular topologies for all-optical networks\",\"authors\":\"M. Marsan, A. Bianco, Emilio Leonardi, F. Neri\",\"doi\":\"10.1109/INFCOM.1993.253251\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two regular meshed topologies are compared in terms of their possible use for implementing large all-optical wavelength routing communication networks or interconnection systems. It is assumed that the networks provide full connectivity among users and operate with either packet or circuit switching in a wavelength-division-multiplexing (WDM) environment, so that source-destination pairs are identified through a frequency and a physical path. The topologies considered are the K-dimensional bidirectional square lattice and the shuffle topology. The comparison is based on the maximum and average distance between nodes, and on the minimum number of identifiers (frequencies in the WDM comb) necessary to discriminate all source-destination pairs.<<ETX>>\",\"PeriodicalId\":166966,\"journal\":{\"name\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1993.253251\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1993.253251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A comparison of regular topologies for all-optical networks
Two regular meshed topologies are compared in terms of their possible use for implementing large all-optical wavelength routing communication networks or interconnection systems. It is assumed that the networks provide full connectivity among users and operate with either packet or circuit switching in a wavelength-division-multiplexing (WDM) environment, so that source-destination pairs are identified through a frequency and a physical path. The topologies considered are the K-dimensional bidirectional square lattice and the shuffle topology. The comparison is based on the maximum and average distance between nodes, and on the minimum number of identifiers (frequencies in the WDM comb) necessary to discriminate all source-destination pairs.<>