Powering Internet with power-law networking

Ilkka Norros (Corresponding Author), H. Flinck

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)

Abstract

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). We 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 suggested as a solution to the inflexibility of the pure C-C-D scheme. A mean-field approximation is introduced for efficient computation of relevant quantitative characteristics and applied to various problems of our scheme. We review a few recent Internet routing proposals and discuss their relation to our scheme. We find out that the topology creation of our scheme offers advantages in terms of scalability and routing policy control.
Original languageEnglish
Pages (from-to)63-75
Number of pages13
JournalTelecommunication Systems
Volume48
Issue number1-2
DOIs
Publication statusPublished - 2011
MoE publication typeA1 Journal article-refereed

Fingerprint

Internet
Scalability
Topology

Keywords

  • Locator-identifier separation
  • Compact routing
  • Power-law
  • Random graph

Cite this

Norros, Ilkka ; Flinck, H. / Powering Internet with power-law networking. In: Telecommunication Systems. 2011 ; Vol. 48, No. 1-2. pp. 63-75.
@article{3f7b6bea1f544dfea23ef2c9737063d9,
title = "Powering Internet with power-law networking",
abstract = "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). We 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 suggested as a solution to the inflexibility of the pure C-C-D scheme. A mean-field approximation is introduced for efficient computation of relevant quantitative characteristics and applied to various problems of our scheme. We review a few recent Internet routing proposals and discuss their relation to our scheme. We find out that the topology creation of our scheme offers advantages in terms of scalability and routing policy control.",
keywords = "Locator-identifier separation, Compact routing, Power-law, Random graph",
author = "Ilkka Norros and H. Flinck",
year = "2011",
doi = "10.1007/s11235-010-9334-y",
language = "English",
volume = "48",
pages = "63--75",
journal = "Telecommunication Systems",
issn = "1018-4864",
publisher = "Springer",
number = "1-2",

}

Powering Internet with power-law networking. / Norros, Ilkka (Corresponding Author); Flinck, H.

In: Telecommunication Systems, Vol. 48, No. 1-2, 2011, p. 63-75.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Powering Internet with power-law networking

AU - Norros, Ilkka

AU - Flinck, H.

PY - 2011

Y1 - 2011

N2 - 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). We 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 suggested as a solution to the inflexibility of the pure C-C-D scheme. A mean-field approximation is introduced for efficient computation of relevant quantitative characteristics and applied to various problems of our scheme. We review a few recent Internet routing proposals and discuss their relation to our scheme. We find out that the topology creation of our scheme offers advantages in terms of scalability and routing policy control.

AB - 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). We 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 suggested as a solution to the inflexibility of the pure C-C-D scheme. A mean-field approximation is introduced for efficient computation of relevant quantitative characteristics and applied to various problems of our scheme. We review a few recent Internet routing proposals and discuss their relation to our scheme. We find out that the topology creation of our scheme offers advantages in terms of scalability and routing policy control.

KW - Locator-identifier separation

KW - Compact routing

KW - Power-law

KW - Random graph

U2 - 10.1007/s11235-010-9334-y

DO - 10.1007/s11235-010-9334-y

M3 - Article

VL - 48

SP - 63

EP - 75

JO - Telecommunication Systems

JF - Telecommunication Systems

SN - 1018-4864

IS - 1-2

ER -