The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.

Slides:

Advertisements

Similar presentations

Albert-László Barabási

Advertisements

Lecture 21 Network evolution Slides are modified from Jurij Leskovec, Jon Kleinberg and Christos Faloutsos.

Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.

Synopsis of “Emergence of Scaling in Random Networks”* *Albert-Laszlo Barabasi and Reka Albert, Science, Vol 286, 15 October 1999 Presentation for ENGS.

On Power-Law Relationships of the Internet Topology Michalis Faloutsos Petros Faloutsos Christos Faloutsos.

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.

School of Information University of Michigan SI 614 Random graphs & power law networks preferential attachment Lecture 7 Instructor: Lada Adamic.

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.

Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.

On the Spread of Viruses on the Internet Noam Berger Joint work with C. Borgs, J.T. Chayes and A. Saberi.

CS728 Lecture 5 Generative Graph Models and the Web.

Erzsébet Ravasz, Zoltán Dezsö

Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet

Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.

Exp. vs. Scale-Free Poisson distribution Exponential Network Power-law distribution Scale-free Network.

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.

The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.

Social Networks and Graph Mining Christos Faloutsos CMU - MLD.

Principles in Communication Networks Instractor: Prof. Yuval Shavitt, –Office hours: room 303 s/w eng. bldg., Tue 14:00- 15:00 Prerequisites (דרישות קדם):

1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.

From Complex Networks to Human Travel Patterns Albert-László Barabási Center for Complex Networks Research Northeastern University Department of Medicine.

Network Design IS250 Spring 2010 John Chuang. 2 Questions  What does the Internet look like? -Why do we care?  Are there any structural invariants?

Principles in Communication Networks Instractor: Prof. Yuval Shavitt, –Office hours: room 303 s/w eng. bldg., Tue 14:00- 15:00 Prerequisites (דרישות קדם):

Mapping the Internet Topology Via Multiple Agents.

Web as Graph – Empirical Studies The Structure and Dynamics of Networks.

Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏

Jellyfish, and other Interesting creatures Of the Internet Scott Kirkpatrick, Hebrew University with Avishalom Shalit, Sorin Solomon, Shai Carmi, Eran.

Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)

AITIA International Inc. and Lorand Eotvos University, Budapest ROBUST NETWORKS FROM LOCAL OPTIMIZATION A Bottom-Up Model to Generate Networks with Skewed.

CS Lecture 6 Generative Graph Models Part II.

Principles in Communication Networks Instractor: Dr. Yuval Shavitt, –Office hours: room 303 s/w eng. bldg., Mon 14:00- 15:00 Prerequisites (דרישות קדם):

The structure of the Internet. The Internet as a graph Remember: the Internet is a collection of networks called autonomous systems (ASs) The Internet.

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 –

Computer Science 1 Web as a graph Anna Karpovsky.

Measurement and Evolution of Online Social Networks Review of paper by Ophir Gaathon Analysis of Social Information Networks COMS , Spring 2011,

Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.

Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.

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.

Models and Algorithms for Complex Networks Networks and Measurements Lecture 3.

Complex networks A. Barrat, LPT, Université Paris-Sud, France I. Alvarez-Hamelin (LPT, Orsay, France) M. Barthélemy (CEA, France) L. Dall’Asta (LPT, Orsay,

Statistical Mechanics of Complex Networks: Economy, Biology and Computer Networks Albert Diaz-Guilera Universitat de Barcelona.

Dynamics of Complex Networks I: Networks II: Percolation Panos Argyrakis Department of Physics University of Thessaloniki.

1 Spectral Analysis of Power-Law Graphs and its Application to Internet Topologies Milena Mihail Georgia Tech.

Stefano Boccaletti Complex networks in science and society *Istituto Nazionale di Ottica Applicata - Largo E. Fermi, Florence, ITALY *CNR-Istituto.

“Adversarial Deletion in Scale Free Random Graph Process” by A.D. Flaxman et al. Hammad Iqbal CS April 2006.

Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.

Complex Networks First Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.

Principles in Communication Networks Instructor: Prof. Yuval Shavitt, –Office hours: room 303 s/w eng. bldg., Sun12:00- 13:00 Prerequisites (דרישות קדם):

Part 1: Biological Networks 1.Protein-protein interaction networks 2.Regulatory networks 3.Expression networks 4.Metabolic networks 5.… more biological.

Complex Network Theory – An Introduction Niloy Ganguly.

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.

Complex Network Theory – An Introduction Niloy Ganguly.

KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators:

Jellyfish, and other Interesting creatures Of the Internet Scott Kirkpatrick, Hebrew University with Avishalom Shalit, Sorin Solomon, Shai Carmi, Eran.

An Effective Method to Improve the Resistance to Frangibility in Scale-free Networks Kaihua Xu HuaZhong Normal University.

March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.

Abstract Networks. WWW (2000) Scientific Collaboration Girvan & Newman (2002)

Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.

Scale-free and Hierarchical Structures in Complex Networks L. Barabasi, Z. Dezso, E. Ravasz, S.H. Yook and Z. Oltvai Presented by Arzucan Özgür.

Structures of Networks

Topics In Social Computing (67810)

Peer-to-Peer and Social Networks Fall 2017

Peer-to-Peer and Social Networks

Presentation transcript:

The structure of the Internet

How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they may not be efficient for some topologies –Knowledge of the topology can aid in optimizing protocols

The Internet as a graph Remember: the Internet is a collection of networks called autonomous systems (ASs) The Internet graph: –The AS graph Nodes: ASs, links: AS peering –The router level graph Nodes: routers, links: fibers, cables, MW channels, etc. How does it looks like?

Random graphs in Mathematics The Erdös-Rényi model Generation: –create n nodes. –each possible link is added with probability p. Number of links: np If we want to keep the number of links linear, what happen to p as n  ? Poisson distribution

The Waxman model Integrating distance with the E-R model Generation –Spread n nodes on a large enough grid. –Pick a link uar and add it with prob. that exponentially decrease with its length –Stop if enough links Heavily used in the 90s

1999 The Faloutsos brothers Measured the Internet AS and router graphs. Mine, she looks different! Notre Dame Looked at complex system graphs: social relationship, actors, neurons, WWW Suggested a dynamic generation model

The Faloutsos Graph 1995 Internet router topology 3888 nodes, 5012 edges, =2.57

SCIENCE CITATION INDEX (  = 3) Nodes: papers Links: citations (S. Redner, 1998) P(k) ~k -  PRL papers (1988) Witten-Sander PRL 1981

Sex-web Nodes: people (Females; Males) Links: sexual relationships Liljeros et al. Nature Swedes; 18-74; 59% response rate.

Web power-laws

SCALE-FREE NETWORKS (1) The number of nodes (N) is NOT fixed. Networks continuously expand by the addition of new nodes Examples: WWW : addition of new documents Citation : publication of new papers (2) The attachment is NOT uniform. A node is linked with higher probability to a node that already has a large number of links. Examples : WWW : new documents link to well known sites (CNN, YAHOO, NewYork Times, etc) Citation : well cited papers are more likely to be cited again

Scale-free model (1) GROWTH : A t every timestep we add a new node with m edges (connected to the nodes already present in the system). (2) PREFERENTIAL ATTACHMENT : The probability Π that a new node will be connected to node i depends on the connectivity k i of that node A.-L.Barabási, R. Albert, Science 286, 509 (1999) P(k) ~k -3

The Faloutsos Graph

The Internet Topology as a Jellyfish  Core: High-degree clique  Shell: adjacent nodes of previous shell, except 1- degree nodes  1-degree nodes: shown hanging  The denser the 1-degree node population the longer the stem Core Shells: 1 2 3