SlideShare una empresa de Scribd logo
1 de 81
Internet Topology


17 October 2008
        CS5229, Semester 1, 2008/09
                                                  
   1
17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   2
Can we characterize the
      Internet’s Topology?


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   3
How to generate
        realistic Internet
    topology for simulations?

17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   4
Model Internet quot;
                    as a Graph


17 October 2008
      CS5229, Semester 1, 2008/09
                                                
   5
Router-Level,quot;
                    node = routerquot;
                   edge = 1-hop link

17 October 2008
       CS5229, Semester 1, 2008/09
                                                 
   6
AS-Level,quot;
               node = AS domainquot;
                edge = Peering

17 October 2008
    CS5229, Semester 1, 2008/09
                                              
   7
Generating Random
                  Graph


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   8
Randomly generate points on a plane




17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   9
Connects two nodes with fixed
                   probability p



                                                           ?
                                                       p




17 October 2008
         CS5229, Semester 1, 2008/09
                                                   
           10
Waxman’s Method


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   11
Randomly generate points on a plane




17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   12
Connects two points with 
                   probability P(u,v)



                                                           ?




                       L: maximum distance
                       d(u,v): distance between u and v
17 October 2008
            CS5229, Semester 1, 2008/09
                                                      
        13
Model locality but not
     the structure of Internet


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   14
Transit-Stub Method


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   15
Randomly generate a graph using 
            Waxman’s method




17 October 2008
      CS5229, Semester 1, 2008/09
                                                
   16
Each node is expanded to form a 
            random graph (transit domain)




17 October 2008
      CS5229, Semester 1, 2008/09
                                                
   17
Connect stub domains to the transit
            domain.




17 October 2008
      CS5229, Semester 1, 2008/09
                                                
   18
Looks good, but is it
        close to the real thing?


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   19
“On Power-Law
        Relationships of the
        Internet Topology”quot;
      The Faloutsos brothers,
           SIGCOMM ‘99
17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   20
Use four traces of
         Internet topology
     collected between 97-98

17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   21
AS-Level Topology
 Time
   Num of     Num of       Max       Average
         Nodes
      Edges
    outdegree
 outdegree
Nov 97
 3015
       5156
             590
       3.42
Apr 98
 3520
       6432
             745
       3.65
Dec 98
 4398
       8256
             979
       3.76

             Router-Level Topology

    1995
    3888
        5012
          2.57
                                                     22
Observations: the graphs
    can be decomposed into
     two components: trees
           and core.

17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   23
Connect stub domains to the transit
            domain.




17 October 2008
      CS5229, Semester 1, 2008/09
                                                
   24
40-50%!
     of the nodes are in trees

17 October 2008
    CS5229, Semester 1, 2008/09
                                              
   25
3!
     maximum depth of trees

17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   26
1!
           depth of >80% of the
                  trees

17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   27
Time
          Num of     Num of              Max       Average
                   Nodes
      Edges
           outdegree
 outdegree
Nov 97
 3015
                  5156
                  590
   3.42
 Apr 98
 3520
                 6432
                  745
   3.65
Dec 98
 4398
                  8256
                  979
   3.76

            Out-degree is highly
                 skewed!
17 October 2008
        CS5229, Semester 1, 2008/09
                                                  
                  28
Let quot;
    dv be the out-degree of a
    node, and quot;
    rv be the rank of a node
    (i.e., index in the order of
    decreasing outdegree)
17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   29
Plot dv versus rv on quot;
                  log-log scale


17 October 2008
    CS5229, Semester 1, 2008/09
                                              
   30
31
32
33
34
Rank Exponent




                 35
Lemma 1:




            36
Lemma 2:




            37
Let quot;
    fd be the number of
    nodes with out-degree dquot;


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   38
Plot fd versus d on quot;
                      log-log scale


17 October 2008
         CS5229, Semester 1, 2008/09
                                                   
   39
40
41
42
43
44
“few connects to many,quot;
           many connects to few”


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   45
46
Let quot;
    P(h) be the number of
    node pairs within h hops
    of each otherquot;
    (include self-pairs, count
    every pair twice)
17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   47
P(0) = N



