Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Stable internet routing without global coordination
IEEE/ACM Transactions on Networking (TON)
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Understanding BGP misconfiguration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
The impact of BGP dynamics on intra-domain traffic
Proceedings of the joint international conference on Measurement and modeling of computer systems
Simulation of Network Traffic at Coarse Timescales
Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation
A Case Study in Understanding OSPF and BGP Interactions Using Efficient Experiment Design
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
On compact routing for the internet
ACM SIGCOMM Computer Communication Review
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
Dynamic routing schemes for general graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Distributed computing of efficient routing schemes in generalized chordal graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Modeling the routing of an autonomous system with C-BGP
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
The expansion of the Internet routing system results in a number of research challenges, in particular, the Border Gateway Protocol (BGP) starts to show its limits a.o. in terms of the number of routing table entries it can dynamically process and control. Dynamic routing protocols showing better scaling properties are thus under investigation. However, because deploying under-development routing protocols on the Internet is not practicable at a large-scale (due to the size of the Internet topology), simulation is an unavoidable step to validate the properties of a newly proposed routing scheme. Unfortunately, the simulation of inter- domain routing protocols over large networks (order of tens of thousands of nodes) poses real challenges due to the limited memory and computational power that computers impose. This paper presents the Dynamic Routing Model simulator (DRMsim) which addresses the specific problem of large-scale simulations of (inter-domain) routing models on large networks. The motivation for developing a new simulator lies in the limitation of existing simulation tools in terms of the number of nodes they can handle and in the models they propose.