用于快速分组交换的非阻塞网络

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI:10.1109/INFCOM.1989.101499

R. Melen, J. Turner

{"title":"用于快速分组交换的非阻塞网络","authors":"R. Melen, J. Turner","doi":"10.1109/INFCOM.1989.101499","DOIUrl":null,"url":null,"abstract":"An extension of the classical theory of nonblocking networks is identified and studied that is applicable to multirate circuit and fast packet/ATM switching systems. Conditions are determined under which the Clos, Cantor, and Benes networks are strictly nonblocking. Conditions are also determined under which the Benes network and variants of the Cantor and Clos networks are rearrangeable. It is found that strictly nonblocking operation can be obtained for multirate traffic with essentially the same complexity as in the classical context.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Nonblocking networks for fast packet switching\",\"authors\":\"R. Melen, J. Turner\",\"doi\":\"10.1109/INFCOM.1989.101499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An extension of the classical theory of nonblocking networks is identified and studied that is applicable to multirate circuit and fast packet/ATM switching systems. Conditions are determined under which the Clos, Cantor, and Benes networks are strictly nonblocking. Conditions are also determined under which the Benes network and variants of the Cantor and Clos networks are rearrangeable. It is found that strictly nonblocking operation can be obtained for multirate traffic with essentially the same complexity as in the classical context.<<ETX>>\",\"PeriodicalId\":275763,\"journal\":{\"name\":\"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1989.101499\",\"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 '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1989.101499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 21

摘要

对经典的无阻塞网络理论进行了扩展，并对其应用于多速率电路和快速分组/ATM交换系统进行了研究。确定了Clos、Cantor和Benes网络严格非阻塞的条件。贝内斯网络和康托尔网络和克洛斯网络的变体是可重新排列的条件也是确定的。我们发现，对于复杂度与经典情况基本相同的多速率流量，可以获得严格的非阻塞操作

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Nonblocking networks for fast packet switching

An extension of the classical theory of nonblocking networks is identified and studied that is applicable to multirate circuit and fast packet/ATM switching systems. Conditions are determined under which the Clos, Cantor, and Benes networks are strictly nonblocking. Conditions are also determined under which the Benes network and variants of the Cantor and Clos networks are rearrangeable. It is found that strictly nonblocking operation can be obtained for multirate traffic with essentially the same complexity as in the classical context.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies

自引率

0.00%

发文量