Feasibility Study on Distributed Simulations of BGP

Abstract

The Autonomous System (AS) topology of the Internet (up to 61k ASs) is growing at a rate of about 10% per year. The Border Gateway Protocol (BGP) starts to show its limits in terms of the number of routing table entries it can dynamically process and control. Due to the increasing routing information processing and storage, the same trend is observed for routing model simulators such as DRMSim specialized in large-scale simulations of routing models. Therefore, DRMSim needs enhancements to support the current size of the Internet topology and its evolution (up to 100k ASs). To this end, this paper proposes a feasibility study of the extension of DRMSim so as to support the Distributed Parallel Discrete Event paradigm. We first detail the possible distribution models and their associated communication overhead. Then, we analyze this overhead by executing BGP on a partitioned topology according to different scenarios. Finally, we conclude on the feasibility of such a simulator by computing the expected additional time required by a distributed simulation of BGP compared to its sequential simulation.

Distributed simulation: state-of-the-art and potential for operational research

“…Network applications use DS to speed up large models of future networking systems such as wireless sensor networks, Mobile Ad-Hoc Networks (MANETs) and Wireless Vehicular Ad-Hoc Networks (Bononi, Di Felice, D'Angelo, Bracuto, & Donatiello, 2008;Huang, Alexopoulos, Hunter, & Fujimoto, 2012;Krzyszton & Niewiadomska-Szynkiewicz, 2016;Niewiadomska-Szynkiewicz & Sikora, 2012). DS to speed up large-scale models of the Internet have also been proposed (Coudert, et al, 2012).…”

A Service-Oriented Middleware Enabling Decentralised Deployment in Mobile Multihop Networks

“…Our initial motivation originates from applied Research projects conducted at I3S/Inria, whose goals were to provide effective solutions to practical distributed problems related to graph algorithms [25], networking [10], decentralised protocols [16] for MANETs and more recently the IoT, etc.…”

Distance-Vector Algorithms for Distributed Shortest Paths on Dynamic Power-Law Networks

“…Finally, we assess, via an extensive experimental evaluation, the performance of DUAL, LFR and their combinations with DCP, and provide evidences of its effectiveness, on a practically relevant class of power-law networks, namely power-law artificial instances obtained by the Generalized Linear Preference (GLP) model [33]. The GLP framework has been shown, by many studies focusing on distributed algorithms (see, e.g., [34,35]) to model very well the Internet, and parts of it. In particular, in [36], it has been shown that GLP predicts the structure of real-world communication networks (e.g.…”