Routing in an Internet-scale Network Emulator Export

@inproceedings{mascots04:mnet, abstract = {One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-packet basis. We present an approach to routing table calculation and storage based on spanning tree construction that provides an order of magnitude reduction in routing table size for Internet-like topologies. In our approach, we maintain a variable number of spanning trees for a given topology and choose the path between two hosts in each tree, choosing the shortest. We also populate offline a negative cache of actual shortest paths for source-destination pairs - typically a few percent of the total - where the lookups result in sub-optimal routes. We have implemented our technique in a popular network emulator, ModelNet, and show that our enhanced version can emulate Internet topologies 10-100 times larger than previously possible.}, author = {Chen, Jay and Gupta, Diwaker and Vishwanath, K. V. and Snoeren, A. C. and Vahdat, A.}, booktitle = {Proceedings of the 12th IEEE Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems}, citeulike-article-id = {3000065}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/MASCOT.2004.1348282}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1348282}, doi = {10.1109/MASCOT.2004.1348282}, journal = {Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings. The IEEE Computer Society's 12th Annual International Symposium on}, keywords = {2004, emulation, mine, networks, routing}, pages = {275--283}, posted-at = {2008-07-14 19:55:34}, priority = {0}, title = {Routing in an Internet-scale Network Emulator}, url = {http://dx.doi.org/10.1109/MASCOT.2004.1348282}, year = {2004} }

TY - CONF ID - mascots04:mnet L3 - citeulike-article-id:3000065 N2 - One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-packet basis. We present an approach to routing table calculation and storage based on spanning tree construction that provides an order of magnitude reduction in routing table size for Internet-like topologies. In our approach, we maintain a variable number of spanning trees for a given topology and choose the path between two hosts in each tree, choosing the shortest. We also populate offline a negative cache of actual shortest paths for source-destination pairs - typically a few percent of the total - where the lookups result in sub-optimal routes. We have implemented our technique in a popular network emulator, ModelNet, and show that our enhanced version can emulate Internet topologies 10-100 times larger than previously possible. JF - Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings. The IEEE Computer Society's 12th Annual International Symposium on EP - 283 TI - Routing in an Internet-scale Network Emulator T2 - Proceedings of the 12th IEEE Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems SP - 275 KW - 2004 KW - emulation KW - mine KW - networks KW - routing AU - Chen, Jay AU - Gupta, Diwaker AU - Vishwanath, KV AU - Snoeren, AC AU - Vahdat, A PY - 2004/// UR - http://dx.doi.org/10.1109/MASCOT.2004.1348282 ER -