How low can you go? Spherical routing for scalable network simulations Conference

cited authors

  • Van Vorst, N; Li, T; Liu, J

fiu authors

abstract

  • Memory consumption is a critical problem for large-scale network simulations. Particularly, the large memory footprint needed for maintaining routing tables can severely obturate scalability. We present an approach of composing large-scale network models using sharable model fragments to achieve significant reduction in the amount of memory required for storing forwarding tables in simulation. Our approach, called spherical routing, conducts static routing within spheres according to user-defined policies. Our routing scheme pre-calculates the forwarding table for each routing sphere, and allows spheres with identical sub-structures to share forwarding tables. Through extensive experiments we demonstrate that our approach can achieve several orders of magnitude in memory reduction for large-scale network models. © 2011 IEEE.

publication date

  • September 26, 2011

Digital Object Identifier (DOI)

start page

  • 259

end page

  • 268