Accelerating Simulation of Large-Scale IP Networks: A Network Invariant Preserving Approach

Hwangnam Kim, Hyuk Lim, J. Hou
{"title":"Accelerating Simulation of Large-Scale IP Networks: A Network Invariant Preserving Approach","authors":"Hwangnam Kim, Hyuk Lim, J. Hou","doi":"10.1109/INFOCOM.2006.185","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a simulation framework, TranSim, that reduces the rate at which packet-events are generated, in order to accelerate large-scale simulation of IP networks with TCP/UDP traffic. Conceptually, we transform an IP network into an alternate network that generates a smaller number of packet events, carry out simulation in the “transformed” network, and then extrapolate simulation results for the original network from those obtained in the “transformed” network. We formally prove that if the network invariant — the bandwidthdelay product — is preserved, the network dynamics, such as the queue dynamics and the packet dropping probability at each link, and TCP dynamics, such as the congestion window, RTTs, and rate dynamics, remain unchanged in the process of network transformation. We have implemented TranSim in ns-2, and conducted an empirical study to evaluate it against packet level simulation, with respect to the capability of capturing transient, packet level network dynamics, the reduction in the execution time and the memory usage, and the discrepancy in the system throughput. The simulation results indicate maximally two orders of magnitude improvement in the execution time and the performance improvement becomes more prominent as the network size increases (in terms of the number of nodes, the number of flows, the complexity of topology, and link capacity) or as the degree of downsizing increases. The memory usage incurred in TranSim is comparable to that in packet level simulation. The error discrepancy between TranSim and packet level simulation, on the other hand, is between 1-10 % in a wide variety of network topologies, inclusive of randomly generated topologies, and traffic loads with various AQM strategies.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"250 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCOM.2006.185","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

In this paper, we propose a simulation framework, TranSim, that reduces the rate at which packet-events are generated, in order to accelerate large-scale simulation of IP networks with TCP/UDP traffic. Conceptually, we transform an IP network into an alternate network that generates a smaller number of packet events, carry out simulation in the “transformed” network, and then extrapolate simulation results for the original network from those obtained in the “transformed” network. We formally prove that if the network invariant — the bandwidthdelay product — is preserved, the network dynamics, such as the queue dynamics and the packet dropping probability at each link, and TCP dynamics, such as the congestion window, RTTs, and rate dynamics, remain unchanged in the process of network transformation. We have implemented TranSim in ns-2, and conducted an empirical study to evaluate it against packet level simulation, with respect to the capability of capturing transient, packet level network dynamics, the reduction in the execution time and the memory usage, and the discrepancy in the system throughput. The simulation results indicate maximally two orders of magnitude improvement in the execution time and the performance improvement becomes more prominent as the network size increases (in terms of the number of nodes, the number of flows, the complexity of topology, and link capacity) or as the degree of downsizing increases. The memory usage incurred in TranSim is comparable to that in packet level simulation. The error discrepancy between TranSim and packet level simulation, on the other hand, is between 1-10 % in a wide variety of network topologies, inclusive of randomly generated topologies, and traffic loads with various AQM strategies.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大规模IP网络加速仿真:一种网络不变性保持方法
在本文中,我们提出了一个模拟框架,TranSim,它降低了数据包事件产生的速率,以加速TCP/UDP流量的IP网络的大规模模拟。从概念上讲,我们将一个IP网络转换为一个产生较少数据包事件的备用网络,在“转换”的网络中进行模拟,然后从“转换”的网络中获得的模拟结果推断原始网络的模拟结果。我们正式证明,如果保持网络不变量带宽延迟积,网络动态(如队列动态和各链路丢包概率)和TCP动态(如拥塞窗口、rtt和速率动态)在网络转换过程中保持不变。我们已经在ns-2中实现了TranSim,并通过数据包级模拟对其进行了实证研究,以评估其捕获瞬态、数据包级网络动态的能力、执行时间和内存使用的减少以及系统吞吐量的差异。仿真结果表明,执行时间最多有两个数量级的改进,并且随着网络规模的增加(节点数量、流数量、拓扑复杂性和链路容量)或缩小程度的增加,性能改进变得更加突出。transm中产生的内存使用情况与包级模拟中的内存使用情况相当。另一方面,在各种网络拓扑(包括随机生成的拓扑)和各种AQM策略的流量负载中,transm和包级模拟之间的误差在1- 10%之间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Provisioning Quality Controlled Medium Access in UltraWideBand-Operated WPANs A Stochastic Random-Races Algorithm for Routing in MPLS Traffic Engineering Accelerating Simulation of Large-Scale IP Networks: A Network Invariant Preserving Approach Cooperative Data-Optical InterNetworking: Distributed Multi-Layer Optimization Simple and Accurate Identification of High-Rate Flows by Packet Sampling
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1