具有任意开关大小，队列大小，链路多重性和速度的分组交换banyan的马尔可夫链分析

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.101547

T. Szymanski, S. Shaikh

{"title":"具有任意开关大小，队列大小，链路多重性和速度的分组交换banyan的马尔可夫链分析","authors":"T. Szymanski, S. Shaikh","doi":"10.1109/INFCOM.1989.101547","DOIUrl":null,"url":null,"abstract":"Approximate Markov chains for the performance of banyan networks built with basic switches of arbitrary size containing input queues, output queues or a combination of input buffers and output queues are presented. These chains are also extended to model banyans where each link is replaced by a number of parallel links. Comparison with simulations indicates that the chains are reasonably accurate for practical network loads. It is shown that banyans built with switches containing a combination of single input buffers and output queues outperforms banyans built with switches containing only input queues or only output queues. Banyans built with larger nodes are shown to outperform banyans built with smaller nodes. It is shown that banyan-based networks with multiple links can be designed to have extremely low blocking probabilities.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"85","resultStr":"{\"title\":\"Markov chain analysis of packet-switched banyans with arbitrary switch sizes, queue sizes, link multiplicities and speedups\",\"authors\":\"T. Szymanski, S. Shaikh\",\"doi\":\"10.1109/INFCOM.1989.101547\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Approximate Markov chains for the performance of banyan networks built with basic switches of arbitrary size containing input queues, output queues or a combination of input buffers and output queues are presented. These chains are also extended to model banyans where each link is replaced by a number of parallel links. Comparison with simulations indicates that the chains are reasonably accurate for practical network loads. It is shown that banyans built with switches containing a combination of single input buffers and output queues outperforms banyans built with switches containing only input queues or only output queues. Banyans built with larger nodes are shown to outperform banyans built with smaller nodes. It is shown that banyan-based networks with multiple links can be designed to have extremely low blocking probabilities.<<ETX>>\",\"PeriodicalId\":275763,\"journal\":{\"name\":\"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"85\",\"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.101547\",\"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.101547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 85

摘要

给出了用任意大小的基本开关(包含输入队列、输出队列或输入缓冲区和输出队列的组合)构建的榕树网络性能的近似马尔可夫链。这些链条也扩展到模型榕树，其中每个环节都被一些平行环节所取代。仿真结果表明，该链对实际网络负载具有较好的准确性。结果表明，使用包含单个输入缓冲区和输出队列组合的开关构建的榕树优于使用仅包含输入队列或仅包含输出队列的开关构建的榕树。使用较大节点构建的榕树表现优于使用较小节点构建的榕树。研究表明，具有多链路的基于榕树的网络可以被设计成具有极低的阻塞概率。

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

查看原文本刊更多论文

Markov chain analysis of packet-switched banyans with arbitrary switch sizes, queue sizes, link multiplicities and speedups

Approximate Markov chains for the performance of banyan networks built with basic switches of arbitrary size containing input queues, output queues or a combination of input buffers and output queues are presented. These chains are also extended to model banyans where each link is replaced by a number of parallel links. Comparison with simulations indicates that the chains are reasonably accurate for practical network loads. It is shown that banyans built with switches containing a combination of single input buffers and output queues outperforms banyans built with switches containing only input queues or only output queues. Banyans built with larger nodes are shown to outperform banyans built with smaller nodes. It is shown that banyan-based networks with multiple links can be designed to have extremely low blocking probabilities.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量