“the geography of the internet infrastructure: a simulation approach based on the barabasi-albert...

“The Geography of the Internet Infrastructure:A simulation approach based on the Barabasi-

Albert model”Sandra Vinciguerra and Keon Frenken

URU – Utrecht UniversityS.Vinciguerra@geo.uu.nl

DIME workshop

Distributed Networks and the Knowledge-based Economy

10-11 May 2007

European Fiber-Optic Backbone Network - 2001

Size and providers

Barabàsi-Albert’s Scale Free Network Model

The algorithm of the model is based on two mechanisms (Barabási and Albert, 1999):

• Incremental Growth: networks are dynamic systems, the number of nodes grows with time;

• Preferential Attachment: new nodes are not randomly connected to the existing nodes; they are linked with greater likelihood to highly connected nodes:

Scale Free networks are characterized by the presence of few nodes that are highly connected – hubs – while the majority of nodes have only a few links. (k is the connectivity of node j)

jj

jji k

k

Preferential attachment in Internet infrastructure:

geography matters

To reduce costs, new cities entering the network prefer:

- to connect to highly connected cities

- to connect to nearby cities

ijj

j

jji

dk

k 1

α ≥ 0

Pi: probability of city i to connect to city jkj: connectivity of city jdij: geographical distance between city i and city j

… and capacity also matters

In reality, locations already connected can increase the capacity of existing connections

A new node prefers to attach itself to nodes with high capacity (sj)

ijj

j

j

ijj

j

jji

ds

s

dk

k 1)1(

1

α ≥ 0, 0 ≤ β ≤ 1

Simulation

α=7 β=0

α=7 β=0

α=7 β=0

α=7 β=0

Simulation

α=3 β=1

α=3 β=1

α=3 β=1

α=3 β=1

Results

We simulated the model for 1300 time steps (that means for a total of 1300 links) for 209 cities entering the networkWe compared simulated with real data, for different values of parameters α and β, on the basis of two properties, :

• Average path length • Node degree distribution

Results on average path length (1300 iterations)

Average Path Length

0

1

2

3

4

5

6

7

8

9

1 51 101 151 201 251 301 351 401 451 501 551 601 651 701 751 801 851 901 951 1001 1051 1101 1151 1201 1251 1301

simulation step

av

era

ge

pa

th le

ng

th

alpha 0

alpha 1

alpha 2

alpha 3

alpha 4

beta=0

1

10

100

1 10 100 1000

rank

de

gre

e

alpha=0alpha=1alpha=2alpha=3alpha=4alpha=5alpha=6alpha=7real data

beta=1

1

10

100

1 10 100 1000

rank

de

gre

e

alpha=0alpha=1alpha=2alpha=3alpha=4alpha=5alpha=6alpha=7real data

Node degree distribution

Institutional distance γ

Institutional distance can be easily implemented in the model by assuming that cities within the same country have a higher probability to connect.

Generally for gamma=1 country borders are not important to create a connection while a higher value of γ means that country borders strongly influence the creation connections between two different countries

1*

1)1(

1

ijj

j

j

ijj

j

jji

ds

s

dk

k

α ≥ 0, 0 ≤ β ≤ 1, γ ≥ 1

Results on average path length including country barriers and early entrants (London, Paris, Amsterdam,

Hamburg)average path length (alpha = 4)

0

2

4

6

8

10

12

14

1 60 119 178 237 296 355 414 473 532 591 650 709 768 827 886 945 1004 1063 1122 1181 1240 1299

simulation step

av

era

ge

pa

th l

en

gth

gamma 1

gamma 2

gamma 3

gamma 4

Simulation

α=4 β=1 γ=4

London - Paris - Amsterdam - Hamburg

Comparison

real network simulated network

QAP - correlation

Pearson Correlation: 0.324 P-value: 0.000

Simple Matching: 0.967 P-value: 0.000

Future research

• Further examine early entrants– Academic centers in the 1980s

• Validate the model more thoroughly– Monte Carlo simulations– Degree distributions– Weight distributions– Use U.S. data

Thank you