具有最佳性能的模块化宽带(ATM)交换机架构

K. Eng, M. Karol, Chlh-Un
{"title":"具有最佳性能的模块化宽带(ATM)交换机架构","authors":"K. Eng, M. Karol, Chlh-Un","doi":"10.1109/ISS.1990.770091","DOIUrl":null,"url":null,"abstract":"This paper focuses on the generic problem of designing a large NxN (N 1000) high-performance, broadband packet (or ATM) switch. Despite recent advances in switch architectures, practical switch dimensions continue to be severely limited by both the technological and physical constraints of packaging (e.g., chip or board sizes). Here, we focus on switch growability: we provide ways to construct arbitrarily large switches out of modest-size packet switches, without sacrificing overall delay/throughput performance. We propose and study a growable switch architecture based on three key principles: (a) a Generalized Knockout Principle exploits the statistical behavior of packet arrivals and thereby reduces the interconnect complexity; (b) output queueing yields the best possible delay/throughput performance; and (c) distributed intelligence in routing packets through the interconnect fabric eliminates internal path conflicts. Other attractive features of the proposed architecture include the guarantee of first-infirst-out packet sequence, and broadcast and muldcast capabilities. In a Broadband ISDN example, we show a 2048x2048 switch configuration with building blocks of 42x16 packet switch modules and 128x128 interconnect modules, both of which fall within existing hardware capabilities. We present an upper bound on the cell loss probability for arbitrary patterns of independent cell arrivals, and show that the cell loss can be made negligibly small. For example, to guarantee less than 10/sup -9/ cell loss probability, this growable architecture requires packet switch modules ofilimension 47x16,45x16, 42xl6, and 39x16 for 100%, 90%, 80%, and 70% traffic loads, respectively.","PeriodicalId":277204,"journal":{"name":"International Symposium on Switching","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A modular braodband (ATM) switch architecture with optimum performance\",\"authors\":\"K. Eng, M. Karol, Chlh-Un\",\"doi\":\"10.1109/ISS.1990.770091\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper focuses on the generic problem of designing a large NxN (N 1000) high-performance, broadband packet (or ATM) switch. Despite recent advances in switch architectures, practical switch dimensions continue to be severely limited by both the technological and physical constraints of packaging (e.g., chip or board sizes). Here, we focus on switch growability: we provide ways to construct arbitrarily large switches out of modest-size packet switches, without sacrificing overall delay/throughput performance. We propose and study a growable switch architecture based on three key principles: (a) a Generalized Knockout Principle exploits the statistical behavior of packet arrivals and thereby reduces the interconnect complexity; (b) output queueing yields the best possible delay/throughput performance; and (c) distributed intelligence in routing packets through the interconnect fabric eliminates internal path conflicts. Other attractive features of the proposed architecture include the guarantee of first-infirst-out packet sequence, and broadcast and muldcast capabilities. In a Broadband ISDN example, we show a 2048x2048 switch configuration with building blocks of 42x16 packet switch modules and 128x128 interconnect modules, both of which fall within existing hardware capabilities. We present an upper bound on the cell loss probability for arbitrary patterns of independent cell arrivals, and show that the cell loss can be made negligibly small. For example, to guarantee less than 10/sup -9/ cell loss probability, this growable architecture requires packet switch modules ofilimension 47x16,45x16, 42xl6, and 39x16 for 100%, 90%, 80%, and 70% traffic loads, respectively.\",\"PeriodicalId\":277204,\"journal\":{\"name\":\"International Symposium on Switching\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Switching\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISS.1990.770091\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Switching","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISS.1990.770091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

本文主要研究大型NxN (n1000)高性能宽带分组交换机的设计问题。尽管开关架构最近取得了进展,但实际的开关尺寸仍然受到封装的技术和物理限制(例如,芯片或电路板尺寸)的严重限制。在这里,我们主要关注交换机的可扩展性:我们提供了在中等大小的分组交换机基础上构建任意大型交换机的方法,而不会牺牲总体延迟/吞吐量性能。我们提出并研究了一种基于三个关键原则的可增长交换机架构:(a)广义淘汰原则利用数据包到达的统计行为,从而降低了互连的复杂性;(b)输出排队产生最佳的延迟/吞吐量性能;(c)通过互连结构路由数据包的分布式智能消除了内部路径冲突。所提出的体系结构的其他吸引人的特性包括保证先入先出的分组顺序,以及广播和多播功能。在一个宽带ISDN示例中,我们展示了一个2048x2048交换机配置,其中包含42x16分组交换模块和128x128互连模块的构建块,这两个模块都属于现有硬件功能。我们给出了独立细胞到达的任意模式下细胞损失概率的上界,并表明细胞损失可以小到可以忽略不计。例如,为了保证小于10/sup -9/ cell的丢失概率,这种可增长的架构要求分组交换模块尺寸分别为47x16、45x16、42x16和39x16,分别用于100%、90%、80%和70%的流量负载。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A modular braodband (ATM) switch architecture with optimum performance
This paper focuses on the generic problem of designing a large NxN (N 1000) high-performance, broadband packet (or ATM) switch. Despite recent advances in switch architectures, practical switch dimensions continue to be severely limited by both the technological and physical constraints of packaging (e.g., chip or board sizes). Here, we focus on switch growability: we provide ways to construct arbitrarily large switches out of modest-size packet switches, without sacrificing overall delay/throughput performance. We propose and study a growable switch architecture based on three key principles: (a) a Generalized Knockout Principle exploits the statistical behavior of packet arrivals and thereby reduces the interconnect complexity; (b) output queueing yields the best possible delay/throughput performance; and (c) distributed intelligence in routing packets through the interconnect fabric eliminates internal path conflicts. Other attractive features of the proposed architecture include the guarantee of first-infirst-out packet sequence, and broadcast and muldcast capabilities. In a Broadband ISDN example, we show a 2048x2048 switch configuration with building blocks of 42x16 packet switch modules and 128x128 interconnect modules, both of which fall within existing hardware capabilities. We present an upper bound on the cell loss probability for arbitrary patterns of independent cell arrivals, and show that the cell loss can be made negligibly small. For example, to guarantee less than 10/sup -9/ cell loss probability, this growable architecture requires packet switch modules ofilimension 47x16,45x16, 42xl6, and 39x16 for 100%, 90%, 80%, and 70% traffic loads, respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Integrated switching and transmission planning in exchange - carrier networks Distributed control for a high speed optical customer premises network The poucing function in atm networks A broadband switching system for public network Advanced services for rural telephony
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1