Tuning topology generators using spectral distributions

Hamed Haddadi, Damien Fay, Steve Uhlig, Andrew Moore, Richard Mortier, Almerima Jamakovic, Miguel Rio

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

16 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages154-173
Number of pages20
Volume5119 LNCS
DOIs
Publication statusPublished - 1 Dec 2008
Externally publishedYes
EventSPEC International Performance Evaluation Workshop, SIPEW 2008 - Darmstadt, Germany
Duration: 27 Jun 200828 Jun 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5119 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherSPEC International Performance Evaluation Workshop, SIPEW 2008
CountryGermany
CityDarmstadt
Period27/6/0828/6/08

Fingerprint

Spectral Distribution
Tuning
Topology
Generator
Internet
Eigenvalue
Laplacian Matrix
Largest Eigenvalue
Spectral Methods
Optimise
Metric
Optimization
Graph in graph theory

Keywords

  • Graph Spectrum
  • Internet Topology

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Haddadi, H., Fay, D., Uhlig, S., Moore, A., Mortier, R., Jamakovic, A., & Rio, M. (2008). Tuning topology generators using spectral distributions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5119 LNCS, pp. 154-173). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5119 LNCS). https://doi.org/10.1007/978-3-540-69814-2-11

Tuning topology generators using spectral distributions. / Haddadi, Hamed; Fay, Damien; Uhlig, Steve; Moore, Andrew; Mortier, Richard; Jamakovic, Almerima; Rio, Miguel.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5119 LNCS 2008. p. 154-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5119 LNCS).

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

Haddadi, H, Fay, D, Uhlig, S, Moore, A, Mortier, R, Jamakovic, A & Rio, M 2008, Tuning topology generators using spectral distributions. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5119 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5119 LNCS, pp. 154-173, SPEC International Performance Evaluation Workshop, SIPEW 2008, Darmstadt, Germany, 27/6/08. https://doi.org/10.1007/978-3-540-69814-2-11
Haddadi H, Fay D, Uhlig S, Moore A, Mortier R, Jamakovic A et al. Tuning topology generators using spectral distributions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5119 LNCS. 2008. p. 154-173. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-69814-2-11
Haddadi, Hamed ; Fay, Damien ; Uhlig, Steve ; Moore, Andrew ; Mortier, Richard ; Jamakovic, Almerima ; Rio, Miguel. / Tuning topology generators using spectral distributions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5119 LNCS 2008. pp. 154-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fbfa2f5aa28345259791747968bff1b5,
title = "Tuning topology generators using spectral distributions",
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.",
keywords = "Graph Spectrum, Internet Topology",
author = "Hamed Haddadi and Damien Fay and Steve Uhlig and Andrew Moore and Richard Mortier and Almerima Jamakovic and Miguel Rio",
year = "2008",
month = "12",
day = "1",
doi = "10.1007/978-3-540-69814-2-11",
language = "English",
isbn = "3540698132",
volume = "5119 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "154--173",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Tuning topology generators using spectral distributions

AU - Haddadi, Hamed

AU - Fay, Damien

AU - Uhlig, Steve

AU - Moore, Andrew

AU - Mortier, Richard

AU - Jamakovic, Almerima

AU - Rio, Miguel

PY - 2008/12/1

Y1 - 2008/12/1

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

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

KW - Graph Spectrum

KW - Internet Topology

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

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

U2 - 10.1007/978-3-540-69814-2-11

DO - 10.1007/978-3-540-69814-2-11

M3 - Conference contribution

AN - SCOPUS:70349884154

SN - 3540698132

SN - 9783540698135

VL - 5119 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 154

EP - 173

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -