1 / 29

Hermes Integration and Visualization of Routing Registries Info and BGP Routing Data

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. Presentation Steps. objectives the approach an example of a session Hermes overview data integration engine

kesia
Download Presentation

Hermes Integration and Visualization of Routing Registries Info and BGP Routing Data

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  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 Query INTERNET Middle-Tier User request RecordSet Bottom-Tier Response DB Top-Tier Client Route Views RIPE RADB 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 RecordSet Rule RecordSet Simple Query Simple Query Record Set Record Set Record Set Simple Query 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 www.dia.uniroma3.it/~hermes to try it ! ISMA Dec '00

More Related