Importance of IP Alias Resolution in Sampling Internet Topologies
|
|
|
- Valerie Jennings
- 6 years ago
- Views:
Transcription
1 Importance of IP Alias Resolution in Sampling Internet Topologies Mehmet H. Gunes and Kamil Sarac Global Internet Symposium 007, Anchorage, AK
2 Introduction: Internet Mapping Topology measurement studies require representative Internet maps. AS-level, POP-level, Router-level, etc. Such maps are not publicly available ISPs consider their network topology information as confidential. Topology sampling (at router-level) Probe the Internet (using traceroute) to collect path traces. Map construction Verify the accuracy of the collected path traces, Resolve anonymous routers, Resolve IP aliases.
3 Overview What: Impact of alias resolution on traceroute-based sample network topologies. Why: Whether the alias resolution distorts the results significantly. How: Use synthetic and genuine topologies to analyze topological changes of resulting graphs with varying alias resolution success. 3
4 Alias Resolution: Problem w z b d a 4 3 c e x y A set of collected traces w,,b, a, c,, x z,,d, a, e,, y x,,c, a3, b,, w y,,e, a4, d,, z a sub-graph The sample map from the collected path traces b c d e w a a3 x z a a4 y b c d e Alias Resolution is the process of identifying the IP addresses of a router. 4
5 Alias Resolution: Problem w b c x z z d a 4 3 a sub-graph e y w b b d a d c c x A set of collected traces w,,b, a, c,, x z,,d, a, e,, y x,,c, a3, b,, w y,,e, a4, d,, z e y e partial alias resolution (only router a is resolved) 5
6 Alias Resolution: Problem w b c x z d a 4 3 a sub-graph e y w b a a c x A set of collected traces w,,b, a, c,, x z,,d, a, e,, y x,,c, a3, b,, w y,,e, a4, d,, z z d a3 a4 partial alias resolution (only router a is not resolved) e y 6
7 Alias Resolution: Experimental Procedure First, generate a synthetic network topology, Next, annotate it to add interface addresses, Then, emulate traceroute to collect path traces, s. s s. r. r r. r.3 t. Finally, build sample topologies with different alias resolution success rate t t. Consider an example A path from s to t: s. r. t. A path from t to s: t. r.3 s. Case : resolve r s Case : do not resolve r s s. s. r r. r.3 r. r.3 t. t. t t
8 Alias Resolution: Experimental Procedure Apply alias resolution with different success rate 0%, 0%, 40%, 60%, 80%, and 00% success rates. Generate various synthetic graphs to represent the Internet Random Power-law Hierarchical : Waxman (WA), : Barabasi-Albert (BA) and Inet, : Transit-Stub (TS) Analyze changes in topological characteristics Topology Size, Node Degree, Degree Distribution, Joint Degree Distribution, Analyze a genuine Internet sample Utilize state-of-the art alias resolution tools. Characteristic Path Length, Hop Distribution, Betweenness, Clustering. 8
9 Effects on Topological Characteristics : Topology Size Number of nodes and edges reduces by 57% and 6%, on average, as alias resolution improves from 0% to 00%. The impact of imperfect alias resolution increases as the size of the sample topology increases. (n,n) samples are affected more by imperfect alias resolution. 9
10 Effects on Topological Characteristics : Node Degree Observed degree: degrees with imperfect alias resolution True degree: degrees with perfect alias resolution. Frequency distribution: number of nodes at each node degree WA 0% success WA 40% success WA 80% success Degree of these nodes are overestimated due to non-resolved neighbors. Frequency distribution Degree of these nodes are underestimated since their aliases are not resolved. 0
11 Effects on Topological Characteristics : Node Degree Observed degree: degrees with imperfect alias resolution True degree: degrees with perfect alias resolution. Frequency distribution: number of nodes at each node degree WA 0% success WA 40% success WA 80% success Alias resolution problems at a node may introduce a significantly large number of artificial nodes With improving alias resolution, some of the underestimation cases change to overestimation Frequency distribution
12 Effects on Topological Characteristics : Degree Distribution The probability P(k) that a randomly chosen node has degree k. Degree-related characteristics do not always improve with an increasing success rate Imperfect alias resolution, especially, distorts the power-law characteristic of BA- and Inet-based samples, impacts especially low degree ranges (3-3) of TS-based samples, impacts especially high degree ranges (0-up) of WA-based samples.
13 Effects on Topological Characteristics : Joint Degree Distribution The probability P(k, k) that a node of degree k and a node of degree k are connected. seem to be assortative with 0% alias resolution, but is non-assortative Assortativity coefficient: The tendency of a network to connect nodes of the same or different degrees. Positive values indicate assortativity most of the links are between similar degree nodes. Negative values indicate disassortativity most of the links are between dissimilar degree nodes. 0 indicates non-assortativity. 3
14 Effects on Topological Characteristics : Characteristic Path Length & Hop Distribution Characteristic Path Length The average of the shortest path lengths between all node pairs. Reduces with the increasing alias resolution success rate. On average 30% for BA, Inet and WA-based sample topologies. Hop Distribution The average percentage of the nodes reached at each hop As alias resolution improves, less number of hops are required to reach others. 4%, 60%, 78%, and 83% of the nodes are reachable within 7 hops with 0%, 40%, 80% and 00% alias resolution, respectively 4
15 Effects on Topological Characteristics : Betweenness & Clustering Betweenness The total number of shortest paths that pass through a node. As the alias resolution success rate increases The average betweenness reduces The normalized betweenness increases Clustering Characterizes the density of the connections in the neighborhood of a node. All samples yield a clustering coefficient of 0 with 0% alias resolution success rate It almost always increases with the improving alias resolution. 5
16 Effects on Topological Characteristics : Impact on Genuine Topologies We analyze the effect of alias resolution in building a topology map from a set of collected path traces. Ally is the current state-of-the-art probe based approach. APAR is a recent analytical approach. We study the changes in observed topological characteristics of the networks with respect to the initial topology where none of the tools is used. Initial Ally APAR Ally & APAR Number of Nodes Number of Edges Average Degree Assortativity Coefficient Characteristic Path Length Normalized Betweenness Clustering Coefficient
17 Effects on Topological Characteristics : Impact on Genuine Topologies We analyze the effect of alias resolution in building a topology map from a set of collected path traces. Ally is the current state-of-the-art probe based approach. APAR is a recent analytical approach. We study the changes in observed topological characteristics of Degree related characteristics Path length related the networks are mostly similar with respect to that of to the initial topology characteristics where none are closer of the tools is used. BA samples to that of TS samples. Initial Ally APAR Ally & APAR Number of Nodes Number of Edges Average Degree Assortativity Coefficient Characteristic Path Length Normalized Betweenness Clustering Coefficient
18 Conclusion We analyzed the impact of alias resolution on traceroute-based sample network topologies. We observed that the accuracy of the alias resolution process may significantly distort, almost all, topological characteristics that we consider in this study. Internet measurement studies should employ all the means possible to increase the accuracy/ completeness of the alias resolution process. The combination of ally and APAR achieves better results. 8
Cheleby: Subnet Level Internet Topology
Cheleby: Subnet Level Internet Topology Mehmet Hadi Gunes with Hakan Kardes and Mehmet B. Akgun Department of Computer Science and Engineering University of Nevada, Reno Subnet Resolution A B C D genuine
Impact of Multi-Access Links on the Internet Topology Modeling
Impact of Multi-Access Links on the Internet Topology Modeling Mehmet Burak Akgun, Mehmet Hadi Gunes Department of Computer Science and Engineering University of Nevada, Reno Email: {makgun, mgunes}@cse.unr.edu
AS Router Connectedness Based on Multiple Vantage Points and the Resulting Topologies
AS Router Connectedness Based on Multiple Vantage Points and the Resulting Topologies Steven Fisher University of Nevada, Reno CS 765 Steven Fisher (UNR) CS 765 CS 765 1 / 62 Table of Contents 1 Introduction
AS Connectedness Based on Multiple Vantage Points and the Resulting Topologies
AS Connectedness Based on Multiple Vantage Points and the Resulting Topologies Steven Fisher University of Nevada, Reno CS 765 Steven Fisher (UNR) CS 765 CS 765 1 / 28 Table of Contents 1 Introduction
Internet Topology Research
Internet Topology Research Matthew Luckie WAND Network Research Group Department of Computer Science University of Waikato Internet Topology Why should we care? Impacts on the design and operation of routing
Basics of Network Analysis
Basics of Network Analysis Hiroki Sayama sayama@binghamton.edu Graph = Network G(V, E): graph (network) V: vertices (nodes), E: edges (links) 1 Nodes = 1, 2, 3, 4, 5 2 3 Links = 12, 13, 15, 23,
arxiv: v1 [cs.ni] 13 Jul 2008
![arxiv: v1 [cs.ni] 13 Jul 2008](/thumbs/96/128712227.jpg "arxiv: v1 [cs.ni] 13 Jul 2008")
Beyond Node Degree: Evaluating AS Topology Models Hamed Haddadi University College London Damien Fay University of Cambridge Almerima Jamakovic Delft University of Technology arxiv:87.223v [cs.ni] 3 Jul
On the Origin of Power Laws in Internet Topologies Λ Alberto Medina Ibrahim Matta John Byers amedina@cs.bu.edu matta@cs.bu.edu byers@cs.bu.edu Computer Science Department Boston University Boston, MA 02215
Properties of Biological Networks
Properties of Biological Networks presented by: Ola Hamud June 12, 2013 Supervisor: Prof. Ron Pinter Based on: NETWORK BIOLOGY: UNDERSTANDING THE CELL S FUNCTIONAL ORGANIZATION By Albert-László Barabási
Wednesday, March 8, Complex Networks. Presenter: Jirakhom Ruttanavakul. CS 790R, University of Nevada, Reno
Wednesday, March 8, 2006 Complex Networks Presenter: Jirakhom Ruttanavakul CS 790R, University of Nevada, Reno Presented Papers Emergence of scaling in random networks, Barabási & Bonabeau (2003) Scale-free
Universal Properties of Mythological Networks Midterm report: Math 485
Universal Properties of Mythological Networks Midterm report: Math 485 Roopa Krishnaswamy, Jamie Fitzgerald, Manuel Villegas, Riqu Huang, and Riley Neal Department of Mathematics, University of Arizona,
Internet Measurements. Motivation
Internet Measurements Arvind Krishnamurthy Fall 2004 Motivation Types of measurements Understand the topology of the Internet Measure performance characteristics Tools: BGP Tables Traceroute measurements
Cheleby: Subnet-level Internet Mapper
Cheleby: Subnet-level Internet Mapper ISM 2010 IMS-2 Workshop on ctive Internet Measurements Talha Oz, Hakan Kardes, Mehmet Gunes University of Nevada, Reno 02/09/10 San Diego Supercomputer Center, UCSD,
RealNet: A Topology Generator Based on Real Internet Topology
RealNet: A Topology Generator Based on Real Internet Topology Lechang Cheng Norm C. Hutchinson Mabo R. Ito University of British Columbia (lechangc@ece, norm@cs, mito@ece).ubc.ca Abstract One of the challenges
T he Electronic Magazine of O riginal Peer-Reviewed Survey Articles ABSTRACT
2ND QUARTER 2008, VOLUME 10, NO. 2 IEEE C OMMUNICATIONS SURVEYS T he Electronic Magazine of O riginal Peer-Reviewed Survey Articles www.comsoc.org/pubs/surveys NETWORK TOPOLOGIES: INFERENCE, MODELING,
On the Origin of Power Laws in Internet Topologies Λ
On the Origin of Power Laws in Internet Topologies Λ Alberto Medina Ibrahim Matta John Byers Computer Science Department Boston University Boston, MA 5 famedina, matta, byersg@cs.bu.edu ABSTRACT Recent
Topology Enhancement in Wireless Multihop Networks: A Top-down Approach
Topology Enhancement in Wireless Multihop Networks: A Top-down Approach Symeon Papavassiliou (joint work with Eleni Stai and Vasileios Karyotis) National Technical University of Athens (NTUA) School of
Introduction to network metrics
Universitat Politècnica de Catalunya Version 0.5 Complex and Social Networks (2018-2019) Master in Innovation and Research in Informatics (MIRI) Instructors Argimiro Arratia, argimiro@cs.upc.edu, http://www.cs.upc.edu/~argimiro/
On Reshaping of Clustering Coefficients in Degreebased Topology Generators
On Reshaping of Clustering Coefficients in Degreebased Topology Generators Xiafeng Li, Derek Leonard, and Dmitri Loguinov Texas A&M University Presented by Derek Leonard Agenda Motivation Statement of
Summary: What We Have Learned So Far
Summary: What We Have Learned So Far small-world phenomenon Real-world networks: { Short path lengths High clustering Broad degree distributions, often power laws P (k) k γ Erdös-Renyi model: Short path
Plan of the lecture I. INTRODUCTION II. DYNAMICAL PROCESSES. I. Networks: definitions, statistical characterization, examples II. Modeling frameworks
Plan of the lecture I. INTRODUCTION I. Networks: definitions, statistical characterization, examples II. Modeling frameworks II. DYNAMICAL PROCESSES I. Resilience, vulnerability II. Random walks III. Epidemic
Studienarbeit Survey on generators for Internet topologies at the AS Level
Studienarbeit Survey on generators for Internet topologies at the AS Level am Institut fuer Theoretische Informatik Lehrstuhl Prof. Dr. D. Wagner Universitaet Karlsruhe (TH) Author: Lin Huang Betreuer:
Measured Impact of Tracing Straight. Matthew Luckie, David Murrell WAND Network Research Group Department of Computer Science University of Waikato
Measured Impact of Tracing Straight Matthew Luckie, David Murrell WAND Network Research Group Department of Computer Science University of Waikato 7 February 2010 The Problem Until recently, load balancing
Constructing a G(N, p) Network
Random Graph Theory Dr. Natarajan Meghanathan Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Introduction At first inspection, most
Lesson 4. Random graphs. Sergio Barbarossa. UPC - Barcelona - July 2008
Lesson 4 Random graphs Sergio Barbarossa Graph models 1. Uncorrelated random graph (Erdős, Rényi) N nodes are connected through n edges which are chosen randomly from the possible configurations 2. Binomial
COM-208: Computer Networks - Homework 6
COM-208: Computer Networks - Homework 6. (P22) Suppose you are interested in detecting the number of hosts behind a NAT. You observe that the IP layer stamps an identification number sequentially on each
SNA 8: network resilience. Lada Adamic
SNA 8: network resilience Lada Adamic Outline Node vs. edge percolation Resilience of randomly vs. preferentially grown networks Resilience in real-world networks network resilience Q: If a given fraction
Large-scale topological and dynamical properties of the Internet
PHYSICAL REVIEW E, VOLUME 65, 066130 Large-scale topological and dynamical properties of the Internet Alexei Vázquez, 1 Romualdo Pastor-Satorras, 2 and Alessandro Vespignani 3 1 International School for
Clustering. RNA-seq: What is it good for? Finding Similarly Expressed Genes. Data... And Lots of It!
RNA-seq: What is it good for? Clustering High-throughput RNA sequencing experiments (RNA-seq) offer the ability to measure simultaneously the expression level of thousands of genes in a single experiment!
Network Theory: Social, Mythological and Fictional Networks. Math 485, Spring 2018 (Midterm Report) Christina West, Taylor Martins, Yihe Hao
Network Theory: Social, Mythological and Fictional Networks Math 485, Spring 2018 (Midterm Report) Christina West, Taylor Martins, Yihe Hao Abstract: Comparative mythology is a largely qualitative and
Internet-Scale IP Alias Resolution Techniques
Internet-Scale IP Alias Resolution Techniques Ken Keys Cooperative Association for Internet Data Analysis (CAIDA) University of California, San Diego kkeys@caida.org This article is an editorial note submitted
The missing links in the BGP-based AS connectivity maps
The missing links in the BGP-based AS connectivity maps Zhou, S; Mondragon, RJ http://arxiv.org/abs/cs/0303028 For additional information about this publication click this link. http://qmro.qmul.ac.uk/xmlui/handle/123456789/13070
Validity of router responses for IP aliases resolution
Validity of router responses for IP aliases resolution Santiago Garcia-Jimenez, Eduardo Magaña, Mikel Izal and Daniel Morató Public University of Navarre, Campus Arrosadia, 31006 Pamplona, Spain santiago.garcia@unavarra.es
BGP Scaling (RR & Peer Group)
BGP Scaling ( & Peer Group) BGP Peer Group Problem: number of BGP updates in a ibgp mesh BGP updates generated for each neighbor individually CPU wasted on repeat calculations ibgp neighbors receive the
Structural Evolution of the Internet Topology
Structural Evolution of the Internet Topology Hamed Haddadi Hamed.haddadi@cl.cam.ac.uk 9th November 2010 Mphil ACS Network Architecture Internet Topology Inference Characterisation Generation Evolution
The Shape of the Internet. Slides assembled by Jeff Chase Duke University (thanks to Vishal Misra and C. Faloutsos)
The Shape of the Internet Slides assembled by Jeff Chase Duke University (thanks to Vishal Misra and C. Faloutsos) The Shape of the Network Characterizing shape : AS-level topology: who connects to whom
Constructing a G(N, p) Network
Random Graph Theory Dr. Natarajan Meghanathan Associate Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Introduction At first inspection,
Characterizing and Modelling Clustering Features in AS-Level Internet Topology
Characterizing and Modelling Clustering Features in AS-Level Topology Yan Li, Jun-Hong Cui, Dario Maggiorini and Michalis Faloutsos UCONN CSE Technical Report: UbiNet-TR07-02 Last Update: July 2007 Abstract
Introduction Problems and Improvements RR DLP DisCarte Results. DisCarte. A Disjunctive Internet Cartographer. Sebastian Schlunke
DisCarte A Disjunctive Internet Cartographer Sebastian Schlunke Seminar Internet Measurement Technische Universität Berlin February 23, 2009 Based on: DisCarte: A Disjunctive Internet Cartographer by R.
WITH the deployment of native multicast in commercial
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 12, NO. 5, OCTOBER 2004 795 Tracetree: A Scalable Mechanism to Discover Multicast Tree Topologies in the Internet Kamil Sarac, Member, IEEE, and Kevin C. Almeroth,
Low-cost Enhancement of the Intra-domain Internet Robustness Against Intelligent Node Attacks
Low-cost Enhancement of the Intra-domain Internet Robustness Against Intelligent Node Attacks Panagiotis Pantazopoulos Ioannis Stavrakakis Department of Informatics and Telecommunications, Advanced Networking
PoP Level Mapping And Peering Deals
PoP Level Mapping And Peering Deals Mapping Internet Methodology Data Collection IP Classification to PoP PoP Geolocation PoP locations on Peering estimations Outline Internet Service Providers ISPs are
OverSim. A Flexible Overlay Network Simulation Framework. Ingmar Baumgart, Bernhard Heep, Stephan Krause
OverSim A Flexible Overlay Network Simulation Framework Ingmar Baumgart, Bernhard Heep, IEEE Global Internet Symposium 2007, Anchorage, AK, USA Requirements Overlay Flexibility Scalability Underlay Heterogeneity
Incentive-Compatible Caching and Inter-Domain Traffic Engineering in CCN
Incentive-Compatible Caching and Inter-Domain Traffic Engineering in CCN Xun Shao, Hitoshi Asaeda 2016-05-19 Na9onal Ins9tute of Informa9on and Communica9ons Technology (NICT) 1 Outline Caching and inter-domain
Sampling large Internet topologies for simulation purposes
Computer Networks 51 (2007) 4284 4302 www.elsevier.com/locate/comnet Sampling large topologies for simulation purposes Vaishnavi Krishnamurthy a, Michalis Faloutsos a, *, Marek Chrobak a, Jun-Hong Cui
Studying Black Holes on the Internet with Hubble
Studying Black Holes on the Internet with Hubble Ethan Katz-Bassett, Harsha V. Madhyastha, John P. John, Arvind Krishnamurthy, David Wetherall, Thomas Anderson University of Washington RIPE, May 2008 This
Location Matters: Eliciting Responses to Direct Probes
Location Matters: Eliciting Responses to Direct Probes Ethan Blanton, Mehmet Engin Tozal, Kamil Sarac, Sonia Fahmy Purdue University, Univ. of Louisiana at Lafayette, Univ. of Texas at Dallas E-mail: elb@psg.com,
Analysis and Comparison of Internet Topology Generators
Analysis and Comparison of Internet Topology Generators Damien Magoni and Jean-Jacques Pansiot Université Louis Pasteur LSIIT Pôle API, Boulevard Sébastien Brant, 67400 Illkirch, France {magoni, pansiot}@dpt-info.u-strasbg.fr
SELF-HEALING NETWORKS: REDUNDANCY AND STRUCTURE
SELF-HEALING NETWORKS: REDUNDANCY AND STRUCTURE Guido Caldarelli IMT, CNR-ISC and LIMS, London UK DTRA Grant HDTRA1-11-1-0048 INTRODUCTION The robustness and the shape Baran, P. On distributed Communications
On the Topology of Multicast Trees
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 1, FEBRUARY 2003 153 On the Topology of Multicast Trees Robert C. Chalmers, Student Member, IEEE, and Kevin C. Almeroth, Member, IEEE Abstract The benefit
A Framework for Realistic and Systematic Multicast Performance Evaluation
University of Connecticut DigitalCommons@UConn Articles Department of Computer Science & Engineering August 2006 A Framework for Realistic and Systematic Multicast Performance Evaluation Li Lao Computer
Toward Topology Dualism: Improving the Accuracy of AS Annotations for Routers
Toward Topology Dualism: Improving the ccuracy of S nnotations for Routers radley Huffaker, mogh Dhamdhere, Marina Fomenkov, kc claffy {bradley,amogh,marina,kc}@caida.org CID, University of California,
Optimal Cache Allocation for Content-Centric Networking
Optimal Cache Allocation for Content-Centric Networking Yonggong Wang, Zhenyu Li, Gaogang Xie Chinese Academy of Sciences Gareth Tyson, Steve Uhlig QMUL Yonggong Wang, Zhenyu Li, Gareth Tyson, Steve Uhlig,
M.E.J. Newman: Models of the Small World
A Review Adaptive Informatics Research Centre Helsinki University of Technology November 7, 2007 Vocabulary N number of nodes of the graph l average distance between nodes D diameter of the graph d is
Example for calculation of clustering coefficient Node N 1 has 8 neighbors (red arrows) There are 12 connectivities among neighbors (blue arrows)
Example for calculation of clustering coefficient Node N 1 has 8 neighbors (red arrows) There are 12 connectivities among neighbors (blue arrows) Average clustering coefficient of a graph Overall measure
Revealing the load-balancing behavior of YouTube traffic of interdomain links
Revealing the load-balancing behavior of YouTube traffic of interdomain links Ricky K. P. Mok + Vaibhav Bajpai*, Amogh Dhamdhere +, kc claffy + + CAIDA/ University of California San Diego * Technical University
arxiv: v2 [cs.ni] 31 Aug 2007
![arxiv: v2 [cs.ni] 31 Aug 2007](/thumbs/83/87463257.jpg "arxiv: v2 [cs.ni] 31 Aug 2007")
Graph Annotations in Modeling Complex Network Topologies arxiv:78.3879v2 [cs.ni] 31 Aug 27 ABSTRACT Xenofontas Dimitropoulos IBM Research, Zürich xed@zurich.ibm.com Amin Vahdat UCSD vahdat@cs.ucsd.edu
How Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
How Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns Roadmap Next several lectures: universal structural properties of networks Each large-scale network is unique microscopically,
Structure of biological networks. Presentation by Atanas Kamburov
Structure of biological networks Presentation by Atanas Kamburov Seminar Gute Ideen in der theoretischen Biologie / Systembiologie 08.05.2007 Overview Motivation Definitions Large-scale properties of cellular
CAIM: Cerca i Anàlisi d Informació Massiva
1 / 72 CAIM: Cerca i Anàlisi d Informació Massiva FIB, Grau en Enginyeria Informàtica Slides by Marta Arias, José Balcázar, Ricard Gavaldá Department of Computer Science, UPC Fall 2016 http://www.cs.upc.edu/~caim
Analytical reasoning task reveals limits of social learning in networks
Electronic Supplementary Material for: Analytical reasoning task reveals limits of social learning in networks Iyad Rahwan, Dmytro Krasnoshtan, Azim Shariff, Jean-François Bonnefon A Experimental Interface
arxiv:cs/ v4 [cs.ni] 13 Sep 2004
![arxiv:cs/ v4 [cs.ni] 13 Sep 2004](/thumbs/89/100172596.jpg "arxiv:cs/ v4 [cs.ni] 13 Sep 2004")
Accurately modeling the Internet topology Shi Zhou and Raúl J. Mondragón Department of Electronic Engineering, Queen Mary College, University of London, London, E1 4NS, United Kingdom. arxiv:cs/0402011v4
CS519: Computer Networks. Lecture 4, Part 5: Mar 1, 2004 Internet Routing:
: Computer Networks Lecture 4, Part 5: Mar 1, 2004 Internet Routing: AS s, igp, and BGP As we said earlier, the Internet is composed of Autonomous Systems (ASs) Where each AS is a set of routers, links,
Master s Thesis. Title. Supervisor Professor Masayuki Murata. Author Yinan Liu. February 12th, 2016
Master s Thesis Title A Study on the Effect of Physical Topology on the Robustness of Fractal Virtual Networks Supervisor Professor Masayuki Murata Author Yinan Liu February 12th, 2016 Department of Information
Structured prediction using the network perceptron
Structured prediction using the network perceptron Ta-tsen Soong Joint work with Stuart Andrews and Prof. Tony Jebara Motivation A lot of network-structured data Social networks Citation networks Biological
Measurement-calibrated Graph Models for Social Network Experiments
Measurement-calibrated Graph Models for Social Network Experiments Alessandra Sala, Lili Cao, Christo Wilson, Robert Zablit, Haitao Zheng and Ben Y. Zhao Computer Science, U. C. Santa Barbara, Santa Barbara,
Inferring Autonomous System Relationships in the Internet. Outline
Inferring Autonomous System Relationships in the Internet Lixin Gao Dept. of Electrical and Computer Engineering University of Massachusetts, Amherst http://www-unix.ecs.umass.edu/~lgao Outline Internet
Topic: Topology and Backbone Networking DisCarte: A Disjunctive Internet Cartographer
Topic: Topology and Backbone Networking DisCarte: A Disjunctive Internet Cartographer Sebastian Schlunke (schlunki@cs.tu-berlin.de) Seminar Internet Measurement Technische Universität Berlin WS 2008/2009
Why dynamic route? (1)
Routing Why dynamic route? (1) Static route is ok only when Network is small There is a single connection point to other network No redundant route 2 Why dynamic route? (2) Dynamic Routing Routers update
ABSTRACT. KIM, SANGMIN. The Internet Topology: Illusion and Reality. (Under the direction of Dr. Khaled Harfoush).
ABSTRACT KIM, SANGMIN. The Internet Topology: Illusion and Reality. (Under the direction of Dr. Khaled Harfoush). Research studies targeted at unveiling the Internet topology are essential for understanding
Outsourcing Privacy-Preserving Social Networks to a Cloud
IEEE INFOCOM 2013, April 14-19, Turin, Italy Outsourcing Privacy-Preserving Social Networks to a Cloud Guojun Wang a, Qin Liu a, Feng Li c, Shuhui Yang d, and Jie Wu b a Central South University, China
Network Maps beyond Connectivity
Network Maps beyond Connectivity Cheng Jin Zhiheng Wang Sugih Jamin {chengjin, zhihengw, jamin}@eecs.umich.edu December 1, 24 Abstract Knowing network topology is becoming increasingly important for a
International Journal of Advance Engineering and Research Development. Simulation Based Improvement Study of Overprovisioned IP Backbone Network
Scientific Journal of Impact Factor (SJIF): 4.72 International Journal of Advance Engineering and Research Development Volume 4, Issue 8, August -2017 e-issn (O): 2348-4470 p-issn (P): 2348-6406 Simulation
Lecture 4: Intradomain Routing. CS 598: Advanced Internetworking Matthew Caesar February 1, 2011
Lecture 4: Intradomain Routing CS 598: Advanced Internetworking Matthew Caesar February 1, 011 1 Robert. How can routers find paths? Robert s local DNS server 10.1.8.7 A 10.1.0.0/16 10.1.0.1 Routing Table
V 1 Introduction! Mon, Oct 15, 2012! Bioinformatics 3 Volkhard Helms!
V 1 Introduction! Mon, Oct 15, 2012! Bioinformatics 3 Volkhard Helms! How Does a Cell Work?! A cell is a crowded environment! => many different proteins,! metabolites, compartments,! On a microscopic level!
Automatic Group-Outlier Detection
Automatic Group-Outlier Detection Amine Chaibi and Mustapha Lebbah and Hanane Azzag LIPN-UMR 7030 Université Paris 13 - CNRS 99, av. J-B Clément - F-93430 Villetaneuse {firstname.secondname}@lipn.univ-paris13.fr
A Statistical Method for Synthetic Power Grid Generation based on the U.S. Western Interconnection
A Statistical Method for Synthetic Power Grid Generation based on the U.S. Western Interconnection Saleh Soltan, Gil Zussman Columbia University New York, NY Failures in Power Grids One of the most essential
1 Homophily and assortative mixing
1 Homophily and assortative mixing Networks, and particularly social networks, often exhibit a property called homophily or assortative mixing, which simply means that the attributes of vertices correlate
A Hybrid Approach for Misbehavior Detection in Wireless Ad-Hoc Networks
A Hybrid Approach for Misbehavior Detection in Wireless Ad-Hoc Networks S. Balachandran, D. Dasgupta, L. Wang Intelligent Security Systems Research Lab Department of Computer Science The University of
Module 8. Routing. Version 2 ECE, IIT Kharagpur
Module 8 Routing Lesson 27 Routing II Objective To explain the concept of same popular routing protocols. 8.2.1 Routing Information Protocol (RIP) This protocol is used inside our autonomous system and
Network Security - ISA 656 Routing Security
Network Security - ISA 656 Angelos Stavrou December 4, 2007 What is? What is Routing Security? History of Routing Security Why So Little Work? How is it Different? The Enemy s Goal? Bad guys play games
An Evolving Network Model With Local-World Structure
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 47 423 An Evolving Network odel With
Improving VANET Protocols via Network Science
Improving VANET Protocols via Network Science Romeu Monteiro,2, Susana Sargento Instituto de Telecomunicações - Universidade de Aveiro Aveiro, Portugal {romeumonteiro7, susana}@ua.pt Abstract Developing
Graph Theory for Network Science
Graph Theory for Network Science Dr. Natarajan Meghanathan Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Networks or Graphs We typically
On the Importance of Local Connectivity for Internet Topology Models
On the Importance of Local Connectivity for Internet Topology Models Hamed Haddadi, Damien Fay, Almerima Jamakovic, Olaf Maennel, Andrew W. Moore, Richard Mortier, Steve Uhlig Max Planck Institute for
Understanding the effect of streaming overlay construction on AS level traffic
Understanding the effect of streaming overlay construction on AS level traffic Reza Motamedi and Reza Rejaie Information and Computer Science Department University of Oregon e-mail: {reza.motamedi,reza}@cs.uoregon.edu
Graph Theory. Graph Theory. COURSE: Introduction to Biological Networks. Euler s Solution LECTURE 1: INTRODUCTION TO NETWORKS.
Graph Theory COURSE: Introduction to Biological Networks LECTURE 1: INTRODUCTION TO NETWORKS Arun Krishnan Koenigsberg, Russia Is it possible to walk with a route that crosses each bridge exactly once,
Mapping PoP-Level Connectivity of Large Content Providers
Mapping PoP-Level Connectivity of Large Content Providers Amir Farzad Reza Rejaie ABSTRACT Large content providers (CPs) are responsible for a large fraction of injected traffic to the Internet. They maintain
THE goal of quality-of-service (QoS) routing is to find a
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 12, NO. 1, FEBRUARY 2004 17 Routing With Topology Aggregation in Delay-Bandwidth Sensitive Networks King-Shan Lui, Member, IEEE, Klara Nahrstedt, Member, IEEE,
Quantifying Internet End-to-End Route Similarity
Quantifying Internet End-to-End Route Similarity Ningning Hu and Peter Steenkiste Carnegie Mellon University Pittsburgh, PA 523, USA {hnn, prs}@cs.cmu.edu Abstract. Route similarity refers to the similarity
Hyperbolic Traffic Load Centrality for Large-Scale Complex Communications Networks
ICT 2016: 23 rd International Conference on Telecommunications Hyperbolic Traffic Load Centrality for Large-Scale Complex Communications Networks National Technical University of Athens (NTUA) School of
Small World Properties Generated by a New Algorithm Under Same Degree of All Nodes
Commun. Theor. Phys. (Beijing, China) 45 (2006) pp. 950 954 c International Academic Publishers Vol. 45, No. 5, May 15, 2006 Small World Properties Generated by a New Algorithm Under Same Degree of All
Topic mash II: assortativity, resilience, link prediction CS224W
Topic mash II: assortativity, resilience, link prediction CS224W Outline Node vs. edge percolation Resilience of randomly vs. preferentially grown networks Resilience in real-world networks network resilience
Second-Order Assortative Mixing in Social Networks
Second-Order Assortative Mixing in Social Networks 1 arxiv:0903.0687v2 [physics.soc-ph] 23 Nov 2009 Shi Zhou* and Ingemar J. Cox Department of Computer Science, University College London Gower Street,
(Social) Networks Analysis III. Prof. Dr. Daning Hu Department of Informatics University of Zurich
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Outline Network Topological Analysis Network Models Random Networks Small-World Networks Scale-Free Networks
Pamplona-traceroute: topology discovery and alias resolution to build router level Internet maps
Pamplona-traceroute: topology discovery and alias resolution to build router level Internet maps Santiago Garcia-Jimenez, Eduardo Magaña, Daniel Morató and Mikel Izal Public University of Navarre, Campus
Inital Starting Point Analysis for K-Means Clustering: A Case Study
lemson University TigerPrints Publications School of omputing 3-26 Inital Starting Point Analysis for K-Means lustering: A ase Study Amy Apon lemson University, aapon@clemson.edu Frank Robinson Vanderbilt
SI Networks: Theory and Application, Fall 2008
University of Michigan Deep Blue deepblue.lib.umich.edu 2008-09 SI 508 - Networks: Theory and Application, Fall 2008 Adamic, Lada Adamic, L. (2008, November 12). Networks: Theory and Application. Retrieved
Most important (cont d) What s most important in Project 1. Important for individuals. From from Most Important
What s most important in Project 1 Most important (cont d) gain some experience with the techniques of protocol implementation Learn to design timeouts and resending Peer to peer interface and protocol
521262S Computer Networks 2 (fall 2007) Laboratory exercise #2: Internetworking
521262S Computer Networks 2 (fall 2007) Laboratory exercise #2: Internetworking Name Student ID Signature In this exercise we will connect our LANs made in first exercise with routers and build an internet.