Powernet: Compact routing on Internet-like random networks

Ilkka Norros

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

8 Citations (Scopus)


It is generally recognized that the current routing scheme of Internet suffers from serious scalability problems. In this paper, we work with the abstract but 'Internet-like' network model consisting of an infinite-variance power-law random graph (IVPLRG) and adopt the idea of a routing scheme proposed by Carmi, Cohen and Dolev (C-C-D). The scheme fits very naturally to the spontaneously emerging 'soft hierarchy' architecture on an IVPLRG. The use of multiple addresses is studied as a solution to the inflexibility of the pure C-C-D scheme. A new mean-field methodology is introduced for the efficient computation of relevant quantitative characteristics. (10 refs.)
Original languageEnglish
Title of host publicationProceedings
Subtitle of host publicationNext Generation Internet Networks, NGI 2009
Place of PublicationPiscataway, NJ, USA
PublisherIEEE Institute of Electrical and Electronic Engineers
Number of pages8
ISBN (Print)978-1-4244-4244-7, 978-1-4244-4245-4
Publication statusPublished - 2009
MoE publication typeA4 Article in a conference publication
EventNext Generation Internet Networks, NGI 2009 - Aveiro, Portugal
Duration: 1 Jul 20093 Jul 2009


ConferenceNext Generation Internet Networks, NGI 2009
Abbreviated titleNGI 2009


  • Internet
  • graph theory
  • network theory (graphs)
  • random processes
  • telecommunication network routing
  • telecommunication network topology


Dive into the research topics of 'Powernet: Compact routing on Internet-like random networks'. Together they form a unique fingerprint.

Cite this