On realistic network topologies for simulation

Heckmann, Oliver; Piringer, Michael; Schmitt, Jens; Steinmetz, Ralf

doi:10.1145/944777.944779

Cited by 28 publications

(32 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Heckmann et al [15] discuss different types of topologies and present a collection of real-world topologies that can be used for simulation. They then define several similarity metrics, such as the shortest path distributions, node degree distributions and node rank exponents, to compare artificially generated topologies with real world topologies from AT&T's network.…”

Section: Related Workmentioning

confidence: 99%

Tuning Topology Generators Using Spectral Distributions

Haddadi

Fay

Uhlig

et al. 2008

Performance Evaluation: Metrics, Models and Benchmarks

View full text Add to dashboard Cite

Abstract. An increasing number of synthetic topology generators are available, each claiming to produce representative Internet topologies. Every generator has its own parameters, allowing the user to generate topologies with different characteristics. However, there exist no clear guidelines on tuning the value of these parameters in order to obtain a topology with specific characteristics.In this paper we optimize the parameters of several topology generators to match a given Internet topology. The optimization is performed either with respect to the link density, or to the spectrum of the normalized Laplacian matrix. Contrary to approaches in the literature that rely only on the largest eigenvalues, we take into account the set of all eigenvalues. However, we show that on their own the eigenvalues cannot be used to construct a metric for optimizing parameters. Instead we present a weighted spectral method which simultaneously takes into account all the properties of the graph.

show abstract

Section: Related Workmentioning

confidence: 99%

Tuning Topology Generators Using Spectral Distributions

Haddadi

Fay

Uhlig

et al. 2008

Performance Evaluation: Metrics, Models and Benchmarks

View full text Add to dashboard Cite

show abstract

“…We also evaluated BGPSep on synthetic topologies generated using GT-ITM [4]. The GT-ITM parameters in the graphs were set according to the suggestions in [13].…”

Section: Discussionmentioning

confidence: 99%

How to Construct a Correct and Scalable iBGP Configuration

Vutukuru¹,

Valiant²,

Kopparty³

et al. 2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

Abstract-The Internet's current interdomain routing protocol, BGP (Border Gateway Protocol), has two modes of operation: eBGP (external BGP), used to exchange routing information between autonomous systems, and iBGP (internal BGP), used to propagate that information within an autonomous system (AS). In a "full mesh" iBGP configuration, every router has a BGP session with every border router in the AS. Because a full mesh configuration has a large number of iBGP sessions and does not scale well, configurations based on route reflectors are commonly used for intra-AS route dissemination [2]. Unfortunately, route reflector configurations violate important correctness properties [12], including loop-free forwarding and complete visibility to all eBGP-learned best routes, especially in the face of router and link failures. This paper presents and analyzes the first (to our knowledge) algorithm, BGPSep, to construct an iBGP session configuration that is both correct and more scalable than a full mesh. BGPSep uses the notion of a graph separator-a small set of nodes whose removal partitions a graph into connected components of roughly equal sizes-to choose route reflectors and iBGP sessions in a way that guarantees correctness. We evaluate an implementation of the BGPSep algorithm on several real-world and simulated network topologies and find that iBGP configurations generated by BGPSep have between 2.5 to 5× fewer iBGP sessions than a full mesh.

show abstract

“…The scenarios used in our performance comparison assume the The AT&T core network topology, which is a realistic ISP topology [21] consisting of 154 nodes and 184 links. A node has 2.4 neighbors on average, and there are 14 nodes with only one neighbor.…”

Section: Performance Comparisonmentioning

confidence: 99%

A New Approach to Name-Based Link-State Routing for Information-Centric Networks

Hemmati

Garcia-Luna-Aceves

2015

Proceedings of the 2nd ACM Conference on Information-Centric Networking

View full text Add to dashboard Cite

The Link State Content Routing (LSCR) protocol is presented, which supports routing over multiple paths to named content using link-state information. LSCR uses two types of link-state advertisements (LSAs): a Router LSA that contains information about links connected to each router, and an Anchor LSA that carries information regarding a name prefix and the router that advertises being attached to that name prefix, also called an anchor of the prefix. Anchor LSAs are propagated selectively based on a diffusing mechanism. In contrast to prior content routing solutions based on link-state information, LSCR allows routers to establish multiple routes to name prefixes, without requiring each router to know about all the instantiations of each prefix. LSCR is shown to avoid permanent routing loops and to have better performance compared to traditional link-state routing protocols when a name prefix is replicated at multiple sites in the network.

show abstract

On realistic network topologies for simulation

Cited by 28 publications

References 0 publications

Tuning Topology Generators Using Spectral Distributions

Tuning Topology Generators Using Spectral Distributions

How to Construct a Correct and Scalable iBGP Configuration

A New Approach to Name-Based Link-State Routing for Information-Centric Networks

Contact Info

Product

Resources

About