{"title":"点对点网络中的公平仲裁","authors":"D. Avresky, V. Shurbanov, R. Horst","doi":"10.1109/SIMSYM.1998.668433","DOIUrl":null,"url":null,"abstract":"In this paper we introduce and evaluate a method for optimizing the router arbitration policy in point-to-point networks. These networks use multiple high speed, low-cost routers to rapidly switch data directly between data sources and destinations. We assume that routers use an arbitration algorithm that has the ability to assign different priorities to different links thus controlling the distribution of available bandwidth among channels. We propose an analytical method that allows us to determine the correct priorities for channels so as to achieve fair arbitration thus minimizing latency, increasing throughput and eliminating tree saturation. In our study we used data generated by a simulation tool to validate the proposed analytical model for determining the weights (priorities) of router ports and to evaluate the resulting performance improvements. Link usage statistics were recorded by the simulator for the purpose of performing a detailed investigation of congestion effects and especially tree saturation. The method was applied to the ServerNet/sup TM/ System Area Network (SAN), developed by Tandem Computers Inc.","PeriodicalId":339060,"journal":{"name":"Proceedings 31st Annual Simulation Symposium","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fair arbitration in point-to-point networks\",\"authors\":\"D. Avresky, V. Shurbanov, R. Horst\",\"doi\":\"10.1109/SIMSYM.1998.668433\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we introduce and evaluate a method for optimizing the router arbitration policy in point-to-point networks. These networks use multiple high speed, low-cost routers to rapidly switch data directly between data sources and destinations. We assume that routers use an arbitration algorithm that has the ability to assign different priorities to different links thus controlling the distribution of available bandwidth among channels. We propose an analytical method that allows us to determine the correct priorities for channels so as to achieve fair arbitration thus minimizing latency, increasing throughput and eliminating tree saturation. In our study we used data generated by a simulation tool to validate the proposed analytical model for determining the weights (priorities) of router ports and to evaluate the resulting performance improvements. Link usage statistics were recorded by the simulator for the purpose of performing a detailed investigation of congestion effects and especially tree saturation. The method was applied to the ServerNet/sup TM/ System Area Network (SAN), developed by Tandem Computers Inc.\",\"PeriodicalId\":339060,\"journal\":{\"name\":\"Proceedings 31st Annual Simulation Symposium\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 31st Annual Simulation Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIMSYM.1998.668433\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 31st Annual Simulation Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMSYM.1998.668433","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
本文介绍并评价了一种在点对点网络中优化路由器仲裁策略的方法。这些网络使用多个高速、低成本的路由器在数据源和目的地之间直接快速交换数据。我们假设路由器使用一种仲裁算法,该算法能够为不同的链路分配不同的优先级,从而控制信道之间可用带宽的分配。我们提出了一种分析方法,使我们能够确定通道的正确优先级,从而实现公平仲裁,从而最大限度地减少延迟,增加吞吐量并消除树饱和。在我们的研究中,我们使用仿真工具生成的数据来验证所提出的分析模型,以确定路由器端口的权重(优先级),并评估由此产生的性能改进。链路使用统计数据是由模拟器记录的,目的是对拥塞影响,特别是树的饱和度进行详细的调查。该方法应用于由Tandem Computers Inc.开发的ServerNet/sup TM/ System Area Network (SAN)。
In this paper we introduce and evaluate a method for optimizing the router arbitration policy in point-to-point networks. These networks use multiple high speed, low-cost routers to rapidly switch data directly between data sources and destinations. We assume that routers use an arbitration algorithm that has the ability to assign different priorities to different links thus controlling the distribution of available bandwidth among channels. We propose an analytical method that allows us to determine the correct priorities for channels so as to achieve fair arbitration thus minimizing latency, increasing throughput and eliminating tree saturation. In our study we used data generated by a simulation tool to validate the proposed analytical model for determining the weights (priorities) of router ports and to evaluate the resulting performance improvements. Link usage statistics were recorded by the simulator for the purpose of performing a detailed investigation of congestion effects and especially tree saturation. The method was applied to the ServerNet/sup TM/ System Area Network (SAN), developed by Tandem Computers Inc.