Link-Level Internet Structures

Slides:



Advertisements
Similar presentations
Complex Networks Advanced Computer Networks: Part1.
Advertisements

A Suboptimal Solution to Optimizing Cost and Performance in OSPs Presented by: Daniel Burgener Irene Haque.
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
Optimizing genetic algorithm strategies for evolving networks Matthew Berryman.
Breaking the Single-Path Barrier Brad Smith Jack Baskin SoE Research Review Day 10/20/2011.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
An Algebraic Approach to Practical and Scalable Overlay Network Monitoring Yan Chen, David Bindel, Hanhee Song, Randy H. Katz Presented by Mahesh Balakrishnan.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
1 Characterizing Selfishly Constructed Overlay Routing Networks March 11, 2004 Byung-Gon Chun, Rodrigo Fonseca, Ion Stoica, and John Kubiatowicz University.
The Shortest Path Problem
Scalable Construction of Resilient Overlays using Topology Information Mukund Seshadri Dr. Randy Katz.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
UCSC 1 Aman ShaikhICNP 2003 An Efficient Algorithm for OSPF Subnet Aggregation ICNP 2003 Aman Shaikh Dongmei Wang, Guangzhi Li, Jennifer Yates, Charles.
Chapter 13: WAN Technologies and Routing 1. LAN vs. WAN 2. Packet switch 3. Forming a WAN 4. Addressing in WAN 5. Routing in WAN 6. Modeling WAN using.
The Research of Applying Random Early Blocking strategy to Dynamic Lightpath Routing National Yunlin University of Science & Technology.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
Internet Traffic Engineering by Optimizing OSPF Weights Bernard Fortz (Universit é Libre de Bruxelles) Mikkel Thorup (AT&T Labs-Research) Presented by.
Network Aware Resource Allocation in Distributed Clouds.
“The Geography of the Internet Infrastructure: A simulation approach based on the Barabasi-Albert model” Sandra Vinciguerra and Keon Frenken URU – Utrecht.
A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.
Algorithms for Allocating Wavelength Converters in All-Optical Networks Authors: Goaxi Xiao and Yiu-Wing Leung Presented by: Douglas L. Potts CEG 790 Summer.
An Optimization-Driven Approach for Modeling AS-level Internet Connectivity Presented by: Hyunseok Chang Joint work with Sugih Jamin.
Biologically-inspired ring design in Telecommunications Tony White
The Geography and Evolution of the European Internet Infrastructure Sandra Vinciguerra URU – Utrecht University
Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.
Challenges and Opportunities Posed by Power Laws in Network Analysis Bruno Ribeiro UMass Amherst MURI REVIEW MEETING Berkeley, 26 th Oct 2011.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,
Distance Vector Routing
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.
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.
Lecture 23: Structure of Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Constraint-Based Routing
Presented by Tae-Seok Kim
The Underlying Technologies
A Study of Group-Tree Matching in Large Scale Group Communications
Learning to Generate Networks
Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks Sushma Maramreddy.
Isabella Cerutti, Andrea Fumagalli, Sonal Sheth
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.
Optimal Configuration of OSPF Aggregates
B. Jayalakshmi and Alok Singh 2015
Graph Analysis by Persistent Homology
Lecture 23: Structure of Networks
Multi-Core Parallel Routing
Lecture 13 Network evolution
COS 561: Advanced Computer Networks
Why Social Graphs Are Different Communities Finding Triangles
Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.
IP Traceback Problem: How do we determine where malicious packet came from ? It’s a problem because attacker can spoof source IP address If we know where.
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
COS 561: Advanced Computer Networks
Katz Centrality (directed graphs).
Lecture 23: Structure of Networks
Boltzmann Machine (BM) (§6.4)
Lecture 21 Network evolution
COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.
Presentation transcript:

Link-Level Internet Structures Scott Schremmer and Kevin Wampler

Overview Structure of Internet not by chance Economic factors influence structure Two areas of focus: Single ISP structure Multiple ISP structure

Single ISP Simulation Focus on network topology Internet is a graph Nodes: points of presence Population served Geographic location Edges: physical links Bandwidth capacity Need some economic information

Link Cost Function of distance and capacity Two components Cost of cable Cost of laying cable

Bandwidth Cost Cost is per unit length cable Linear in distance Multiple cables linear in bandwidth So single cable sublinear in bandwidth We choose

Traffic Routing Assume shortest-hop Distributed evenly amongst population Traffic between n1 and n2:

Calculating Load Sum of traffic across link For each node: Compute shortest-hop routes For each target node: Add traffic to load on all links on route If load exceeds capacity, excess is overload

Generating Networks Incremental Growth Global optimization Likely a reasonable model Mimics and ISP adding new POPs Growth of ISP matters Global optimization Entire network planned in advance

Incremental Growth Model Investigated by Barabasi and Albert Link probability proportional to degree Yields power degree distribution Applicability is unclear Suboptimal links chosen too often No direct economic incentive

A Better Model New nodes added randomly Optimal link always chosen Provisioned so no overload Topology depends on “optimal” Cost of new link Cost of new and replaced links Overprovisioning

Cost Of New Link Light tailed

Replaced Links Very heavy tailed

Overprovisioning Close to power distribution

Global Optimization Optimize entire network Growth does not matter Need objective function Minimize cost while providing good service Depends on weighting

Generating A Network Initially Random Use Simulated Annealing Add a link Remove a link Grow a link Shrink a link

Cost/Service Emphasis

Degree Distributions

Single ISP Conclusions Topologies similar to reality from: Minimizing load/link replacement with overprovisioning Overconnection to improve service

Extension to Multiple ISP’s Consider that ISPs do not grow in a vacuum How does model change with introduction of more ISP’s Link level structures Economic Choices Router distributions and routing choices

Specifics of simulation Simulated annealing 2 ISP annealed separately Some number of iterations with one Pass shared parameters (inter-isp traffic) Recalculate parameters for annealing separately Routing-2 models Small ISP lets large ISP route to cities it doesn’t cover Small ISP routes to its border

2 Internets. . .

Future work Consider evolving model If an isp is providing better service or has lower cost increase its market share Structures that result Conditions for isp to survive Stable? Anneal together cooperatively, how different are structures Add nodes to small network to simulate growth