Powernet: Compact routing on Internet-like random networks

Ilkka Norros

doi:10.1109/NGI.2009.5175777

Powernet: Compact routing on Internet-like random networks

Ilkka Norros

VTT Technical Research Centre of Finland

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

8 Citations (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) 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 language	English
Title of host publication	Proceedings
Subtitle of host publication	Next Generation Internet Networks, NGI 2009
Place of Publication	Piscataway, NJ, USA
Publisher	IEEE Institute of Electrical and Electronic Engineers
Number of pages	8
ISBN (Print)	978-1-4244-4244-7, 978-1-4244-4245-4
DOIs	https://doi.org/10.1109/NGI.2009.5175777
Publication status	Published - 2009
MoE publication type	A4 Article in a conference publication
Event	Next Generation Internet Networks, NGI 2009 - Aveiro, Portugal Duration: 1 Jul 2009 → 3 Jul 2009

Conference

Conference	Next Generation Internet Networks, NGI 2009
Abbreviated title	NGI 2009
Country/Territory	Portugal
City	Aveiro
Period	1/07/09 → 3/07/09

Keywords

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

Access to Document

10.1109/NGI.2009.5175777

Cite this

@inproceedings{003518240cfb4cc698b7bbe1dcb89c0b,

title = "Powernet: Compact routing on Internet-like random networks",

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) 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.)",

keywords = "Internet, graph theory, network theory (graphs), random processes, telecommunication network routing, telecommunication network topology",

author = "Ilkka Norros",

note = "Project code: 28474 ; Next Generation Internet Networks, NGI 2009, NGI 2009 ; Conference date: 01-07-2009 Through 03-07-2009",

year = "2009",

doi = "10.1109/NGI.2009.5175777",

language = "English",

isbn = "978-1-4244-4244-7",

booktitle = "Proceedings",

publisher = "IEEE Institute of Electrical and Electronic Engineers",

address = "United States",

}

TY - GEN

T1 - Powernet

T2 - Next Generation Internet Networks, NGI 2009

AU - Norros, Ilkka

N1 - Project code: 28474

PY - 2009

Y1 - 2009

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

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

KW - Internet

KW - graph theory

KW - network theory (graphs)

KW - random processes

KW - telecommunication network routing

KW - telecommunication network topology

U2 - 10.1109/NGI.2009.5175777

DO - 10.1109/NGI.2009.5175777

M3 - Conference article in proceedings

SN - 978-1-4244-4244-7

SN - 978-1-4244-4245-4

BT - Proceedings

PB - IEEE Institute of Electrical and Electronic Engineers

CY - Piscataway, NJ, USA

Y2 - 1 July 2009 through 3 July 2009

ER -

Powernet: Compact routing on Internet-like random networks

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this