“The Geography of the Internet Infrastructure: A simulation approach based on the Barabasi-Albert model” Sandra Vinciguerra and Keon Frenken URU – Utrecht.

Slides:



Advertisements
Similar presentations
Complex Networks: Complex Networks: Structures and Dynamics Changsong Zhou AGNLD, Institute für Physik Universität Potsdam.
Advertisements

Network analysis Sushmita Roy BMI/CS 576
Scale Free Networks.
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
Analysis and Modeling of Social Networks Foudalis Ilias.
Leaders and clusters in social space Janusz Hołyst Faculty of Physics and Center of Excellence for Complex Systems Research (CSR), Warsaw University of.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Company LOGO 1 Identity and Search in Social Networks D.J.Watts, P.S. Dodds, M.E.J. Newman Maryam Fazel-Zarandi.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Hierarchy in networks Peter Náther, Mária Markošová, Boris Rudolf Vyjde : Physica A, dec
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
Network growth under the constraint of synchronization stability Xingang Wang Department of Physics, ZJU Oct. 17, 2010, Suzhou.
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Link creation and profile alignment in the aNobii social network Luca Maria Aiello et al. Social Computing Feb 2014 Hyewon Lim.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
The Barabási-Albert [BA] model (1999) ER Model Look at the distribution of degrees ER ModelWS Model actorspower grid www The probability of finding a highly.
Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.
A Real-life Application of Barabasi’s Scale-Free Power-Law Presentation for ENGS 112 Doug Madory Wed, 1 JUN 05 Fri, 27 MAY 05.
Identifying Patterns in Road Networks Topographic Data and Maps Henri Lahtinen Arto Majoinen.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)
Global topological properties of biological networks.
Small World Networks Somsubhra Sharangi Computing Science, Simon Fraser University.
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
On Distinguishing between Internet Power Law B Bu and Towsley Infocom 2002 Presented by.
Error and Attack Tolerance of Complex Networks Albert, Jeong, Barabási (presented by Walfredo)
Summary from Previous Lecture Real networks: –AS-level N= 12709, M=27384 (Jan 02 data) route-views.oregon-ix.net, hhtp://abroude.ripe.net/ris/rawdata –
Social Networks Based Ad Hoc Mobility Models Mirco Musolesi Stephen Hailes Cecilia Mascolo University College London 3 rd UK-Ubinet Workshop Bath, 9-11.
Network Formation Can we model it? Oh yeahhhhhhh!
Attack-Resistant Networks Allen G. Taylor Communication networks have four primary objectives: Minimize.
Conference title 1 A Few Bad Apples Are Enough. An Agent-Based Peer Review Game. Juan Bautista Cabotà, Francisco Grimaldo (U. València) Lorena Cadavid.
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Popularity versus Similarity in Growing Networks Fragiskos Papadopoulos Cyprus University of Technology M. Kitsak, M. Á. Serrano, M. Boguñá, and Dmitri.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
Measurement, Modeling and Analysis of the Internet Wang Xiaofei Vishal Misra, Columbia University.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
The Geography and Evolution of the European Internet Infrastructure Sandra Vinciguerra URU – Utrecht University
Class 9: Barabasi-Albert Model-Part I
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Research & development Hendrik Schmidt France Telecom NSM/RD/RESA/NET SpasWin07, Limassol, Cyprus 16 April 2007 Comparison.
Performance Evaluation Lecture 1: Complex Networks Giovanni Neglia INRIA – EPI Maestro 10 December 2012.
Teachers Teaching With Technology 2010 Annual Meeting - Atlanta, GA Ray Barton, Olympus High, SLC, UT.
Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
The simultaneous evolution of author and paper networks
Structures of Networks
Link-Level Internet Structures
Lecture 1: Complex Networks
Topics In Social Computing (67810)
Learning to Generate Networks
On Growth of Limited Scale-free Overlay Network Topologies
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
Models of networks (synthetic networks or generative models): Random, Small-world, Scale-free, Configuration model and Random geometric model By: Ralucca.
Generative Model To Construct Blog and Post Networks In Blogosphere
A Locality Model of the Evolution of Blog Networks
The likelihood of linking to a popular website is higher
Small World Networks Scotty Smith February 7, 2007.
Department of Computer Science University of York
Peer-to-Peer and Social Networks
From the Synthetic networks slide deck (didn’t have a chance to go over them at that time) By: Ralucca Gera, NPS.
Statistics of Extreme Fluctuations in Task Completion Landscapes
Network Science: A Short Introduction i3 Workshop
Presentation transcript:

“The Geography of the Internet Infrastructure: A simulation approach based on the Barabasi-Albert model” Sandra Vinciguerra and Keon Frenken URU – Utrecht University DIME workshop Distributed Networks and the Knowledge-based Economy May 2007

European Fiber-Optic Backbone Network

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)

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 α ≥ 0 Pi: probability of city i to connect to city j k j : connectivity of city j d ij : 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) α ≥ 0, 0 ≤ β ≤ 1

Simulation α=7 β=0

Simulation α=3 β=1

Results We simulated the model for 1300 time steps (that means for a total of 1300 links) for 209 cities entering the network We 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)

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 α ≥ 0, 0 ≤ β ≤ 1, γ ≥ 1

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

Simulation α=4 β=1 γ=4 London - Paris - Amsterdam - Hamburg

Comparison real networksimulated network

QAP - correlation Pearson Correlation: P-value: Simple Matching: 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

Internet-Map Thank you