subnet based internet topology generation
play

Subnet Based Internet Topology Generation Mehmet Burak AKGN with - PowerPoint PPT Presentation

Subnet Based Internet Topology Generation Mehmet Burak AKGN with Mehmet Hadi GNE ISMA 2011 Workshop on Active Internet Measurements Outline Introduction Related Work Methodology Algortihm Results Future Work


  1. Subnet Based Internet Topology Generation Mehmet Burak AKGÜN with Mehmet Hadi GÜNEŞ ISMA 2011 Workshop on Active Internet Measurements

  2. Outline � Introduction � Related Work � Methodology � Algortihm � Results � Future Work �

  3. Introduction � Performance of network protocols are dependent on the underlying topology � network researchers use synthetic topologies in simulations � Researchers need realistic synthetic network topologies � which imitates the characteristics of the Internet �

  4. Literature Review � Before 1999 � Strong belief that “Internet is hierarchical” � 1999-2001 � Discovery of Internet’s degree distribution to be � Discovery of Internet’s degree distribution to be power law � 2001- � The degree distribution characteristics is not sufficient �

  5. GT-ITM [Zagura-96] � Two types of hierarchical graphs(n-level, TS) � Transit-stub reproduces the hierarchical structure of Internet 1. A connected random graph is generated 1. A connected random graph is generated 2. Each node is considered as a transit domain � each transit domain is expanded to form another connected random graph 3. A number of random graphs are generated as stubs and connected to transit nodes �

  6. BRITE [Medina01] � Power law distribution due to � preferential connectivity and incremental growth � Skewed node placement � area is divided into squares area is divided into squares � nodes are distributed among squares � Locality based preferential network connections � uses Waxman probabilistic function � Node degree distribution is preserved �

  7. HOT [Mahadevan06] � A systematic approach to analyze and synthesize dK -series graphs � Increasing k better models the Internet, whereas increases computational complexity whereas increases computational complexity � 1K graphs model degree distribution � is not sufficient � 2K graphs match joint degree distribution �

  8. Outline � Introduction � Related Work � Methodology � Algorithm � Results � Future Work �

  9. Motivation � Subnetworks are the bricks of the Internet � connected nodes form cliques � Ignoring subnets during generation misses important characteristics � topologies are composed of point to point links � misrepresent the Internet � We emphasizes the distinction between � the observed degree distribution and � the real degree distribution (i.e., interfaces) �

  10. Observed Degree vs. Alias � Ignoring subnets results in a network of point- to-point links only. C A A C C A B B ��

  11. Network Topology Generation � Objectives � Subnet Distribution � Observed Degree distribution � Alias Distribution ��

  12. Subnet Centric Approach � Number of nodes ( � ���� ) � Subnet distribution for this many nodes � Scale the values of the distribution with � ���� � � ��������� ���� ��������� � Large subnets may disappear in small networks � distribute their ratio to closest subnet levels � Create bins for each subnet � place nodes into bins considering occupancy rate ��

  13. Algorithm Insert nodes into Calculate Read Network subnets necessary # of Size considering subnets completeness Calculate current Calculate current Calculate desired Calculate desired Merge observed degree raw degree distribution distribution no Save Satisfy? yes Topology ��

  14. Subnet Distribution � Subnet distribution data is obtained from Cheleby project � For an 147K node network ( � ��������� ) � 385K IP addresses (interfaces) � 385K IP addresses (interfaces) /24 /25 /26 /27 /28 /29 /3X Number of 4 36 184 1294 8836 93110 58011 Occurrence Distribution (%) 0.002 0.022 0.11 0.80 5.47 57.66 35.92 Completeness (%) 26 30 28 27 27 39 100 ��

  15. Shifting Desired Degree Distribution Chart Title 8 des (Log scale) 7 6 5 Number of Nodes ( 4 4 3 2 1 0 � �� ��� Oberved Node Degree ��

  16. Shifting Desired Degree Distribution Chart Title 8 des (log scale) 7 6 5 Number of Nodes 4 4 3 2 1 0 � �� ��� Observed Node Degree ��

  17. Example Observed # of Nodes n=10, /29=2, /30=3, /31=4 Degree Assume occupancy rates to be 100% Distribution �� � � �� ��

  18. Example Raw Degree Distribution Continue until n=10 1 �� �� Consider power law distribution � � 7 14 14 1 ��

  19. Outline � Introduction � Related Work � Methodology � Algortihm � Results � Future Work ��

  20. Degree Distribution before Merging /24 /25 /26 /27 /28 /29 /3x Completeness 0 0.33 0.21 0.31 0.51 0.54 1 # of nodes per subnet 0 41 13 9 7 3 2 1000000 100000 100000 10000 1000 100 10 1 � �� ��� ���� ��

  21. Merging � By merging 3 nodes of /25 , /26 and /27 we can have a single node of degree: � Raw Degree = 41+13+9 = 63 ��� ��� A ��������������������������� ������������ ������ ������ ��� !���� ��� ��

  22. Degree Distribution during Merging �� "#$�����

  23. Degree Distribution during Merging ��

  24. Degree Distribution during Merging ��

  25. Degree Distribution during Merging ��

  26. Degree Distribution during Merging ��

  27. Degree Distribution during Merging ��

  28. Degree Distribution during Merging ��

  29. Subnet Distribution � Although many merge operations are done, subnet distribution is still satisfied. /24 /24 /25 /25 /26 /26 /27 /27 /28 /28 /29 /29 /3X /3X Number of Occurence 0 9 51 128 313 18062 79674 Distribution(%) 0 0.01 0.05 0.13 0.32 18.39 81.10 Completeness(%) 0 33 21 31 51 54 100 ��

  30. 1M node topology 10000000 initial desired 1000000 final 100000 10000 1000 100 10 1 1 10 100 ��

  31. Size Distribution of Subnets 1.01 0.81 ncy of Subnets /24 0.61 /25 Frequency o /26 /26 /27 /28 0.41 /29 /3x 0.21 0.01 1 10 100 Number of Nodes in the subnet �� "#$�����

  32. Results � Both subnet distribution and interface distribution can be matched � generates more realistic topologies � Our method requires measurement data � subnet distributions � interface distribution � exponent of observed degree distribution ��

  33. Work in Progress � Matching � Characteristic path length � rewring � Assortativity � subnet merging order � subnet merging order � Same approach will be applied to satisfy subnet and interface distributions � Node centric approach ��

  34. Thank you Questions ? ��

  35. Data Structure #��� %!�����$��&���$� � SubnetLL * Int Node id '�(��� !���� '�(��� !���� %!���� '�(������� Subnet id NodeLL * #����$��&���$� � ��

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend