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 Citations (Scopus)

Abstract

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
Pages2210-2218
Number of pages9
DOIs
StatePublished - Dec 1 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

Other

Other2006 Winter Simulation Conference, WSC
CountryUnited States
CityMonterey, CA
Period12/3/0612/6/06

Fingerprint

Routing Protocol
Routing protocols
Routing
Model Reduction
Internet
Router
Routers
Path
Contraction
Internet protocols
Network Simulation
Experimental Validation
Violate
Vertex of a graph
Compatibility
Deletion
Network Model
Categorical or nominal
Tables
Subgraph

All Science Journal Classification (ASJC) codes

  • Software
  • Modeling and Simulation
  • Computer Science Applications

Cite this

Carl, G., Phoha, S., Kesidis, G., & Madan, B. (2006). Path preserving scale down for validation of internet inter-domain routing protocols. In Proceedings of the 2006 Winter Simulation Conference, WSC (pp. 2210-2218). [4117871] (Proceedings - Winter Simulation Conference). https://doi.org/10.1109/WSC.2006.323023
Carl, Glenn ; Phoha, Shashi ; Kesidis, George ; Madan, Bharat. / Path preserving scale down for validation of internet inter-domain routing protocols. Proceedings of the 2006 Winter Simulation Conference, WSC. 2006. pp. 2210-2218 (Proceedings - Winter Simulation Conference).
@inproceedings{e791320cc855413eb1ad6a7d82bca309,
title = "Path preserving scale down for validation of internet inter-domain routing protocols",
abstract = "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.",
author = "Glenn Carl and Shashi Phoha and George Kesidis and Bharat Madan",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/WSC.2006.323023",
language = "English (US)",
isbn = "1424405017",
series = "Proceedings - Winter Simulation Conference",
pages = "2210--2218",
booktitle = "Proceedings of the 2006 Winter Simulation Conference, WSC",

}

Carl, G, Phoha, S, Kesidis, G & Madan, B 2006, Path preserving scale down for validation of internet inter-domain routing protocols. in Proceedings of the 2006 Winter Simulation Conference, WSC., 4117871, Proceedings - Winter Simulation Conference, pp. 2210-2218, 2006 Winter Simulation Conference, WSC, Monterey, CA, United States, 12/3/06. https://doi.org/10.1109/WSC.2006.323023

Path preserving scale down for validation of internet inter-domain routing protocols. / Carl, Glenn; Phoha, Shashi; Kesidis, George; Madan, Bharat.

Proceedings of the 2006 Winter Simulation Conference, WSC. 2006. p. 2210-2218 4117871 (Proceedings - Winter Simulation Conference).

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

TY - GEN

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

AU - Carl, Glenn

AU - Phoha, Shashi

AU - Kesidis, George

AU - Madan, Bharat

PY - 2006/12/1

Y1 - 2006/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=46149108841&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46149108841&partnerID=8YFLogxK

U2 - 10.1109/WSC.2006.323023

DO - 10.1109/WSC.2006.323023

M3 - Conference contribution

SN - 1424405017

SN - 9781424405015

T3 - Proceedings - Winter Simulation Conference

SP - 2210

EP - 2218

BT - Proceedings of the 2006 Winter Simulation Conference, WSC

ER -

Carl G, Phoha S, Kesidis G, Madan B. Path preserving scale down for validation of internet inter-domain routing protocols. In Proceedings of the 2006 Winter Simulation Conference, WSC. 2006. p. 2210-2218. 4117871. (Proceedings - Winter Simulation Conference). https://doi.org/10.1109/WSC.2006.323023