17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   48
P(1) = N + 2E



17 October 2008
     CS5229, Semester 1, 2008/09
                                               
   49
P(δ) =              N2quot;

    where δ is the diameter of the graph




17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   50
Plot P(h) versus h on quot;
                log-log scale


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   51
52
53
54
55
56
Average Number of Nodes within h Hops




                                         57
Average Number of Nodes within h Hops 
(using average degree)




                                          58
59
60
It holds in 97-98.quot;
                   What about later?


17 October 2008
       CS5229, Semester 1, 2008/09
                                                 
   61
“Power-Laws and the AS-
      Level Internet Topology”quot;
    G. Siganos and the Faloutsos
     brothers, IEEE/ACM TON

17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   62
63
64
65
Do topologies generated by
     Waxman and Transit-Stub
        exhibit Power Law?


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   66
67
How to generate topology
        that follows power laws?


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   68
Where does power law
               comes from?


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   69
70
Scientific American, “Scale-Free Networks”, May 2003




                                                       71
72
73
Generating Power Law
             Topology (simplified)


17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   74
“On the Original of Power
    Laws in Internet Topologies”quot;
     A Medina, I Matta, J Byers,quot;
       ACM SIGCOMM, ‘00

17 October 2008
   CS5229, Semester 1, 2008/09
                                             
   75
76
Randomly generate a small graph




17 October 2008
      CS5229, Semester 1, 2008/09
                                                
   77
Incremental Growth: 
                    Add one node at a time




17 October 2008
         CS5229, Semester 1, 2008/09
                                                   
   78
Preferential Attachment:
  Connects to a neighbor i with a probability



                                                 ?




17 October 2008
   CS5229, Semester 1, 2008/09
                                             
        79
80
81

Más contenido relacionado

Más de Wei Tsang Ooi

SIGMM Education Effort Presentation at Business Meeting
SIGMM Education Effort Presentation at Business MeetingSIGMM Education Effort Presentation at Business Meeting
SIGMM Education Effort Presentation at Business MeetingWei Tsang Ooi
 
The Computer Science behind YouTube
The Computer Science behind YouTubeThe Computer Science behind YouTube
The Computer Science behind YouTubeWei Tsang Ooi
 
CS4344 09/10 Lecture 10: Transport Protocol for Networked Games
CS4344 09/10 Lecture 10: Transport Protocol for Networked GamesCS4344 09/10 Lecture 10: Transport Protocol for Networked Games
CS4344 09/10 Lecture 10: Transport Protocol for Networked GamesWei Tsang Ooi
 
CS4344 09/10 Lecture 9: Characteristics of Networked Game Traffic
CS4344 09/10 Lecture 9: Characteristics of Networked Game TrafficCS4344 09/10 Lecture 9: Characteristics of Networked Game Traffic
CS4344 09/10 Lecture 9: Characteristics of Networked Game TrafficWei Tsang Ooi
 
CS4344 09/10 Lecture 8: Hybrid Architecture
CS4344 09/10 Lecture 8: Hybrid ArchitectureCS4344 09/10 Lecture 8: Hybrid Architecture
CS4344 09/10 Lecture 8: Hybrid ArchitectureWei Tsang Ooi
 
CS4344 09/10 Lecture 7: P2P Interest Management
CS4344 09/10 Lecture 7: P2P Interest ManagementCS4344 09/10 Lecture 7: P2P Interest Management
CS4344 09/10 Lecture 7: P2P Interest ManagementWei Tsang Ooi
 
CS4344 09/10 Lecture 6: P2P Synchronization
CS4344 09/10 Lecture 6: P2P SynchronizationCS4344 09/10 Lecture 6: P2P Synchronization
CS4344 09/10 Lecture 6: P2P SynchronizationWei Tsang Ooi
 
Cs4344 09/10 Lecture 5: Interest Management
Cs4344 09/10 Lecture 5: Interest ManagementCs4344 09/10 Lecture 5: Interest Management
Cs4344 09/10 Lecture 5: Interest ManagementWei Tsang Ooi
 
