有限循环数光队列的构造

Jay Cheng, Cheng-Shang Chang, Tsz-Hsuan Chao, D. Lee, Ching-Ming Lien
{"title":"有限循环数光队列的构造","authors":"Jay Cheng, Cheng-Shang Chang, Tsz-Hsuan Chao, D. Lee, Ching-Ming Lien","doi":"10.1109/INFOCOM.2008.116","DOIUrl":null,"url":null,"abstract":"Recently, there has been a lot of attention on the constructions of optical queues by using optical Switches and fiber Delay Lines (SDL). In this paper, we consider the constructions of optical queues with a limited number of recirculations through the fibers in such SDL constructions. Such a limitation on the number of recirculations comes from practical feasibility considerations, such as crosstalk, power loss, amplified spontaneous emission (ASE) from the Erbium doped fiber amplifiers (EDFA), and the pattern effect of the optical switches. We first transform the design of the fiber delays in such SDL constructions to an equivalent integer representation problem. Specifically, given 1 les k les M, we seek for an M-sequence dM 1 = (d1,d2,...,dm) of positive integers to maximize the number of consecutive integers (starting from 0) that can be represented by the C-transform relative to dM 1 such that there are at most k 1-entries in their C-transforms. Then we give a class of greedy constructions so that d1, d2,..., dM are obtained recursively and the maximum number of representable consecutive integers by using d1,d2,...,di is larger than that by using d1,d2,...,di-1 for all i. Furthermore, we obtain an explicit recursive expression for d1, d2,..., dM given by a greedy construction. Finally, we show that an optimal M-sequence (in the sense of achieving the maximum number of representable consecutive integers) can be given by a greedy construction. The solution of such an integer representation problem can be applied to the construction of optical 2-to-l FIFO multiplexers with a limited number of recirculations. We show that the complexity of searching for an optimal construction under our routing policy can be greatly reduced from exponential time to polynomial time by only considering the greedy constructions instead of performing an exhaustive search. Similar results can be obtained for linear compressors and linear decompressors with a limited number of recirculations.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"On Constructions of Optical Queues with a Limited Number of Recirculations\",\"authors\":\"Jay Cheng, Cheng-Shang Chang, Tsz-Hsuan Chao, D. Lee, Ching-Ming Lien\",\"doi\":\"10.1109/INFOCOM.2008.116\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, there has been a lot of attention on the constructions of optical queues by using optical Switches and fiber Delay Lines (SDL). In this paper, we consider the constructions of optical queues with a limited number of recirculations through the fibers in such SDL constructions. Such a limitation on the number of recirculations comes from practical feasibility considerations, such as crosstalk, power loss, amplified spontaneous emission (ASE) from the Erbium doped fiber amplifiers (EDFA), and the pattern effect of the optical switches. We first transform the design of the fiber delays in such SDL constructions to an equivalent integer representation problem. Specifically, given 1 les k les M, we seek for an M-sequence dM 1 = (d1,d2,...,dm) of positive integers to maximize the number of consecutive integers (starting from 0) that can be represented by the C-transform relative to dM 1 such that there are at most k 1-entries in their C-transforms. Then we give a class of greedy constructions so that d1, d2,..., dM are obtained recursively and the maximum number of representable consecutive integers by using d1,d2,...,di is larger than that by using d1,d2,...,di-1 for all i. Furthermore, we obtain an explicit recursive expression for d1, d2,..., dM given by a greedy construction. Finally, we show that an optimal M-sequence (in the sense of achieving the maximum number of representable consecutive integers) can be given by a greedy construction. The solution of such an integer representation problem can be applied to the construction of optical 2-to-l FIFO multiplexers with a limited number of recirculations. We show that the complexity of searching for an optimal construction under our routing policy can be greatly reduced from exponential time to polynomial time by only considering the greedy constructions instead of performing an exhaustive search. Similar results can be obtained for linear compressors and linear decompressors with a limited number of recirculations.\",\"PeriodicalId\":447520,\"journal\":{\"name\":\"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFOCOM.2008.116\",\"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 2008 - The 27th Conference on Computer Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCOM.2008.116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

近年来,利用光交换机和光纤延迟线(SDL)构建光队列的研究受到了广泛的关注。在这篇论文中,我们考虑了在这种SDL结构中通过光纤的循环次数有限的光队列的结构。这种对再循环次数的限制来自于实际可行性的考虑,如串扰、功率损耗、掺铒光纤放大器(EDFA)的放大自发发射(ASE)以及光开关的图案效应。我们首先将这种SDL结构中的光纤延迟设计转化为等效整数表示问题。具体地说,给定1个小k个小M,我们寻找一个M序列dM 1 = (d1,d2,…,dM)的正整数,以最大化连续整数(从0开始)的数量,这些整数可以用相对于dM 1的c变换来表示,使得它们的c变换中最多有k个1项。然后我们给出一类贪心构造,使得d1, d2,…, dM是递归得到的,用d1,d2,…,用d1,d2,…,对于所有i,我们得到d1, d2,…的显式递归表达式。, dM由贪心构造给出。最后,我们证明了一个最优的m序列(在达到可表示的连续整数的最大数目的意义上)可以由贪婪构造给出。这种整数表示问题的解决可以应用于具有有限循环次数的光学2对1 FIFO多路复用器的构造。我们证明了在我们的路由策略下,通过只考虑贪婪结构而不是执行穷举搜索,可以将搜索最优结构的复杂度从指数时间大大降低到多项式时间。对于循环次数有限的线性压缩机和线性减压机也可以得到类似的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Constructions of Optical Queues with a Limited Number of Recirculations
Recently, there has been a lot of attention on the constructions of optical queues by using optical Switches and fiber Delay Lines (SDL). In this paper, we consider the constructions of optical queues with a limited number of recirculations through the fibers in such SDL constructions. Such a limitation on the number of recirculations comes from practical feasibility considerations, such as crosstalk, power loss, amplified spontaneous emission (ASE) from the Erbium doped fiber amplifiers (EDFA), and the pattern effect of the optical switches. We first transform the design of the fiber delays in such SDL constructions to an equivalent integer representation problem. Specifically, given 1 les k les M, we seek for an M-sequence dM 1 = (d1,d2,...,dm) of positive integers to maximize the number of consecutive integers (starting from 0) that can be represented by the C-transform relative to dM 1 such that there are at most k 1-entries in their C-transforms. Then we give a class of greedy constructions so that d1, d2,..., dM are obtained recursively and the maximum number of representable consecutive integers by using d1,d2,...,di is larger than that by using d1,d2,...,di-1 for all i. Furthermore, we obtain an explicit recursive expression for d1, d2,..., dM given by a greedy construction. Finally, we show that an optimal M-sequence (in the sense of achieving the maximum number of representable consecutive integers) can be given by a greedy construction. The solution of such an integer representation problem can be applied to the construction of optical 2-to-l FIFO multiplexers with a limited number of recirculations. We show that the complexity of searching for an optimal construction under our routing policy can be greatly reduced from exponential time to polynomial time by only considering the greedy constructions instead of performing an exhaustive search. Similar results can be obtained for linear compressors and linear decompressors with a limited number of recirculations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信