The scalability and runtime performance of large-scale discrete event network simulations has been improved previously by spreading processing effort across multiple processors, increasing the provided computational power while decreasing the wallclock execution time of each simulation trial. The popular network simulator ns-3 provides two distributed frameworks that differ in their synchronization implementations. This paper provides those thresholds under which certain selection criteria would deem one synchronization option better than the other in terms of runtime performance. It specifically focuses on the performance of each synchronization method by stripping the model of simulated network topologies and overhead and purely utilizing the synchronization implementations and event scheduler of ns-3. Simulations have been performed across a variety of lookahead values, neighbor selections, and remote traffic percentages, and neighbor connectivity thresholds have been determined that suggest where it is more appropriate to use one option over the other.
{"title":"PHOLD performance of conservative synchronization methods for distributed simulation in ns-3","authors":"Jared S. Ivey, B. Swenson, G. Riley","doi":"10.1145/2756509.2756511","DOIUrl":"https://doi.org/10.1145/2756509.2756511","url":null,"abstract":"The scalability and runtime performance of large-scale discrete event network simulations has been improved previously by spreading processing effort across multiple processors, increasing the provided computational power while decreasing the wallclock execution time of each simulation trial. The popular network simulator ns-3 provides two distributed frameworks that differ in their synchronization implementations. This paper provides those thresholds under which certain selection criteria would deem one synchronization option better than the other in terms of runtime performance. It specifically focuses on the performance of each synchronization method by stripping the model of simulated network topologies and overhead and purely utilizing the synchronization implementations and event scheduler of ns-3. Simulations have been performed across a variety of lookahead values, neighbor selections, and remote traffic percentages, and neighbor connectivity thresholds have been determined that suggest where it is more appropriate to use one option over the other.","PeriodicalId":272891,"journal":{"name":"Proceedings of the 2015 Workshop on ns-3","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124184430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sérgio Conceição, Filipe Ribeiro, R. Campos, M. Ricardo
Wireless Underground Networks (WUNs) have applications such as agriculture, border surveillance, maintenance of playing fields, and infrastructure monitoring. When designing a sensor network for one of these applications some of the sensors (communication nodes) will be buried underground, which means the propagation medium will be the soil or hybrid (air plus soil) in case of one of the nodes is aboveground. Thus, new models have to be implemented in existing simulators, in order to enable the proper simulation of these communications scenarios. This paper presents a new model, named underground model, and discusses its integration into the ns-3 simulator. The underground model enables the simulation of WUNs, including network topologies with underground and aboveground nodes. The accuracy of the underground model is shown for two frequency bands by comparing simulations results with experimental results.
{"title":"Novel ns-3 model enabling simulation of electromagnetic wireless underground networks","authors":"Sérgio Conceição, Filipe Ribeiro, R. Campos, M. Ricardo","doi":"10.1145/2756509.2756510","DOIUrl":"https://doi.org/10.1145/2756509.2756510","url":null,"abstract":"Wireless Underground Networks (WUNs) have applications such as agriculture, border surveillance, maintenance of playing fields, and infrastructure monitoring. When designing a sensor network for one of these applications some of the sensors (communication nodes) will be buried underground, which means the propagation medium will be the soil or hybrid (air plus soil) in case of one of the nodes is aboveground. Thus, new models have to be implemented in existing simulators, in order to enable the proper simulation of these communications scenarios. This paper presents a new model, named underground model, and discusses its integration into the ns-3 simulator. The underground model enables the simulation of WUNs, including network topologies with underground and aboveground nodes. The accuracy of the underground model is shown for two frequency bands by comparing simulations results with experimental results.","PeriodicalId":272891,"journal":{"name":"Proceedings of the 2015 Workshop on ns-3","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132765989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper provides performance modeling and validation results for the the ns-3 model of the Licklider Transmission Protocol, the standard transport protocol used to provide transmission reliability in Delay Tolerant Networks (DTNs). DTNs are an emerging type of network used to provide communications in extreme environments characterized by very long round trip delays and intermittent connectivity. Evaluation of some target environments requires the use of modeling since high-fidelity testbeds can be impractical. To our knowledge, we provide the first LTP model for the ns-3 network simulator. In this paper, through a combination of simulation and real-time emulation, we verify and validate this new model of LTP and show that its performance is in line with previously published performance studies of LTP.
{"title":"Implementation and evaluation of licklider transmission protocol (LTP) in ns-3","authors":"R. Martínez-Vidal, T. Henderson, J. Borrell","doi":"10.1145/2756509.2756519","DOIUrl":"https://doi.org/10.1145/2756509.2756519","url":null,"abstract":"This paper provides performance modeling and validation results for the the ns-3 model of the Licklider Transmission Protocol, the standard transport protocol used to provide transmission reliability in Delay Tolerant Networks (DTNs). DTNs are an emerging type of network used to provide communications in extreme environments characterized by very long round trip delays and intermittent connectivity. Evaluation of some target environments requires the use of modeling since high-fidelity testbeds can be impractical. To our knowledge, we provide the first LTP model for the ns-3 network simulator. In this paper, through a combination of simulation and real-time emulation, we verify and validate this new model of LTP and show that its performance is in line with previously published performance studies of LTP.","PeriodicalId":272891,"journal":{"name":"Proceedings of the 2015 Workshop on ns-3","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129278973","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
An inquiry is made into whether or not it is possible to learn a performance characterization which can predict the best way to configure the simulator executive when performing a simulation using the ns-3 network simulator distributed across many CPUs. In testing this inquiry, experiments are run in ns-3 using network topologies generated using BRITE and the total wallclock runtime of the simulation is measured. For each experiment, a set of features is formed which is composed of measurements made prior to the running of the simulation. For each experiment, a binary label is created indicating which simulator executive configuration produced better performance. A linear classifier is then designed which nearly separates the set of experiments by label, indicating that such a performance characterization may exist.
{"title":"On predicting the performance characteristics of the ns-3 distributed simulator for scale-free internet models","authors":"C. Hood, G. Riley","doi":"10.1145/2756509.2756522","DOIUrl":"https://doi.org/10.1145/2756509.2756522","url":null,"abstract":"An inquiry is made into whether or not it is possible to learn a performance characterization which can predict the best way to configure the simulator executive when performing a simulation using the ns-3 network simulator distributed across many CPUs. In testing this inquiry, experiments are run in ns-3 using network topologies generated using BRITE and the total wallclock runtime of the simulation is measured. For each experiment, a set of features is formed which is composed of measurements made prior to the running of the simulation. For each experiment, a binary label is created indicating which simulator executive configuration produced better performance. A linear classifier is then designed which nearly separates the set of experiments by label, indicating that such a performance characterization may exist.","PeriodicalId":272891,"journal":{"name":"Proceedings of the 2015 Workshop on ns-3","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114932301","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mohammed J. F. Alenazi, Yufei Cheng, Dongsheng Zhang, J. Sterbenz
Routing protocols play a significant role in the overall performance of ad-hoc wireless networks. Several routing protocols have been proposed for ad hoc environments. Any new proposed protocol should be compared with other routing protocols to show its performance under several scenarios. Epidemic routing was one of the first routing schemes proposed for DTNs (delay-tolerant networks). In this paper, we present our implementation of the epidemic routing protocol in the ns-3 simulator. We analyse its performance and compare with the previous ns-2 implementation. Our analysis conforms the results of the previous ns-2 implementation. Moreover, we compare our epidemic implementation to other MANET routing protocols in a delay tolerant environment and we show that epidemic routing outperforms other MANET routing protocols in terms of packet delivery at the expense of overhead and delay.
{"title":"Epidemic routing protocol implementation in ns-3","authors":"Mohammed J. F. Alenazi, Yufei Cheng, Dongsheng Zhang, J. Sterbenz","doi":"10.1145/2756509.2756523","DOIUrl":"https://doi.org/10.1145/2756509.2756523","url":null,"abstract":"Routing protocols play a significant role in the overall performance of ad-hoc wireless networks. Several routing protocols have been proposed for ad hoc environments. Any new proposed protocol should be compared with other routing protocols to show its performance under several scenarios. Epidemic routing was one of the first routing schemes proposed for DTNs (delay-tolerant networks). In this paper, we present our implementation of the epidemic routing protocol in the ns-3 simulator. We analyse its performance and compare with the previous ns-2 implementation. Our analysis conforms the results of the previous ns-2 implementation. Moreover, we compare our epidemic implementation to other MANET routing protocols in a delay tolerant environment and we show that epidemic routing outperforms other MANET routing protocols in terms of packet delivery at the expense of overhead and delay.","PeriodicalId":272891,"journal":{"name":"Proceedings of the 2015 Workshop on ns-3","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134536851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sergio M. Sakai, Gilberto Gambugge, Ricardo Takaki, Jorge Seki, J. Bazzo, J. P. Miranda
Notwithstanding the value of Long Term Evolution (LTE) towards an improved user experience in next-generation networks, its associated high complexity is known to place computational and time burdens on testing tasks involving real-world platforms. Simulation is currently the tool most widely used to tackle this issue. LENA, for instance, is an open source simulator based on ns-3 that allows the design, evaluation, and validation of LTE networks. Despite of modeling the main LTE elements and interfaces, one limitation of LENA is that it docs not support the use of external traffic entities in conjunction with the simulation. In this paper, we describe how the ns-3 LENA LTE framework can be customized for use in an emulation-based test environment that allows a wider variety of real-world applications to be run over the simulated links. To validate our emulation results, we use as benchmark a testbed that differs from the aforementioned test environment in that the ns-3 server running the simulated network is replaced with a network made up of real-world platforms. Initial validation results, based on limited tests using an industry-standard VoIP test tool and iperf throughput tool, demonstrate that ns-3 LTE models can deliver voice quality and latency as good as an experimental testbed using actual LTE equipment over a range of signal-to-noise ratios. Similar conclusions arc also drawn for throughput, thus confirming the suitability of our emulation approach as a viable means to predict performance in real LTE networks. The good agreement of our experimental results is possible not only because the same functionality is implemented in both experiments but due to the use of the same traffic generation tools in the simulated and real-world LTE networks not -- possible in standard LENA simulation.
尽管长期演进(LTE)对改善下一代网络的用户体验具有价值，但众所周知，其相关的高复杂性会给涉及现实世界平台的测试任务带来计算和时间负担。仿真是目前解决这个问题最广泛使用的工具。例如，LENA是一个基于ns-3的开源模拟器，允许LTE网络的设计、评估和验证。尽管对主要LTE元素和接口进行了建模，LENA的一个限制是它不支持将外部流量实体与仿真结合使用。在本文中，我们描述了如何定制ns-3 LENA LTE框架，以便在基于仿真的测试环境中使用，该环境允许在模拟链路上运行更广泛的实际应用程序。为了验证我们的仿真结果，我们使用一个测试平台作为基准，该测试平台与前面提到的测试环境不同，因为运行模拟网络的ns-3服务器被替换为由实际平台组成的网络。基于使用行业标准VoIP测试工具和iperf吞吐量工具进行的有限测试，初步验证结果表明，ns-3 LTE模型可以在一定信噪比范围内提供与使用实际LTE设备的实验测试平台一样好的语音质量和延迟。对于吞吐量也得出了类似的结论，从而证实了我们的仿真方法作为预测实际LTE网络性能的可行手段的适用性。我们的实验结果的良好一致性是可能的，不仅因为在两个实验中实现了相同的功能，而且由于在模拟和实际LTE网络中使用了相同的流量生成工具，这在标准LENA模拟中是不可能的。
{"title":"Performance comparison of a custom emulation-based test environment against a real-world LTE testbed","authors":"Sergio M. Sakai, Gilberto Gambugge, Ricardo Takaki, Jorge Seki, J. Bazzo, J. P. Miranda","doi":"10.1145/2756509.2756517","DOIUrl":"https://doi.org/10.1145/2756509.2756517","url":null,"abstract":"Notwithstanding the value of Long Term Evolution (LTE) towards an improved user experience in next-generation networks, its associated high complexity is known to place computational and time burdens on testing tasks involving real-world platforms. Simulation is currently the tool most widely used to tackle this issue. LENA, for instance, is an open source simulator based on ns-3 that allows the design, evaluation, and validation of LTE networks. Despite of modeling the main LTE elements and interfaces, one limitation of LENA is that it docs not support the use of external traffic entities in conjunction with the simulation. In this paper, we describe how the ns-3 LENA LTE framework can be customized for use in an emulation-based test environment that allows a wider variety of real-world applications to be run over the simulated links. To validate our emulation results, we use as benchmark a testbed that differs from the aforementioned test environment in that the ns-3 server running the simulated network is replaced with a network made up of real-world platforms. Initial validation results, based on limited tests using an industry-standard VoIP test tool and iperf throughput tool, demonstrate that ns-3 LTE models can deliver voice quality and latency as good as an experimental testbed using actual LTE equipment over a range of signal-to-noise ratios. Similar conclusions arc also drawn for throughput, thus confirming the suitability of our emulation approach as a viable means to predict performance in real LTE networks. The good agreement of our experimental results is possible not only because the same functionality is implemented in both experiments but due to the use of the same traffic generation tools in the simulated and real-world LTE networks not -- possible in standard LENA simulation.","PeriodicalId":272891,"journal":{"name":"Proceedings of the 2015 Workshop on ns-3","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126251478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Steven G. Smith, D. Jefferson, P. Barnes, S. Nikolaev
In this paper we describe enhancements to improve the scaling of the ns-3 simulator for large problem sizes. The ns-3 simulator has a parallel capability however the current implementation instantiates the entire network topology on all ranks (processors). This restricts the problem sizes that could be run. We describe an approach to removing this limitation by distributing the network topology across ranks such that each rank only holds a part of the network topology. Performance studies were conducted to investigate the scaling performance of the modified ns-3 simulator.
{"title":"Improving per processor memory use of ns-3 to enable large scale simulations","authors":"Steven G. Smith, D. Jefferson, P. Barnes, S. Nikolaev","doi":"10.1145/2756509.2756526","DOIUrl":"https://doi.org/10.1145/2756509.2756526","url":null,"abstract":"In this paper we describe enhancements to improve the scaling of the ns-3 simulator for large problem sizes. The ns-3 simulator has a parallel capability however the current implementation instantiates the entire network topology on all ranks (processors). This restricts the problem sizes that could be run. We describe an approach to removing this limitation by distributing the network topology across ranks such that each rank only holds a part of the network topology. Performance studies were conducted to investigate the scaling performance of the modified ns-3 simulator.","PeriodicalId":272891,"journal":{"name":"Proceedings of the 2015 Workshop on ns-3","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127478119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Development of transport protocols has received a great deal of attention of network research community at several past decades. One of the general directions of such an effort was to improve a congestion control mechanism of the TCP (Transmission Control Protocol) which is tightly bounded with other components of the protocol responsible, for example, for robust delivery of data and loss detection. Such a solid architecture complicates innovations in this area and leads to inefficient or misleading functioning in different network settings. Last decade has shown the emergence of new communication paradigms such as cloud computing, software-defined networks, sensor networks, fog networks etc. Thus, rethinking architecture of the transport protocol can be useful to comply new demands. The standard TCP approach tics the transport connection to its endpoints however approaching network applications in new network settings may demand more flexible and transparent data transfer. For example, in cloud computing architectures, servers can dynamically power on or shutdown and such a behavior must be transparent for clients. This can be difficult or even impossible to achieve if the transport protocol's state is distributed between both sides of the connection. We consider a protocol called the Trickles, which is one of the first efforts to migrate all connection state to one endpoint, allows its counterpart to operate without any per-connection state. In this paper we describe the architecture of the model of such a stateless protocol and describe a framework which can be used to model such protocols in ns-3. Another contribution of the paper is an approach based on ideas of literate programming to achieve reproducible results of analysis of network protocols.
{"title":"Implementation of stateless transport protocols in ns-3","authors":"D. Chalyy","doi":"10.1145/2756509.2756521","DOIUrl":"https://doi.org/10.1145/2756509.2756521","url":null,"abstract":"Development of transport protocols has received a great deal of attention of network research community at several past decades. One of the general directions of such an effort was to improve a congestion control mechanism of the TCP (Transmission Control Protocol) which is tightly bounded with other components of the protocol responsible, for example, for robust delivery of data and loss detection. Such a solid architecture complicates innovations in this area and leads to inefficient or misleading functioning in different network settings. Last decade has shown the emergence of new communication paradigms such as cloud computing, software-defined networks, sensor networks, fog networks etc. Thus, rethinking architecture of the transport protocol can be useful to comply new demands. The standard TCP approach tics the transport connection to its endpoints however approaching network applications in new network settings may demand more flexible and transparent data transfer. For example, in cloud computing architectures, servers can dynamically power on or shutdown and such a behavior must be transparent for clients. This can be difficult or even impossible to achieve if the transport protocol's state is distributed between both sides of the connection. We consider a protocol called the Trickles, which is one of the first efforts to migrate all connection state to one endpoint, allows its counterpart to operate without any per-connection state. In this paper we describe the architecture of the model of such a stateless protocol and describe a framework which can be used to model such protocols in ns-3. Another contribution of the paper is an approach based on ideas of literate programming to achieve reproducible results of analysis of network protocols.","PeriodicalId":272891,"journal":{"name":"Proceedings of the 2015 Workshop on ns-3","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133811150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The current implementation of ns-3 provides only synthetic mobility models that disregard the map where the nodes are moving, however, the study of vehicular ad-hoc networks requires the usage of more realistic mobility models. The usage of mobility traces created by traffic simulators such as SUMO is feasible, however, these simulators possess a steep learning curve, which prevents their fruition for most researchers whose research focus and expertise are on the data communication layer. This paper presents a mobility model that generates realistic mobility traces that take into account the underlying maps, while maintaining the ease of usage that characterizes the synthetic mobility models. The module described herein is compared against SUMO and against the ns3::RandomWaypointMobilityModel of network simulator 3, to analyze the trade-off it implements in terms of realism and ease of usage.
{"title":"RoutesMobilityModel: easy realistic mobility simulation using external information services","authors":"T. Cerqueira, M. Albano","doi":"10.1145/2756509.2756515","DOIUrl":"https://doi.org/10.1145/2756509.2756515","url":null,"abstract":"The current implementation of ns-3 provides only synthetic mobility models that disregard the map where the nodes are moving, however, the study of vehicular ad-hoc networks requires the usage of more realistic mobility models. The usage of mobility traces created by traffic simulators such as SUMO is feasible, however, these simulators possess a steep learning curve, which prevents their fruition for most researchers whose research focus and expertise are on the data communication layer. This paper presents a mobility model that generates realistic mobility traces that take into account the underlying maps, while maintaining the ease of usage that characterizes the synthetic mobility models. The module described herein is compared against SUMO and against the ns3::RandomWaypointMobilityModel of network simulator 3, to analyze the trade-off it implements in terms of realism and ease of usage.","PeriodicalId":272891,"journal":{"name":"Proceedings of the 2015 Workshop on ns-3","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121105534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Alina Quereilhac, D. Saucez, T. Turletti, W. Dabbous
ns-3 is a flexible simulator whose capabilities go beyond running purely synthetic simulations in a local desktop. Due to its ability to run unmodified Linux applications and to exchange traffic with live networks, ns-3 can be combined with live hosts to run distributed simulations or to transparently integrate live and simulated networks. Nevertheless, ns-3 multi-host experiment scenarios require considerable manual work and system administration. The NEPI experiment management framework automates deployment, execution, and result collection of experiment scenarios. In this paper we describe the internals of the NEPI framework that provides support for automation of ns-3 experiments, and demonstrate its usage for ns-3 multihost scenarios with three example cases: a) running parallel simulations on a cluster of hosts, b) running distributed simulations spanning multiple hosts, and c) integrating live and simulated networks.
{"title":"Automating ns-3 experimentation in multi-host scenarios","authors":"Alina Quereilhac, D. Saucez, T. Turletti, W. Dabbous","doi":"10.1145/2756509.2756513","DOIUrl":"https://doi.org/10.1145/2756509.2756513","url":null,"abstract":"ns-3 is a flexible simulator whose capabilities go beyond running purely synthetic simulations in a local desktop. Due to its ability to run unmodified Linux applications and to exchange traffic with live networks, ns-3 can be combined with live hosts to run distributed simulations or to transparently integrate live and simulated networks. Nevertheless, ns-3 multi-host experiment scenarios require considerable manual work and system administration. The NEPI experiment management framework automates deployment, execution, and result collection of experiment scenarios. In this paper we describe the internals of the NEPI framework that provides support for automation of ns-3 experiments, and demonstrate its usage for ns-3 multihost scenarios with three example cases: a) running parallel simulations on a cluster of hosts, b) running distributed simulations spanning multiple hosts, and c) integrating live and simulated networks.","PeriodicalId":272891,"journal":{"name":"Proceedings of the 2015 Workshop on ns-3","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127426074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：