CS4344 09/10 Lecture 3: Dead Reckoning and Local Perception Filter
CS4344 09/10 Lecture 3: Dead Reckoning and Local Perception FilterCS4344 09/10 Lecture 3: Dead Reckoning and Local Perception Filter
CS4344 09/10 Lecture 3: Dead Reckoning and Local Perception FilterWei Tsang Ooi
 
CS4344 09/10 Lecture 2: Consistency
CS4344 09/10 Lecture 2: ConsistencyCS4344 09/10 Lecture 2: Consistency
CS4344 09/10 Lecture 2: ConsistencyWei Tsang Ooi
 
CS4344 09/10 Lecture 1: Introduction
CS4344 09/10 Lecture 1: IntroductionCS4344 09/10 Lecture 1: Introduction
CS4344 09/10 Lecture 1: IntroductionWei Tsang Ooi
 
CS5229 09/10 Lecture 11: DNS
CS5229 09/10 Lecture 11: DNSCS5229 09/10 Lecture 11: DNS
CS5229 09/10 Lecture 11: DNSWei Tsang Ooi
 
CS5229 09/10 Lecture 10: Internet Routing
CS5229 09/10 Lecture 10: Internet RoutingCS5229 09/10 Lecture 10: Internet Routing
CS5229 09/10 Lecture 10: Internet RoutingWei Tsang Ooi
 
Lecture 4: TCP and TFRC
Lecture 4: TCP and TFRCLecture 4: TCP and TFRC
Lecture 4: TCP and TFRCWei Tsang Ooi
 
Lecture 2: Congestion Control and Avoidance
Lecture 2: Congestion Control and AvoidanceLecture 2: Congestion Control and Avoidance
Lecture 2: Congestion Control and AvoidanceWei Tsang Ooi
 
Lecture 0: Introduction to CS5229
Lecture 0: Introduction to CS5229Lecture 0: Introduction to CS5229
Lecture 0: Introduction to CS5229Wei Tsang Ooi
 
Lecture 1: Design Principles of the Internet
Lecture 1: Design Principles of the InternetLecture 1: Design Principles of the Internet
Lecture 1: Design Principles of the InternetWei Tsang Ooi
 
CS4344 Lecture 8: Hybrid Architecture
CS4344 Lecture 8: Hybrid ArchitectureCS4344 Lecture 8: Hybrid Architecture
CS4344 Lecture 8: Hybrid ArchitectureWei Tsang Ooi
 

Más de Wei Tsang Ooi (20)

SIGMM Education Effort Presentation at Business Meeting
SIGMM Education Effort Presentation at Business MeetingSIGMM Education Effort Presentation at Business Meeting
SIGMM Education Effort Presentation at Business Meeting
 
CS2106 Tutorial 2
CS2106 Tutorial 2CS2106 Tutorial 2
CS2106 Tutorial 2
 
The Computer Science behind YouTube
The Computer Science behind YouTubeThe Computer Science behind YouTube
The Computer Science behind YouTube
 
CS4344 09/10 Lecture 10: Transport Protocol for Networked Games
CS4344 09/10 Lecture 10: Transport Protocol for Networked GamesCS4344 09/10 Lecture 10: Transport Protocol for Networked Games
CS4344 09/10 Lecture 10: Transport Protocol for Networked Games
 
CS4344 09/10 Lecture 9: Characteristics of Networked Game Traffic
CS4344 09/10 Lecture 9: Characteristics of Networked Game TrafficCS4344 09/10 Lecture 9: Characteristics of Networked Game Traffic
CS4344 09/10 Lecture 9: Characteristics of Networked Game Traffic
 
CS4344 09/10 Lecture 8: Hybrid Architecture
CS4344 09/10 Lecture 8: Hybrid ArchitectureCS4344 09/10 Lecture 8: Hybrid Architecture
CS4344 09/10 Lecture 8: Hybrid Architecture
 
CS4344 09/10 Lecture 7: P2P Interest Management
CS4344 09/10 Lecture 7: P2P Interest ManagementCS4344 09/10 Lecture 7: P2P Interest Management
CS4344 09/10 Lecture 7: P2P Interest Management
 
CS4344 09/10 Lecture 6: P2P Synchronization
CS4344 09/10 Lecture 6: P2P SynchronizationCS4344 09/10 Lecture 6: P2P Synchronization
CS4344 09/10 Lecture 6: P2P Synchronization
 
