An Experimental Analysis of BGP Convergence Time
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Large-scale network simulation techniques: examples of TCP and OSPF models
ACM SIGCOMM Computer Communication Review
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
Distributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science
Modeling the routing of an autonomous system with C-BGP
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
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.