Thumbnail
Access Restriction
Subscribed

Author Schapira, Michael ♦ Goldberg, Sharon ♦ Gill, Phillipa
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Simulations ♦ Interdomain routing ♦ Bgp
Abstract Researchers studying the interdomain routing system, its properties and new protocols, face many challenges in performing realistic evaluations and simulations. Modeling decisions with respect to AS-level topology, routing policies and traffic matrices are complicated by a scarcity of ground truth for each of these components. Moreover, scalability issues arise when attempting to simulate over large (although still incomplete) empirically-derived AS-level topologies. In this paper, we discuss our approach for analyzing the robustness of our results to incomplete empirical data. We do this by (1) developing fast simulation algorithms that enable us to (2) running multiple simulations with varied parameters that test the sensitivity of our research results.
Description Affiliation: Hebrew University at Jerusalem, Jerusalem, Israel (Schapira, Michael) || Boston University, Boston, MA, USA (Goldberg, Sharon) || University of Toronto, Toronto, ON, Canada (Gill, Phillipa)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1993-07-01
Publisher Place New York
Journal ACM SIGCOMM Computer Communication Review (CCRV)
Volume Number 42
Issue Number 1
Page Count 7
Starting Page 40
Ending Page 46


Open content in new tab

   Open content in new tab
Source: ACM Digital Library