Cs4344 09/10 Lecture 5: Interest Management
Cs4344 09/10 Lecture 5: Interest ManagementCs4344 09/10 Lecture 5: Interest Management
Cs4344 09/10 Lecture 5: Interest Management
 
CS4344 09/10 Lecture 3: Dead Reckoning and Local Perception Filter
CS4344 09/10 Lecture 3: Dead Reckoning and Local Perception FilterCS4344 09/10 Lecture 3: Dead Reckoning and Local Perception Filter
CS4344 09/10 Lecture 3: Dead Reckoning and Local Perception Filter
 
CS4344 09/10 Lecture 2: Consistency
CS4344 09/10 Lecture 2: ConsistencyCS4344 09/10 Lecture 2: Consistency
CS4344 09/10 Lecture 2: Consistency
 
CS4344 09/10 Lecture 1: Introduction
CS4344 09/10 Lecture 1: IntroductionCS4344 09/10 Lecture 1: Introduction
CS4344 09/10 Lecture 1: Introduction
 
CS5229 09/10 Lecture 11: DNS
CS5229 09/10 Lecture 11: DNSCS5229 09/10 Lecture 11: DNS
CS5229 09/10 Lecture 11: DNS
 
CS5229 09/10 Lecture 10: Internet Routing
CS5229 09/10 Lecture 10: Internet RoutingCS5229 09/10 Lecture 10: Internet Routing
CS5229 09/10 Lecture 10: Internet Routing
 
Lecture 5: RED
Lecture 5: REDLecture 5: RED
Lecture 5: RED
 
Lecture 4: TCP and TFRC
Lecture 4: TCP and TFRCLecture 4: TCP and TFRC
Lecture 4: TCP and TFRC
 
Lecture 2: Congestion Control and Avoidance
Lecture 2: Congestion Control and AvoidanceLecture 2: Congestion Control and Avoidance
Lecture 2: Congestion Control and Avoidance
 
Lecture 0: Introduction to CS5229
Lecture 0: Introduction to CS5229Lecture 0: Introduction to CS5229
Lecture 0: Introduction to CS5229
 
Lecture 1: Design Principles of the Internet
Lecture 1: Design Principles of the InternetLecture 1: Design Principles of the Internet
Lecture 1: Design Principles of the Internet
 
CS4344 Lecture 8: Hybrid Architecture
CS4344 Lecture 8: Hybrid ArchitectureCS4344 Lecture 8: Hybrid Architecture
CS4344 Lecture 8: Hybrid Architecture
 

Último

From Family Reminiscence to Scholarly Archive .
From Family Reminiscence to Scholarly Archive .From Family Reminiscence to Scholarly Archive .
From Family Reminiscence to Scholarly Archive .Alan Dix
 
Are Multi-Cloud and Serverless Good or Bad?
Are Multi-Cloud and Serverless Good or Bad?Are Multi-Cloud and Serverless Good or Bad?
Are Multi-Cloud and Serverless Good or Bad?Mattias Andersson
 
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)Mark Simos
 
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek SchlawackFwdays
 
How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.Curtis Poe
 
Advanced Computer Architecture – An Introduction
Advanced Computer Architecture – An IntroductionAdvanced Computer Architecture – An Introduction
Advanced Computer Architecture – An IntroductionDilum Bandara
 
WordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your BrandWordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your Brandgvaughan
 
Merck Moving Beyond Passwords: FIDO Paris Seminar.pptx
Merck Moving Beyond Passwords: FIDO Paris Seminar.pptxMerck Moving Beyond Passwords: FIDO Paris Seminar.pptx
Merck Moving Beyond Passwords: FIDO Paris Seminar.pptxLoriGlavin3
 
Nell’iperspazio con Rocket: il Framework Web di Rust!
Nell’iperspazio con Rocket: il Framework Web di Rust!Nell’iperspazio con Rocket: il Framework Web di Rust!
Nell’iperspazio con Rocket: il Framework Web di Rust!Commit University
 
