Maximum delivery time and hot spots in ServerNet/sup TM/ topologies

D. Avresky, V. Shurbanov, R. Horst, W. Watson, L. Young, D. Jewett
{"title":"Maximum delivery time and hot spots in ServerNet/sup TM/ topologies","authors":"D. Avresky, V. Shurbanov, R. Horst, W. Watson, L. Young, D. Jewett","doi":"10.1109/IPPS.1997.580993","DOIUrl":null,"url":null,"abstract":"This paper centers on analysis of the performance characteristics of ServerNet topologies, concentrating on the prediction through simulation and statistical analysis of the maximum two-way delivery time, the identification of congested links (hot spots) and tree saturation. ServerNet/sup TM/, developed by Tandem Computers Inc., is a wormhole-routed, packet-switched, point-to-point network, with special attention paid to reducing latency and to assuring reliability. ServerNet uses multiple high-speed, low-cost routers to rapidly switch data directly between data sources and destinations. Our study is based on data generated by a simulation tool. Statistical analysis and inference methods were used to process the samples generated by the simulator and to obtain estimates for the maximum two-way packet delivery time. Link usage statistics were recorded by the simulator for the purpose of performing a detailed investigation of congestion effects and hot spots. Hot spots may cause the occurrence of tree saturation in the network i.e., where an individual tree will become congested (tree saturation) while all other trees are mostly idle, which leads to significant performance degradation.","PeriodicalId":145892,"journal":{"name":"Proceedings 11th International Parallel Processing Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 11th International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1997.580993","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

This paper centers on analysis of the performance characteristics of ServerNet topologies, concentrating on the prediction through simulation and statistical analysis of the maximum two-way delivery time, the identification of congested links (hot spots) and tree saturation. ServerNet/sup TM/, developed by Tandem Computers Inc., is a wormhole-routed, packet-switched, point-to-point network, with special attention paid to reducing latency and to assuring reliability. ServerNet uses multiple high-speed, low-cost routers to rapidly switch data directly between data sources and destinations. Our study is based on data generated by a simulation tool. Statistical analysis and inference methods were used to process the samples generated by the simulator and to obtain estimates for the maximum two-way packet delivery time. Link usage statistics were recorded by the simulator for the purpose of performing a detailed investigation of congestion effects and hot spots. Hot spots may cause the occurrence of tree saturation in the network i.e., where an individual tree will become congested (tree saturation) while all other trees are mostly idle, which leads to significant performance degradation.
最大交付时间和ServerNet/sup TM/拓扑中的热点
本文以分析ServerNet拓扑结构的性能特征为中心,重点通过仿真和统计分析预测最大双向传输时间,识别拥塞链路(热点)和树饱和度。由Tandem计算机公司开发的ServerNet/sup TM/是一种虫洞路由、分组交换、点对点网络,特别注意减少延迟和确保可靠性。ServerNet使用多个高速、低成本的路由器在数据源和目的地之间直接快速交换数据。我们的研究是基于模拟工具生成的数据。采用统计分析和推理方法对仿真器产生的样本进行处理,并对最大双向数据包传输时间进行估计。链路使用统计数据由模拟器记录,以便对拥塞影响和热点进行详细调查。热点可能会导致网络中出现树饱和,即单个树变得拥塞(树饱和),而所有其他树大多处于空闲状态,从而导致显著的性能下降。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信