A simulation study of the performance of the extra-stage cube and the augmented-shuffle exchange networks under faults

A. Abonamah, F. Sibai
{"title":"A simulation study of the performance of the extra-stage cube and the augmented-shuffle exchange networks under faults","authors":"A. Abonamah, F. Sibai","doi":"10.1145/141426.141427","DOIUrl":null,"url":null,"abstract":"In this paper, we conducted a simulation study to compare the performance of the Extra-Stage Cube (ESC) and the Augmented-Shuffle Exchange (ASE) networks in the presence of multiple link failures. The main objective of this study is gain an insight as to which of these two networks can better support graceful degradation under varying network loads and link failure rates. To achieve this task, three performance metrics are introduced, these are throughput, Message-Delivery ratio, and Average Delay Per Message and three simulation experiments using the simulation package COMNET II.5 are designed.The simulation results indicate that with respect to the three performance metrics, the ESC network outperforms the ASE for network size N&ge;32 and link MTTF=0.75 hours. However, when the link MTTF=0.12 hours, the ASE network outperforms the ESC network for N<64. In both cases, the ESC network outperforms the ASE network when N=64. This result appears to be directly related to the link complexities of the two networks. For large networks, the link complexity of the ASE is much larger than that of the ESC network and accounts for its poorer performance when N<32.","PeriodicalId":138785,"journal":{"name":"ACM Sigsim Simulation Digest","volume":"682 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Sigsim Simulation Digest","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/141426.141427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we conducted a simulation study to compare the performance of the Extra-Stage Cube (ESC) and the Augmented-Shuffle Exchange (ASE) networks in the presence of multiple link failures. The main objective of this study is gain an insight as to which of these two networks can better support graceful degradation under varying network loads and link failure rates. To achieve this task, three performance metrics are introduced, these are throughput, Message-Delivery ratio, and Average Delay Per Message and three simulation experiments using the simulation package COMNET II.5 are designed.The simulation results indicate that with respect to the three performance metrics, the ESC network outperforms the ASE for network size N≥32 and link MTTF=0.75 hours. However, when the link MTTF=0.12 hours, the ASE network outperforms the ESC network for N<64. In both cases, the ESC network outperforms the ASE network when N=64. This result appears to be directly related to the link complexities of the two networks. For large networks, the link complexity of the ASE is much larger than that of the ESC network and accounts for its poorer performance when N<32.
故障情况下多级立方和增强洗牌交换网络性能的仿真研究
在本文中,我们进行了一项模拟研究,以比较存在多个链路故障的Extra-Stage Cube (ESC)和Augmented-Shuffle Exchange (ASE)网络的性能。本研究的主要目的是了解在不同的网络负载和链路故障率下,这两种网络中哪一种能更好地支持优雅降级。为了实现这一任务,引入了吞吐量、消息传递率和平均每消息延迟三个性能指标,并使用仿真包COMNET II.5设计了三个仿真实验。仿真结果表明,对于三个性能指标,ESC网络在网络大小为N≥32,链路MTTF=0.75小时时优于ASE。然而,当链路MTTF=0.12小时时,对于N<64, ASE网络优于ESC网络。在这两种情况下,当N=64时,ESC网络优于ASE网络。这一结果似乎与两个网络的连接复杂性直接相关。对于大型网络,ASE的链路复杂度远高于ESC网络,这也是其在N<32时性能较差的原因。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信