{"title":"采用固定波长收发器的多跳光网络设计","authors":"Sheau-Ru Tong, Darren Du","doi":"10.1109/GLOCOM.1994.513033","DOIUrl":null,"url":null,"abstract":"It has been recognized that the wavelength division multiplexing (WDM) scheme is one of the most promising ways to exploit the enormous bandwidth in a single mode optical fiber. We focus on using fixed wavelength transmitters and fixed wavelength receivers (which are considered to be more economically and technically feasible) to construct wavelength and time division multiplexed (WTDM) networks based on passive star couplers. We present some general principles used to construct such networks based on regular graphs. In particular, we discuss how to apply the principles to the following well-known regular graphs: perfect shuffle, generalized perfect shuffle and hypercube. The proposed algorithm supports a wider range of design alternatives than most of the previously proposed schemes.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Designing multi-hop optical networks using fixed wavelength transceivers\",\"authors\":\"Sheau-Ru Tong, Darren Du\",\"doi\":\"10.1109/GLOCOM.1994.513033\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It has been recognized that the wavelength division multiplexing (WDM) scheme is one of the most promising ways to exploit the enormous bandwidth in a single mode optical fiber. We focus on using fixed wavelength transmitters and fixed wavelength receivers (which are considered to be more economically and technically feasible) to construct wavelength and time division multiplexed (WTDM) networks based on passive star couplers. We present some general principles used to construct such networks based on regular graphs. In particular, we discuss how to apply the principles to the following well-known regular graphs: perfect shuffle, generalized perfect shuffle and hypercube. The proposed algorithm supports a wider range of design alternatives than most of the previously proposed schemes.\",\"PeriodicalId\":323626,\"journal\":{\"name\":\"1994 IEEE GLOBECOM. Communications: The Global Bridge\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-11-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1994 IEEE GLOBECOM. Communications: The Global Bridge\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.1994.513033\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1994 IEEE GLOBECOM. Communications: The Global Bridge","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.1994.513033","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Designing multi-hop optical networks using fixed wavelength transceivers
It has been recognized that the wavelength division multiplexing (WDM) scheme is one of the most promising ways to exploit the enormous bandwidth in a single mode optical fiber. We focus on using fixed wavelength transmitters and fixed wavelength receivers (which are considered to be more economically and technically feasible) to construct wavelength and time division multiplexed (WTDM) networks based on passive star couplers. We present some general principles used to construct such networks based on regular graphs. In particular, we discuss how to apply the principles to the following well-known regular graphs: perfect shuffle, generalized perfect shuffle and hypercube. The proposed algorithm supports a wider range of design alternatives than most of the previously proposed schemes.