Digital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptxDigital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptxLoriGlavin3
 
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptxPasskey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptxLoriGlavin3
 
DevoxxFR 2024 Reproducible Builds with Apache Maven
DevoxxFR 2024 Reproducible Builds with Apache MavenDevoxxFR 2024 Reproducible Builds with Apache Maven
DevoxxFR 2024 Reproducible Builds with Apache MavenHervé Boutemy
 
"ML in Production",Oleksandr Bagan
"ML in Production",Oleksandr Bagan"ML in Production",Oleksandr Bagan
"ML in Production",Oleksandr BaganFwdays
 
Unleash Your Potential - Namagunga Girls Coding Club
Unleash Your Potential - Namagunga Girls Coding ClubUnleash Your Potential - Namagunga Girls Coding Club
Unleash Your Potential - Namagunga Girls Coding ClubKalema Edgar
 
Dev Dives: Streamline document processing with UiPath Studio Web
Dev Dives: Streamline document processing with UiPath Studio WebDev Dives: Streamline document processing with UiPath Studio Web
Dev Dives: Streamline document processing with UiPath Studio WebUiPathCommunity
 
TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024Lonnie McRorey
 
A Deep Dive on Passkeys: FIDO Paris Seminar.pptx
A Deep Dive on Passkeys: FIDO Paris Seminar.pptxA Deep Dive on Passkeys: FIDO Paris Seminar.pptx
A Deep Dive on Passkeys: FIDO Paris Seminar.pptxLoriGlavin3
 
SIP trunking in Janus @ Kamailio World 2024
SIP trunking in Janus @ Kamailio World 2024SIP trunking in Janus @ Kamailio World 2024
SIP trunking in Janus @ Kamailio World 2024Lorenzo Miniero
 
The Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptx
The Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptxThe Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptx
The Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptxLoriGlavin3
 
How to write a Business Continuity Plan
How to write a Business Continuity PlanHow to write a Business Continuity Plan
How to write a Business Continuity PlanDatabarracks
 

Último (20)

From Family Reminiscence to Scholarly Archive .
From Family Reminiscence to Scholarly Archive .From Family Reminiscence to Scholarly Archive .
From Family Reminiscence to Scholarly Archive .
 
Are Multi-Cloud and Serverless Good or Bad?
Are Multi-Cloud and Serverless Good or Bad?Are Multi-Cloud and Serverless Good or Bad?
Are Multi-Cloud and Serverless Good or Bad?
 
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
 
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
 
How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.
 
Advanced Computer Architecture – An Introduction
Advanced Computer Architecture – An IntroductionAdvanced Computer Architecture – An Introduction
Advanced Computer Architecture – An Introduction
 
WordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your BrandWordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your Brand
 
Merck Moving Beyond Passwords: FIDO Paris Seminar.pptx
Merck Moving Beyond Passwords: FIDO Paris Seminar.pptxMerck Moving Beyond Passwords: FIDO Paris Seminar.pptx
Merck Moving Beyond Passwords: FIDO Paris Seminar.pptx
 
Nell’iperspazio con Rocket: il Framework Web di Rust!
Nell’iperspazio con Rocket: il Framework Web di Rust!Nell’iperspazio con Rocket: il Framework Web di Rust!
Nell’iperspazio con Rocket: il Framework Web di Rust!
 
Digital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptxDigital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptx
 
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptxPasskey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptx
 
DevoxxFR 2024 Reproducible Builds with Apache Maven
DevoxxFR 2024 Reproducible Builds with Apache MavenDevoxxFR 2024 Reproducible Builds with Apache Maven
DevoxxFR 2024 Reproducible Builds with Apache Maven
 
"ML in Production",Oleksandr Bagan
"ML in Production",Oleksandr Bagan"ML in Production",Oleksandr Bagan
"ML in Production",Oleksandr Bagan
 
Unleash Your Potential - Namagunga Girls Coding Club
Unleash Your Potential - Namagunga Girls Coding ClubUnleash Your Potential - Namagunga Girls Coding Club
Unleash Your Potential - Namagunga Girls Coding Club
 
