Path preserving scale down for validation of internet inter-domain routing protocols

Glenn Carl, Shashi Phoha, George Kesidis, Bharat Madan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations


New solutions have been proposed to address problems with the Internet's interdomain routing protocol, BGP. Before their deployment, validation of incremental performance gains and backwards compatibility is necessary. For this task, the Internet's large size and complexity make all techniques but simulation infeasible. When performing largescale network simulations, memory requirements for routing table storage can become a limiting factor. This work uses model reduction to mitigate this problem, with reduction defined in terms of the number of routers. Our framework uses path properties specific to interdomain routing to define the conditions of a path-preserving scale-down transformation. For implementation, vertex contraction and deletion were used to remove routers from a preliminary nominal network model. Vertex contraction was seen to violate the conditions of the transformation. A small subgraph from a measured topology is used for experimental validation. Routing tables are compared to show equivalence under the model reduction.

Original languageEnglish (US)
Title of host publicationProceedings of the 2006 Winter Simulation Conference, WSC
Number of pages9
StatePublished - 2006
Event2006 Winter Simulation Conference, WSC - Monterey, CA, United States
Duration: Dec 3 2006Dec 6 2006

Publication series

NameProceedings - Winter Simulation Conference
ISSN (Print)0891-7736


Other2006 Winter Simulation Conference, WSC
Country/TerritoryUnited States
CityMonterey, CA

All Science Journal Classification (ASJC) codes

  • Software
  • Modeling and Simulation
  • Computer Science Applications


Dive into the research topics of 'Path preserving scale down for validation of internet inter-domain routing protocols'. Together they form a unique fingerprint.

Cite this