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

Keywords

  • Communicatuion networks
  • network topology
  • random graphs

Fingerprint Dive into the research topics of 'Random graph models of communication network topologies'. Together they form a unique fingerprint.

  • Cite this

    Reittu, H., & Norros, I. (2008). Random graph models of communication network topologies. In Proceedings of the International Conference on Complex Systems http://necsi.org/events/iccs7/papers/413721fe6c3262c471ca66aca4e7.pdf