Dev Dives: Streamline document processing with UiPath Studio Web
Dev Dives: Streamline document processing with UiPath Studio WebDev Dives: Streamline document processing with UiPath Studio Web
Dev Dives: Streamline document processing with UiPath Studio Web
 
TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024
 
A Deep Dive on Passkeys: FIDO Paris Seminar.pptx
A Deep Dive on Passkeys: FIDO Paris Seminar.pptxA Deep Dive on Passkeys: FIDO Paris Seminar.pptx
A Deep Dive on Passkeys: FIDO Paris Seminar.pptx
 
SIP trunking in Janus @ Kamailio World 2024
SIP trunking in Janus @ Kamailio World 2024SIP trunking in Janus @ Kamailio World 2024
SIP trunking in Janus @ Kamailio World 2024
 
The Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptx
The Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptxThe Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptx
The Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptx
 
How to write a Business Continuity Plan
How to write a Business Continuity PlanHow to write a Business Continuity Plan
How to write a Business Continuity Plan
 

CS5229 Lecture 9: Internet Topology

  • 1. Internet Topology 17 October 2008 CS5229, Semester 1, 2008/09 1
  • 2. 17 October 2008 CS5229, Semester 1, 2008/09 2
  • 3. Can we characterize the Internet’s Topology? 17 October 2008 CS5229, Semester 1, 2008/09 3
  • 4. How to generate realistic Internet topology for simulations? 17 October 2008 CS5229, Semester 1, 2008/09 4
  • 5. Model Internet quot; as a Graph 17 October 2008 CS5229, Semester 1, 2008/09 5
  • 6. Router-Level,quot; node = routerquot; edge = 1-hop link 17 October 2008 CS5229, Semester 1, 2008/09 6
  • 7. AS-Level,quot; node = AS domainquot; edge = Peering 17 October 2008 CS5229, Semester 1, 2008/09 7
  • 8. Generating Random Graph 17 October 2008 CS5229, Semester 1, 2008/09 8
  • 9. Randomly generate points on a plane 17 October 2008 CS5229, Semester 1, 2008/09 9
  • 10. Connects two nodes with fixed probability p ? p 17 October 2008 CS5229, Semester 1, 2008/09 10
  • 11. Waxman’s Method 17 October 2008 CS5229, Semester 1, 2008/09 11
  • 12. Randomly generate points on a plane 17 October 2008 CS5229, Semester 1, 2008/09 12
  • 13. Connects two points with probability P(u,v) ? L: maximum distance d(u,v): distance between u and v 17 October 2008 CS5229, Semester 1, 2008/09 13
  • 14. Model locality but not the structure of Internet 17 October 2008 CS5229, Semester 1, 2008/09 14
  • 15. Transit-Stub Method 17 October 2008 CS5229, Semester 1, 2008/09 15
  • 16. Randomly generate a graph using Waxman’s method 17 October 2008 CS5229, Semester 1, 2008/09 16
  • 17. Each node is expanded to form a random graph (transit domain) 17 October 2008 CS5229, Semester 1, 2008/09 17
  • 18. Connect stub domains to the transit domain. 17 October 2008 CS5229, Semester 1, 2008/09 18
  • 19. Looks good, but is it close to the real thing? 17 October 2008 CS5229, Semester 1, 2008/09 19
  • 20. “On Power-Law Relationships of the Internet Topology”quot; The Faloutsos brothers, SIGCOMM ‘99 17 October 2008 CS5229, Semester 1, 2008/09 20
  • 21. Use four traces of Internet topology collected between 97-98 17 October 2008 CS5229, Semester 1, 2008/09 21
  • 22. AS-Level Topology Time Num of Num of Max Average Nodes Edges outdegree outdegree Nov 97 3015 5156 590 3.42 Apr 98 3520 6432 745 3.65 Dec 98 4398 8256 979 3.76 Router-Level Topology 1995 3888 5012 2.57 22
  • 23. Observations: the graphs can be decomposed into two components: trees and core. 17 October 2008 CS5229, Semester 1, 2008/09 23
  • 24. Connect stub domains to the transit domain. 17 October 2008 CS5229, Semester 1, 2008/09 24
  • 25. 40-50%! of the nodes are in trees 17 October 2008 CS5229, Semester 1, 2008/09 25
  • 26. 3! maximum depth of trees 17 October 2008 CS5229, Semester 1, 2008/09 26
  • 27. 1! depth of >80% of the trees 17 October 2008 CS5229, Semester 1, 2008/09 27
  • 28. Time Num of Num of Max Average Nodes Edges outdegree outdegree Nov 97 3015 5156 590 3.42 Apr 98 3520 6432 745 3.65 Dec 98 4398 8256 979 3.76 Out-degree is highly skewed! 17 October 2008 CS5229, Semester 1, 2008/09 28
  • 29. Let quot; dv be the out-degree of a node, and quot; rv be the rank of a node (i.e., index in the order of decreasing outdegree) 17 October 2008 CS5229, Semester 1, 2008/09 29
  • 30. Plot dv versus rv on quot; log-log scale 17 October 2008 CS5229, Semester 1, 2008/09 30
  • 31. 31
  • 32. 32
  • 33. 33
  • 34. 34
  • 36. Lemma 1: 36
  • 37. Lemma 2: 37
  • 38. Let quot; fd be the number of nodes with out-degree dquot; 17 October 2008 CS5229, Semester 1, 2008/09 38
  • 39. Plot fd versus d on quot; log-log scale 17 October 2008 CS5229, Semester 1, 2008/09 39
  • 40. 40
  • 41. 41
  • 42. 42
  • 43. 43
  • 44. 44
  • 45. “few connects to many,quot; many connects to few” 17 October 2008 CS5229, Semester 1, 2008/09 45
  • 46. 46
  • 47. Let quot; P(h) be the number of node pairs within h hops of each otherquot; (include self-pairs, count every pair twice) 17 October 2008 CS5229, Semester 1, 2008/09 47
  • 48. P(0) = N 17 October 2008 CS5229, Semester 1, 2008/09 48
  • 49. P(1) = N + 2E 17 October 2008 CS5229, Semester 1, 2008/09 49
  • 50. P(δ) = N2quot; where δ is the diameter of the graph 17 October 2008 CS5229, Semester 1, 2008/09 50
  • 51. Plot P(h) versus h on quot; log-log scale 17 October 2008 CS5229, Semester 1, 2008/09 51
  • 52. 52
  • 53. 53
  • 54. 54
  • 55. 55
  • 56. 56
  • 57. Average Number of Nodes within h Hops 57
  • 58. Average Number of Nodes within h Hops (using average degree) 58
  • 59. 59
  • 60. 60
  • 61. It holds in 97-98.quot; What about later? 17 October 2008 CS5229, Semester 1, 2008/09 61
  • 62. “Power-Laws and the AS- Level Internet Topology”quot; G. Siganos and the Faloutsos brothers, IEEE/ACM TON 17 October 2008 CS5229, Semester 1, 2008/09 62
  • 63. 63
  • 64. 64
  • 65. 65
  • 66. Do topologies generated by Waxman and Transit-Stub exhibit Power Law? 17 October 2008 CS5229, Semester 1, 2008/09 66
  • 67. 67
  • 68. How to generate topology that follows power laws? 17 October 2008 CS5229, Semester 1, 2008/09 68
  • 69. Where does power law comes from? 17 October 2008 CS5229, Semester 1, 2008/09 69
  • 70. 70
  • 71. Scientific American, “Scale-Free Networks”, May 2003 71
  • 72. 72
  • 73. 73
  • 74. Generating Power Law Topology (simplified) 17 October 2008 CS5229, Semester 1, 2008/09 74
  • 75. “On the Original of Power Laws in Internet Topologies”quot; A Medina, I Matta, J Byers,quot; ACM SIGCOMM, ‘00 17 October 2008 CS5229, Semester 1, 2008/09 75
  • 76. 76
  • 77. Randomly generate a small graph 17 October 2008 CS5229, Semester 1, 2008/09 77
  • 78. Incremental Growth: Add one node at a time 17 October 2008 CS5229, Semester 1, 2008/09 78
  • 79. Preferential Attachment: Connects to a neighbor i with a probability ? 17 October 2008 CS5229, Semester 1, 2008/09 79
  • 80. 80
  • 81. 81