Abstract

Graphs are commonly used to model the structure of internetworks, for the study of problems ranging from routing to resource reservation. A variety of graph models are found in the literature, including regular topologies such as rings or stars, "well-known" topologies such as the original ARPAnet, and randomly generated topologies. Less common is any discussion of how closely these models correlate with real network topologies. We consider the problem of efficiently generating graph models that accurately reflect the topological properties of real internetworks. We compare the properties of graphs generated using various methods with those of real internets. We also propose efficient methods for generating topologies with particular properties, including a transit-stub model that correlates well with the internet structure. Improved models for the internetwork structure have the potential to impact the significance of simulation studies of internetworking solutions, providing a basis for the validity of the conclusions.

Keywords

Network topologyComputer scienceInternetworkingReservationThe InternetTheoretical computer scienceDistributed computingComputer networkGraphWorld Wide Web

Affiliated Institutions

Related Publications

Publication Info

Year
2002
Type
article
Volume
2
Pages
594-602
Citations
1672
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

1672
OpenAlex

Cite This

Ellen Zegura, Kenneth L. Calvert, S. Bhattacharjee (2002). How to model an internetwork. , 2 , 594-602. https://doi.org/10.1109/infcom.1996.493353

Identifiers

DOI
10.1109/infcom.1996.493353