{"title":"光复用器前馈设计的改进边界","authors":"Xiaoliang Wang, Xiaohong Jiang, S. Horiguchi","doi":"10.1109/I-SPAN.2008.10","DOIUrl":null,"url":null,"abstract":"We focus on the non-conflicting design of a multistage feedforward network with optical bufferless Switch and fiber Delay Lines (SDL) to emulate an N-to-1 output buffered multiplexer supporting variable length bursts. Y. T. Chen et al. presented a sufficient condition (a bound) to guarantee the non-conflicting and FIFO properties in such a design. In this paper, we first point out the upper bound can not rise infinitely with the increase of the maximum burst length. Then, we develop a framework to construct a case which can be used to achieve a lower bound. Through simulation and performance comparison, we find the new bounds can significantly decrease the hardware cost for constructing such a feedforward SDL multiplexer while still providing the same performance guarantee as that of the old one.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Improved Bounds on the Feedfoward Design of Optical Multiplexers\",\"authors\":\"Xiaoliang Wang, Xiaohong Jiang, S. Horiguchi\",\"doi\":\"10.1109/I-SPAN.2008.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We focus on the non-conflicting design of a multistage feedforward network with optical bufferless Switch and fiber Delay Lines (SDL) to emulate an N-to-1 output buffered multiplexer supporting variable length bursts. Y. T. Chen et al. presented a sufficient condition (a bound) to guarantee the non-conflicting and FIFO properties in such a design. In this paper, we first point out the upper bound can not rise infinitely with the increase of the maximum burst length. Then, we develop a framework to construct a case which can be used to achieve a lower bound. Through simulation and performance comparison, we find the new bounds can significantly decrease the hardware cost for constructing such a feedforward SDL multiplexer while still providing the same performance guarantee as that of the old one.\",\"PeriodicalId\":305776,\"journal\":{\"name\":\"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/I-SPAN.2008.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I-SPAN.2008.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
摘要
我们专注于光无缓冲开关和光纤延迟线(SDL)的多级前馈网络的无冲突设计,以模拟支持可变长度突发的n对1输出缓冲多路复用器。Y. T. Chen等人提出了一个充分条件(界)来保证这种设计的不冲突和FIFO特性。本文首先指出,随着最大突发长度的增加,其上界不能无限上升。然后,我们开发了一个框架来构造一个可以用来实现下界的情况。通过仿真和性能比较,我们发现新的边界可以显著降低构建这种前馈SDL多路复用器的硬件成本,同时仍然提供与旧边界相同的性能保证。
Improved Bounds on the Feedfoward Design of Optical Multiplexers
We focus on the non-conflicting design of a multistage feedforward network with optical bufferless Switch and fiber Delay Lines (SDL) to emulate an N-to-1 output buffered multiplexer supporting variable length bursts. Y. T. Chen et al. presented a sufficient condition (a bound) to guarantee the non-conflicting and FIFO properties in such a design. In this paper, we first point out the upper bound can not rise infinitely with the increase of the maximum burst length. Then, we develop a framework to construct a case which can be used to achieve a lower bound. Through simulation and performance comparison, we find the new bounds can significantly decrease the hardware cost for constructing such a feedforward SDL multiplexer while still providing the same performance guarantee as that of the old one.