Computer Science 1 An Approach to Universal Topology Generation Alberto Medina Anukool Lakhina Ibrahim Matta John Byers

Slides:



Advertisements
Similar presentations
BGP-SRx BGP - Secure Routing Extension BRITE BGP Security / RPKI Interoperability Test & Evaluation Doug Montgomery 1IETF 802/12/2014.
Advertisements

A Workflow Engine with Multi-Level Parallelism Supports Qifeng Huang and Yan Huang School of Computer Science Cardiff University
University of Nevada, Reno Router-level Internet Topology Mapping CS790 Presentation Modified from Dr. Gunes slides by Talha OZ.
1 Intrusion Monitoring of Malicious Routing Behavior Poornima Balasubramanyam Karl Levitt Computer Security Laboratory Department of Computer Science UCDavis.
IPv4 and IPv6 Mobility Support Using MPLS and MP-BGP draft-berzin-malis-mpls-mobility-00 Oleg Berzin, Andy Malis {oleg.berzin,
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
1 Routing Simulations – Zebra Routing Software Eric Ciocca Dimitris Zacharopoulos.
1 6/14/ :27 CS575Internetworking & Routers1 Rivier College CS575: Advanced LANs Chapter 13: Internetworking & Routers.
A BitTorrent Module for the OMNeT++ Simulator MASCOTS 2009, London, UK G. Xylomenos (with K. Katsaros, V.P. Kemerlis and C. Stais)
Hardware-based Load Generation for Testing Servers Lorenzo Orecchia Madhur Tulsiani CS 252 Spring 2006 Final Project Presentation May 1, 2006.
SANS A Simple Ad hoc Network Simulator Nicolas Burri Roger Wattenhofer Yves Weber Aaron Zollinger.
1IMIC, 8/30/99 Constraint-Based Unicast and Multicast: Practical Issues Bala Rajagopalan NEC C&C Research Labs Princeton, NJ
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
Architecture and Real Time Systems Lab University of Massachusetts, Amherst An Application Driven Reliability Measures and Evaluation Tool for Fault Tolerant.
Performance Comparison of Existing Leader Election Algorithms for Dynamic Networks Mobile Ad Hoc (Dynamic) Networks: Collection of potentially mobile computing.
Student Projects in Computer Networking: Simulation versus Coding Leann M. Christianson Kevin A. Brown Cal State East Bay.
The new The new MONARC Simulation Framework Iosif Legrand  California Institute of Technology.
On Distinguishing between Internet Power Law B Bu and Towsley Infocom 2002 Presented by.
Routing Protocol Pertemuan 21 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
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 –
I. Matta 1 On the Cost of Supporting Multihoming and Mobility Ibrahim Matta Computer Science Boston University Joint work with Vatche Ishakian, Joseph.
Chapter 27 Q and A Victor Norman IS333 Spring 2015.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
Edge Based Cloud Computing as a Feasible Network Paradigm(1/27) Edge-Based Cloud Computing as a Feasible Network Paradigm Joe Elizondo and Sam Palmer.
Position Statement Debbie Perouli, PhD Student Sonia Fahmy, Associate Professor Computer Science Department Purdue University WODNAFO 10.
On the Geographic Location of Internet Resources Mark Crovella Boston University Computer Science with Anukool Lakhina, John Byers, and Ibrahim Matta or.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Introduction to Information Retrieval CS 5604: Information Storage and Retrieval ProjCINETViz by Maksudul Alam, S M Arifuzzaman, and Md Hasanuzzaman Bhuiyan.
BRITE integration with ns-3 Joshua Pelkey and Dr. George Riley Wns3 March 25, 2011.
Subnet Level Internet Topology Generator Mehmet Burak AKGUN CS790 Complex Networks.
I. Matta1 On the Cost of Supporting Mobility and Multihoming Vatche Ishakian, Ibrahim Matta, Joseph Akinwumi Computer Science Boston University.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
Redes Inalámbricas Máster Ingeniería de Computadores 2008/2009 Tema 7.- CASTADIVA PROJECT Performance Evaluation of a MANET architecture.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Texas A&M University Page 1 9/16/ :22:47 PM Wei Zhao Texas A&M University Is Computer Stuff Science, Engineering, or Something else?
Mobile Topic Maps for e-Learning John McDonald & Darina Dicheva Intelligent Information Systems Group Computer Science Department Winston-Salem State University,
Objectives: Chapter 5: Network/Internet Layer  How Networks are connected Network/Internet Layer Routed Protocols Routing Protocols Autonomous Systems.
Web mapping interoperability in practice, a Java approach guided by the OpenGis Web Map Server Interface Specification Pedro Fernández, R. Béjar, M.A.
Multicast Algorithms for Multi- Channel Wireless Mesh Networks Guokai Zeng, Bo Wang, Yong Ding, Li Xiao, Matt Mutka Department of Computer Science and.
Inter-domain Routing Simulation by SSFNet Wang Lijun Tsinghua University Jul 3, 2006.
Interior Gateway Protocol. Introduction An IGP (Interior Gateway Protocol) is a protocol for exchanging routing information between gateways (hosts with.
Heterogeneous Network Topology Generators Amer Zaheer 1.
A Case Study in Understanding OSPFv2 and BGP4 Interactions Using Efficient Experiment Design David Bauer†, Murat Yuksel‡, Christopher Carothers† and Shivkumar.
Impact of Topology on Overlay Multicast Suat Mercan.
1 Week 5 Lecture 2 IP Layer. 2 Network layer functions transport packet from sending to receiving hosts transport packet from sending to receiving hosts.
SSFNet and Routing Simulation BJ Premore Dartmouth College.
Network Measurement Tools ESnet Site Coordinators Meeting 26 April 2000 Tracie Monk, UCSD/SDSC/CAIDA -
Datacenter Network Simulation using ns3
Investigation of Global Network Routing Behavior BJ Premore Dartmouth College Prof. David Nicol, Advisor December 8, 2000 In collaboration with Jim Cowie,
LAMP: Bringing perfSONAR to ProtoGENI Martin Swany.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
Graph RAT A framework for integrating social and content data By Daniel McEnnis University of Waikato To what extent do artists cluster into genres Pattern.
Design of an Integrated Robot Simulator for Learning Applications Brendon Wilson April 15th, 1999.
An Efficient Gigabit Ethernet Switch Model for Large-Scale Simulation Dong (Kevin) Jin.
COS 420 Day 15. Agenda Finish Individualized Project Presentations on Thrusday Have Grading sheets to me by Friday Group Project Discussion Goals & Timelines.
IP-BASED MOBILITY FOR WIRELESS LANS WITH THE NETWORK SIMULATOR NS Frank Christahl, Andreas Huber, Matthias Rosenschon University of Applied Sciences Giessen-Friedberg.
THE IMPACT OF OSPF ROUTING ON MILITARY MANETS BY ROCCO LUPOI UNDER THE GUIDANCE OF DR. GRANT WIGLEY THESIS - BACHELOR OF COMPUTER SCIENCE (HONOURS) - LHIS.
Multi-objective Topology Synthesis and FPGA Prototyping Framework of Application Specific Network-on-Chip m Akram Ben Ahmed Xinyu LI, Omar Hammami.
Copyright 2007, Information Builders. Slide 1 iWay Web Services and WebFOCUS Consumption Michael Florkowski Information Builders.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
INTERNET SIMULATOR Jelena Mirkovic USC Information Sciences Institute
MicroGrid Update & A Synthetic Grid Resource Generator Xin Liu, Yang-suk Kee, Andrew Chien Department of Computer Science and Engineering Center for Networked.
PATH DIVERSITY WITH FORWARD ERROR CORRECTION SYSTEM FOR PACKET SWITCHED NETWORKS Thinh Nguyen and Avideh Zakhor IEEE INFOCOM 2003.
ROUTING ON THE INTERNET COSC Jun-16. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
1 Scalability and Accuracy in a Large-Scale Network Emulator Nov. 12, 2003 Byung-Gon Chun.
Interaction and Animation on Geolocalization Based Network Topology by Engin Arslan.
A Study of Group-Tree Matching in Large Scale Group Communications
Subnet Level Internet Topology Generator
COMPUTER NETWORKS CS610 Lecture-42 Hammad Khalid Khan.
Presentation transcript:

Computer Science 1 An Approach to Universal Topology Generation Alberto Medina Anukool Lakhina Ibrahim Matta John Byers

Computer Science 2 Why Topology Generation?  To effectively engineer the Internet  Open Question: Are topologies generated by existing models representative of the Internet?  Our contribution is a universal topology generation framework

Computer Science 3 Main Features of BRITE  Flexible: supports multiple generation models  Extensible: allows adding new generation models  Interoperable: allows use of topologies from other topology generators  Portable: implemented in Java and C++  User Friendly: provides a GUI and configuration files.

Computer Science 4 The Big Picture Configuration File (Parameters) BRITE GT-ITM NLANR Skitter + BRITE GENERATION Engine BRITE ANALYSIS Engine BRITE NS SSF Min-Hop Paths Degree Rank Degree Freq Path Lengths output formats Imported file formats

Computer Science 5 BRITE Architecture Topology Graph Model Model 1 Nodes BRITE NS SSF Export Methods Model 2 Model n... Edges

Computer Science 6  A repository of analysis routines for topologies  Allows researchers to share analysis routines and create benchmarks to compare topologies  Fully integrated with BRITE but can also be used independently BRIANA: The BRITE Analysis Engine

Computer Science 7 Experimental Results NLANR Topology (04/98) BRITE Topology (Barabási-Albert Model) GT-ITM Topology (Flat)

Computer Science 8 Visualizing BRITE Topologies A BRITE generated topology (5K nodes, 10K edges) visualized in Otter

Computer Science 9  Large scale topological simulations are vital to verify abstractions and models of the Internet  SSFNet is a high performance (100K multi- protocol hosts and routers) simulation framework. A BRITE generated topology #BRITE topology output to SSFNET’s DML format Net [ frequency #1 nanosecond time resolution …. #ROUTERS router [ id 0 graph [ProtocolSession [name ip use SSF.OS.IP] ProtocolSession [name ospf use SSF.OS.OSPF.sOSPF] ] interface [idrange [from 0 to 3] _extends.dictionary.100BaseT] ] …. #LINKS link [ attach 0(1) attach 3760(1) delay 0.0 ] link [ attach 0(2) attach 1898(1) delay 0.0 ] … ] #end of NET Export to SSFNet BRITE Topologies in Large-Scale Simulations

Computer Science 10  Produce annotated topologies  Create Internet Simulation Environments  Develop models for dynamic topologies  Devise a taxonomy of metrics for topology analysis  Use BRITE and BRIANA to evaluate Internet protocols and algorithms Future Directions

Computer Science 11  A. Medina, A. Lakhina, I. Matta, and J. Byers. An Approach to Universal Topology Generation. Submitted to MASCOTS April,  A. Medina, I. Matta, and J. Byers. On the Origin of Power Laws in Internet Topologies. ACM Computer Communications Review, April  A. Medina, I. Matta, and J. Byers. BRITE 1.0: A Flexible Generator of Internet Topologies. BU-CS-TR January 21,  A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: Universal Topology Generation from a User's Perspective. BU-CS-TR April 05, Publications