An output queueing batcher-banyan ATM switch architecture

B. Collier, H. Kim
{"title":"An output queueing batcher-banyan ATM switch architecture","authors":"B. Collier, H. Kim","doi":"10.1109/MILCOM.1993.408501","DOIUrl":null,"url":null,"abstract":"The authors present a scalable ATM switch architecture which features output queuing with no internal speedup. The architecture takes advantage of the knockout principle to obtain tradeoff between the hardware complexity and the cell loss probability. Components of the switch include a Batcher sorter, an address resolution module, a banyan network, and output buffers. The hardware complexity of the switch, O(LNlog(LN)) where L is the number of cells allowed into an output queue in a single time slot and N is the number of ports, is comparable to the input queuing Batcher-banyan switch (O(Nlog/sup 2/N)), but performance is consistent with other more complex output queuing architectures.<<ETX>>","PeriodicalId":323612,"journal":{"name":"Proceedings of MILCOM '93 - IEEE Military Communications Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of MILCOM '93 - IEEE Military Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.1993.408501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The authors present a scalable ATM switch architecture which features output queuing with no internal speedup. The architecture takes advantage of the knockout principle to obtain tradeoff between the hardware complexity and the cell loss probability. Components of the switch include a Batcher sorter, an address resolution module, a banyan network, and output buffers. The hardware complexity of the switch, O(LNlog(LN)) where L is the number of cells allowed into an output queue in a single time slot and N is the number of ports, is comparable to the input queuing Batcher-banyan switch (O(Nlog/sup 2/N)), but performance is consistent with other more complex output queuing architectures.<>
一种输出队列批处理器-banyan ATM交换机架构
作者提出了一种可扩展的ATM交换机体系结构,其特点是输出队列没有内部加速。该体系结构利用敲除原理在硬件复杂度和小区损失概率之间取得平衡。交换机的组件包括批处理分选器、地址解析模块、榕树网络和输出缓冲区。交换机的硬件复杂性O(LNlog(LN)),其中L是在单个时隙中允许进入输出队列的单元数,N是端口数,与输入队列批处理-榕树交换机(O(Nlog/sup 2/N))相当,但性能与其他更复杂的输出队列架构一致。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信