ISMA Dec '00 1 Hermes Integration and Visualization of Routing Registries Info and BGP Routing Data A. Carmignani, G. Di Battista, W. Didimo, M. Patrignani,

Slides:



Advertisements
Similar presentations
Intelligent Technologies Module: Ontologies and their use in Information Systems Revision lecture Alex Poulovassilis November/December 2009.
Advertisements

Visualization of Computer Networks By Richard Zschech Supervisor: Dr. Paul Coddington, Dr. Ken Hawick.
A RIS-based System for the Visualization of the Routing Flaps Maurizio Patrignani.
Hierarchy in networks Peter Náther, Mária Markošová, Boris Rudolf Vyjde : Physica A, dec
0 General information Rate of acceptance 37% Papers from 15 Countries and 5 Geographical Areas –North America 5 –South America 2 –Europe 20 –Asia 2 –Australia.
8.
Integrating SOA and the Application Development Framework Shaun O’Brien Principal Product Manager – Oracle JDeveloper / ADF.
Supervisor: Amichai Shulman Students: Vitaly Timofeev Eyal Shemesh.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
Visual Analysis of Large Graphs Using (X, Y)-clustering and Hybrid Visualizations V. Batagelj, W. Didimo, G. Liotta, P. Palladino, M. Patrignani (Univ.
Interactive Generation of Integrated Schemas Laura Chiticariu et al. Presented by: Meher Talat Shaikh.
Distributed Databases Logical next step in geographically dispersed organisations goal is to provide location transparency starting point = a set of decentralised.
Nov Copyright Galdos Systems Inc. November 2001 Geography Markup Language Enabling the Geo-spatial Web.
Session – 6 DISTRIBUTED DATABASE ARCHITECTURE Matakuliah: M0184 / Pengolahan Data Distribusi Tahun: 2005 Versi:
1 A survey of Internet Topology Discovery. 2 Outline Motivations Internet topology IP Interface Level Router Level AS Level PoP Level.
ABCSG - Distributed Database 1 Data Management Distributed Database Data Replication.
GGF Toronto Spitfire A Relational DB Service for the Grid Peter Z. Kunszt European DataGrid Data Management CERN Database Group.
2005Integration-intro1 Data Integration Systems overview The architecture of a data integration system:  Components and their interaction  Tasks  Concepts.
1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.
Graphs and Topology Yao Zhao. Background of Graph A graph is a pair G =(V,E) –Undirected graph and directed graph –Weighted graph and unweighted graph.
Academic Year 2014 Spring.
Graph Algebra with Pattern Matching and Aggregation Support 1.
XP New Perspectives on Microsoft Access 2002 Tutorial 71 Microsoft Access 2002 Tutorial 7 – Integrating Access With the Web and With Other Programs.
© 2011 Cisco and/or its affiliates. All rights reserved. Cisco Confidential 1 August 15th, 2012 BP & IA Team.
LÊ QU Ố C HUY ID: QLU OUTLINE  What is data mining ?  Major issues in data mining 2.
Data Integration in Service Oriented Architectures Rahul Patel Sr. Director R & D, BEA Systems Liquid Data – XML-based data access and integration for.
Scaling IXPs Scalable Infrastructure Workshop. Objectives  To explain scaling options within the IXP  To introduce the Internet Routing Registry at.
CSV: Visualizing and Mining Cohesive Subgraphs Nan Wang Srinivasan Parthasarathy Kian-Lee Tan Anthony K. H. Tung School of Computing National University.
Computer networks research roma III university inter-domain routing, ipv6, and network visualization giuseppe di battista maurizio patrignani.
Fundamentals of Information Systems, Fifth Edition
Database Application Security Models Database Application Security Models 1.
Efficient Mapping onto Coarse-Grained Reconfigurable Architectures using Graph Drawing based Algorithm Jonghee Yoon, Aviral Shrivastava *, Minwook Ahn,
Lecture 5: Sun: 1/5/ Distributed Algorithms - Distributed Databases Lecturer/ Kawther Abas CS- 492 : Distributed system &
IP Network Clearinghouse Solutions ENUM IP-Enabling The Global Telephone Directory Frank Estes Vice President , ext 224
MIS 673: Database Analysis and Design u Objectives: u Know how to analyze an environment and draw its semantic data model u Understand data analysis and.
Topological Morphing of Planar Graphs Bertinoro Workshop on Graph Drawing 2012.
Page 1 Alliver™ Page 2 Scenario Users Contents Properties Contexts Tags Users Context Listener Set of contents Service Reasoner GPS Navigator.
UHD::3320::CH121 DESIGN PHASE Chapter 12. UHD::3320::CH122 Design Phase Two Aspects –Actions which operate on data –Data on which actions operate Two.
1 University of California, Irvine Done By : Ala Khalifeh (Note : Not Presented)
Data Integration Hanna Zhong Department of Computer Science University of Illinois, Urbana-Champaign 11/12/2009.
CASE (Computer-Aided Software Engineering) Tools Software that is used to support software process activities. Provides software process support by:- –
Digital Libraries1 David Rashty. Digital Libraries2 “A library is an arsenal of liberty” Anonymous.
Visualizing Large Dynamic Digraphs Michael Burch.
Internet of Things. IoT Novel paradigm – Rapidly gaining ground in the wireless scenario Basic idea – Pervasive presence around us a variety of things.
1 Advanced Software Architecture Muhammad Bilal Bashir PhD Scholar (Computer Science) Mohammad Ali Jinnah University.
LASER Navigation srl – 3DCarto. LASER Navigation srl – 3DCarto Project 3DCarto is the endpoint of a wide breadth project,
Graphs. Introduction Graphs are a collection of vertices and edges Graphs are a collection of vertices and edges The solid circles are the vertices A,
Introduction to Active Directory
Graphs Basic properties.
+ GRAPH Algorithm Dikompilasi dari banyak sumber.
Class Diagrams. Terms and Concepts A class diagram is a diagram that shows a set of classes, interfaces, and collaborations and their relationships.
Presentation on Database management Submitted To: Prof: Rutvi Sarang Submitted By: Dharmishtha A. Baria Roll:No:1(sem-3)
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. Fast.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Intermon Advanced architecture for INTER- domain Quality of service.
Semantic Graph Mining for Biomedical Network Analysis: A Case Study in Traditional Chinese Medicine Tong Yu HCLS
Database Systems: Design, Implementation, and Management Tenth Edition
Introduction to Load Balancing:
Relational Databases.
CHAPTER 3 Architectures for Distributed Systems
Wsdl.
CS 174: Server-Side Web Programming February 12 Class Meeting
(VIP-EDC) Point 6 of the agenda
Database Systems Chapter 1
Data Warehousing and Data Mining
MODULE 14 – COMPLEXITY OF ORGANISATIONAL CHANGE
Joint DFIG – Broker Meeting The DFIG view Peter Wittenburg
Graphs.
Visualization of Temporal Difference of BGP Routing Information
Bipartite graphs and Planar Graphs
Presentation transcript:

ISMA Dec '00 1 Hermes Integration and Visualization of Routing Registries Info and BGP Routing Data A. Carmignani, G. Di Battista, W. Didimo, M. Patrignani, M. Pizzonia 3th University of Rome

ISMA Dec '00 2 Presentation Steps objectives the approach an example of a session Hermes overview data integration engine graph drawing engine future work

ISMA Dec '00 3 Objectives A service able to: explore the Internet interconnections at the ASes level visualize interactive maps explore dynamically and statically provide wide (as much as possible) information on every element of the map manage heterogeneous sources of data, aiming at recognizing and resolving probable ambiguities

ISMA Dec '00 4 The Approach An interdisciplinary approach that uses: a collection of data provided by –the Internet Routing Registries –the Route Views Project the services offered by a relational database efficient algorithms for the visualization of complex drawings

ISMA Dec '00 5 A session with Hermes

ISMA Dec '00 6 A session with Hermes

ISMA Dec '00 7 A session with Hermes

ISMA Dec '00 8 A session with Hermes

ISMA Dec '00 9 A session with Hermes

ISMA Dec '00 10 A session with Hermes

ISMA Dec '00 11 A session with Hermes

ISMA Dec '00 12 A session with Hermes

ISMA Dec '00 13 A session with Hermes

ISMA Dec '00 14 A session with Hermes

ISMA Dec '00 15 A session with Hermes

ISMA Dec '00 16 A session with Hermes

ISMA Dec '00 17 A session with Hermes

ISMA Dec '00 18 A session with Hermes

ISMA Dec '00 19 A session with Hermes

ISMA Dec '00 20 Hermes main features based on: –a 3 tiers architecture –a repository of routing information –a mediator for the information integration –a graph drawing module that computes the drawing of the ASes interconnections already explored (static and dynamic algorithms)

ISMA Dec '00 21 Hermes: a three tiers architecture Middle-Tier Bottom-Tier User request RecordSet Query Response Top-Tier Client DB Route Views RADB RIPE INTERNET

ISMA Dec '00 22 Data Integration

ISMA Dec '00 23 Mediator - definition A mediator converts “general queries” inherent a global E-R schema into one or more “specific queries” inherent the real databases composing the global schema. It also integrates the results provided by the databases involved, resolving the possible ambiguities.

ISMA Dec '00 24 Mediator - motivations Motivation for a Mediator with “virtual views”: 1 modularity: other databases with different structures can be added 2 scalability: various mediators can be linked together 3 some kind of databases don’t exist: for example the DNS

ISMA Dec '00 25 Mediator Request Rule Simple Query Simple Query Simple Query Record Set Record Set Record Set RecordSet

ISMA Dec '00 26 Interconnections: a graph drawing perspective ASes and their interconnection as a unique graph G: 6,849 vertices and 27,686 edges 75% of vertices have degree less or equal 4 1% of vertices have degree more than 100 5% of the induced graphs (local graph) have density greater than 10 >30% of the vertices are adjacent to a vertex whose local graph has density > 10

ISMA Dec '00 27 The Graph drawing module when a new AS is explored, hermes enriches the current ASes subgraph with new vertices and edges, and a new drawing is computed with two possible strategies: –static algorithm: the map is completely redrawn; the new drawing can deeply change from the previous one –dynamic algorithm: the new vertices and edges are added preserving the shape of the previous drawing

ISMA Dec '00 28 Incongruities Some Ases don’t have any policy-in or policy-out Existence of asymmetric policies (incomplete policy information) Two way policy inconsistency Peering between Border Routers

ISMA Dec '00 29 Future work moving to RPSL more sources of information more reasoning on inconsistencies visualization of route flap visualization of the relationship between services and the Internet structure Log on to to try it !