A quantitative comparison of graph-based models for Internettopology
Zegura, E.W.
Calvert, K.L.
Donahoo, M.J.
Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA;
This paper appears in: Networking, IEEE/ACM Transactions on
Publication Date: Dec 1997
Volume: 5,
Issue: 6
On page(s): 770-783
ISSN: 1063-6692
References Cited: 24
CODEN: IEANEP
INSPEC Accession Number: 5827709
Digital Object Identifier: 10.1109/90.650138
Current Version Published: 2002-08-06
Abstract
Graphs are commonly used to model the topological structure of
internetworks in order to study problems ranging from routing to
resource reservation. A variety of graphs are found in the literature,
including fixed topologies such as rings or stars,
“well-known” topologies such as the ARPAnet, and randomly
generated topologies. While many researchers rely upon graphs for
analytic and simulation studies, there has been little analysis of the
implications of using a particular model or how the graph generation
method may affect the results of such studies. Further, the selection of
one generation method over another is often arbitrary, since the
differences and similarities between methods are not well understood.
This paper considers the problem of generating and selecting graphs that
reflect the properties of real internetworks. We review generation
methods in common use and also propose several new methods. We consider
a set of metrics that characterize the graphs produced by a method, and
we quantify similarities and differences among several generation
methods with respect to these metrics. We also consider the effect of
the graph model in the context of a specific problem, namely multicast
routing
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
