Random graph models of communication network topologies

Hannu Reittu, Ilkka Norros

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientific

Abstract

We consider random graph with power-law degree distribution as a model of communication networks. Previous results deal with asymtotic structure, appearing only in the limit of arbitrary large number of nodes. In this work we showed that the asymptotic regime is reached with reasonable rate of convergence, provided that the degree distribution has fat-enough tail.
Original languageEnglish
Title of host publicationProceedings of the International Conference on Complex Systems
Place of PublicationUSA
Number of pages8
Publication statusPublished - 2008
MoE publication typeB3 Non-refereed article in conference proceedings
EventInternational Conference on Complex Systems - Boston, United States
Duration: 27 Oct 20072 Nov 2007

Conference

ConferenceInternational Conference on Complex Systems
CountryUnited States
CityBoston
Period27/10/072/11/07

Fingerprint

Degree Distribution
Graph Model
Random Graphs
Communication Networks
Network Topology
Fat Tails
Power-law Distribution
Rate of Convergence
Arbitrary
Vertex of a graph
Model

Keywords

  • Communicatuion networks
  • network topology
  • random graphs

Cite this

Reittu, H., & Norros, I. (2008). Random graph models of communication network topologies. In Proceedings of the International Conference on Complex Systems USA.
Reittu, Hannu ; Norros, Ilkka. / Random graph models of communication network topologies. Proceedings of the International Conference on Complex Systems. USA, 2008.
@inproceedings{8450d1adc8b0473f9af99cd50da9c3fc,
title = "Random graph models of communication network topologies",
abstract = "We consider random graph with power-law degree distribution as a model of communication networks. Previous results deal with asymtotic structure, appearing only in the limit of arbitrary large number of nodes. In this work we showed that the asymptotic regime is reached with reasonable rate of convergence, provided that the degree distribution has fat-enough tail.",
keywords = "Communicatuion networks, network topology, random graphs",
author = "Hannu Reittu and Ilkka Norros",
year = "2008",
language = "English",
booktitle = "Proceedings of the International Conference on Complex Systems",

}

Reittu, H & Norros, I 2008, Random graph models of communication network topologies. in Proceedings of the International Conference on Complex Systems. USA, International Conference on Complex Systems, Boston, United States, 27/10/07.

Random graph models of communication network topologies. / Reittu, Hannu; Norros, Ilkka.

Proceedings of the International Conference on Complex Systems. USA, 2008.

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientific

TY - GEN

T1 - Random graph models of communication network topologies

AU - Reittu, Hannu

AU - Norros, Ilkka

PY - 2008

Y1 - 2008

N2 - We consider random graph with power-law degree distribution as a model of communication networks. Previous results deal with asymtotic structure, appearing only in the limit of arbitrary large number of nodes. In this work we showed that the asymptotic regime is reached with reasonable rate of convergence, provided that the degree distribution has fat-enough tail.

AB - We consider random graph with power-law degree distribution as a model of communication networks. Previous results deal with asymtotic structure, appearing only in the limit of arbitrary large number of nodes. In this work we showed that the asymptotic regime is reached with reasonable rate of convergence, provided that the degree distribution has fat-enough tail.

KW - Communicatuion networks

KW - network topology

KW - random graphs

M3 - Conference article in proceedings

BT - Proceedings of the International Conference on Complex Systems

CY - USA

ER -

Reittu H, Norros I. Random graph models of communication network topologies. In Proceedings of the International Conference on Complex Systems. USA. 2008