Routing in an internet-scale network emulator

Jay Chen, Diwaker Gupta, Kashi V. Vishwanath, Alex C. Snoeren, Amin Vahdat

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

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.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2004
EditorsD. DeGroot, P. Harrison
Pages275-283
Number of pages9
DOIs
StatePublished - Dec 1 2004
EventProceedings - IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2004 - Volendam, Netherlands
Duration: Oct 4 2004Oct 8 2004

Other

OtherProceedings - IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2004
CountryNetherlands
CityVolendam
Period10/4/0410/8/04

Fingerprint

Topology
Internet

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Chen, J., Gupta, D., Vishwanath, K. V., Snoeren, A. C., & Vahdat, A. (2004). Routing in an internet-scale network emulator. In D. DeGroot, & P. Harrison (Eds.), Proceedings - IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2004 (pp. 275-283) https://doi.org/10.1109/MASCOT.2004.1348282

Routing in an internet-scale network emulator. / Chen, Jay; Gupta, Diwaker; Vishwanath, Kashi V.; Snoeren, Alex C.; Vahdat, Amin.

Proceedings - IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2004. ed. / D. DeGroot; P. Harrison. 2004. p. 275-283.

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

Chen, J, Gupta, D, Vishwanath, KV, Snoeren, AC & Vahdat, A 2004, Routing in an internet-scale network emulator. in D DeGroot & P Harrison (eds), Proceedings - IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2004. pp. 275-283, Proceedings - IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2004, Volendam, Netherlands, 10/4/04. https://doi.org/10.1109/MASCOT.2004.1348282
Chen J, Gupta D, Vishwanath KV, Snoeren AC, Vahdat A. Routing in an internet-scale network emulator. In DeGroot D, Harrison P, editors, Proceedings - IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2004. 2004. p. 275-283 https://doi.org/10.1109/MASCOT.2004.1348282
Chen, Jay ; Gupta, Diwaker ; Vishwanath, Kashi V. ; Snoeren, Alex C. ; Vahdat, Amin. / Routing in an internet-scale network emulator. Proceedings - IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2004. editor / D. DeGroot ; P. Harrison. 2004. pp. 275-283
@inproceedings{329f888a9b4e453cb935cba409b8cd42,
title = "Routing in an internet-scale network emulator",
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 = "Jay Chen and Diwaker Gupta and Vishwanath, {Kashi V.} and Snoeren, {Alex C.} and Amin Vahdat",
year = "2004",
month = "12",
day = "1",
doi = "10.1109/MASCOT.2004.1348282",
language = "English (US)",
isbn = "0769522513",
pages = "275--283",
editor = "D. DeGroot and P. Harrison",
booktitle = "Proceedings - IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2004",

}

TY - GEN

T1 - Routing in an internet-scale network emulator

AU - Chen, Jay

AU - Gupta, Diwaker

AU - Vishwanath, Kashi V.

AU - Snoeren, Alex C.

AU - Vahdat, Amin

PY - 2004/12/1

Y1 - 2004/12/1

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.

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

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

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

U2 - 10.1109/MASCOT.2004.1348282

DO - 10.1109/MASCOT.2004.1348282

M3 - Conference contribution

AN - SCOPUS:16244399813

SN - 0769522513

SP - 275

EP - 283

BT - Proceedings - IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2004

A2 - DeGroot, D.

A2 - Harrison, P.

ER -