recursive internetwork architecture
play

Recursive InterNetwork Architecture An Assessment of the IRATI - PowerPoint PPT Presentation

Recursive InterNetwork Architecture An Assessment of the IRATI Implementation Jeroen van Leur Jeroen Klomp University of Amsterdam System and Network Engineering February 1, 2016 Introduction Implementations Scenario 1 Scenario 2


  1. Recursive InterNetwork Architecture An Assessment of the IRATI Implementation Jeroen van Leur Jeroen Klomp University of Amsterdam System and Network Engineering February 1, 2016

  2. Introduction Implementations Scenario 1 Scenario 2 Conclusion Research goals Research question What is the current state of the IRATI RINA implementation? • Find out which Recursive InterNetwork Architecture (RINA) implementations exist • Find out their differences • Find out how an experimental network needs to be set up • Find out how resilient the routing in a small network is Jeroen van Leur, Jeroen Klomp 1/20 RINA

  3. Introduction Implementations Scenario 1 Scenario 2 Conclusion Problems with TCP/IP • Mobility not straightforward • Multihoming does not scale • Multicast does not scale • Quality of Service does not scale • Many security issues Jeroen van Leur, Jeroen Klomp 2/20 RINA

  4. Introduction Implementations Scenario 1 Scenario 2 Conclusion What causes these problems? • TCP/IP has an incomplete addressing scheme • Applications are not named • IP addresses name the interface, not the node • Point of attachment (link-layer) addresses are in concept the same as IP addresses • No integrated security Jeroen van Leur, Jeroen Klomp 3/20 RINA

  5. Introduction Implementations Scenario 1 Scenario 2 Conclusion What is wrong with the layers? • Layers not properly defined and inflexible Figure: TCP/IP model?! 1 1 (Veselý, Marek, Hykel, & Ryšavý, 2015) Jeroen van Leur, Jeroen Klomp 4/20 RINA

  6. Introduction Implementations Scenario 1 Scenario 2 Conclusion Layers in RINA "The Internet is an unfinished demo" — John Day (2008) Figure: RINA’s recursive layered approach 2 2 (Veselý et al., 2015) Jeroen van Leur, Jeroen Klomp 5/20 RINA

  7. Introduction Implementations Scenario 1 Scenario 2 Conclusion RINA concepts Figure: RINA layers and components 3 3 Based on (Grasa et al., 2011) Jeroen van Leur, Jeroen Klomp 6/20 RINA

  8. Introduction Implementations Scenario 1 Scenario 2 Conclusion Communication in RINA Figure: RINA directory, routes and paths 4 4 based on (Grasa et al., 2011) Jeroen van Leur, Jeroen Klomp 7/20 RINA

  9. Introduction Implementations Scenario 1 Scenario 2 Conclusion RINA protocols • Only two protocols • Error and Flow Control Protocol • Provides both unreliable (DTP) 5 and reliable (DTCP) 6 flows • No need for handshakes • Flows distinguished by Connection-ID • Common Distributed Application Protocol • Object-based communication • Only six primitive operations: Create/Delete, Read/Write, Start/Stop 5 Data Transfer Protocol 6 Data Transfer Control Protocol Jeroen van Leur, Jeroen Klomp 8/20 RINA

  10. Introduction Implementations Scenario 1 Scenario 2 Conclusion Implementations Figure: PSOC overviewed RINA implementations 7 7 Adapted from (Grasa, 2015) Jeroen van Leur, Jeroen Klomp 9/20 RINA

  11. Introduction Implementations Scenario 1 Scenario 2 Conclusion IRATI • Multiple shim Distributed IPC Facilities (DIFs) • UDP/IP • Ethernet via 802.1Q • Hypervisor to guest • Dummy shim for debugging • Routing • Intermediate System-to-Intermediate System (IS-IS) • IP Fast Reroute (IPFRR) • Optional multipath routing with equal-cost multipath routing (ECMP) plugin Jeroen van Leur, Jeroen Klomp 10/20 RINA

  12. Introduction Implementations Scenario 1 Scenario 2 Conclusion Design Figure: Physical network design Figure: Logical network design Jeroen van Leur, Jeroen Klomp 11/20 RINA

  13. Introduction Implementations Scenario 1 Scenario 2 Conclusion Basic tests • IRATI stack • Initialisation • Enrolling to DIF • Connectivity test • Behaviour of flow • Monitoring the connectivity • Performance test Jeroen van Leur, Jeroen Klomp 12/20 RINA

  14. Introduction Implementations Scenario 1 Scenario 2 Conclusion Results • Susceptible to configuration errors • Debugging options: high I/O and impact CPU • Tooling results: • Echo tool shows response round-trip time (RTT) less than 1 ms. • Wireshark showed src/dst address correctly after patching • Performance tests results from 400 Mbit/sec to 15 Gbit/sec Figure: Wrong address Figure: Correct address Jeroen van Leur, Jeroen Klomp 13/20 RINA

  15. Introduction Implementations Scenario 1 Scenario 2 Conclusion Physical design Jeroen van Leur, Jeroen Klomp 14/20 RINA

  16. Introduction Implementations Scenario 1 Scenario 2 Conclusion Logical design Jeroen van Leur, Jeroen Klomp 15/20 RINA

  17. Introduction Implementations Scenario 1 Scenario 2 Conclusion Routing tests • Configuration • Enrolling to the DIFs • Changes in the tools • Resilience tests • Disconnecting links • Connectivity test • Multipath plugin • Performance test Jeroen van Leur, Jeroen Klomp 16/20 RINA

  18. Introduction Implementations Scenario 1 Scenario 2 Conclusion Results • Manual configuration of all systems • Routing information in resource information base (RIB) • Next Hops • Underlying DIF • All neighbours • Network updates are propagated Next hops Name: /resalloc/nhopt/key=16-0; Class: NextHopTableEntry; Instance: 47 Value: Destination address: 16; QoS-id: 0; Cost: 1; Next hop addresses: 17 / Name: /resalloc/nhopt/key=17-0; Class: NextHopTableEntry; Instance: 48 Value: Destination address: 17; QoS-id: 0; Cost: 1; Next hop addresses: 17 / Name: /resalloc/nhopt/key=18-0; Class: NextHopTableEntry; Instance: 49 Value: Destination address: 18; QoS-id: 0; Cost: 1; Next hop addresses: 18 / Jeroen van Leur, Jeroen Klomp 17/20 RINA

  19. Introduction Implementations Scenario 1 Scenario 2 Conclusion Routing Resiliency • System 1 - System 2 disconnected • No re-routing possible for existing and new flows • Multipath plugin • Multiple paths in Wireshark • Next hops change in RIB • Lacks link failure resiliency Multipath next hops Name: /resalloc/nhopt/key=16-0; Class: NextHopTableEntry; Instance: 47 Value: Destination address: 16; QoS-id: 0; Cost: 1; Next hop addresses: 17/ Name: /resalloc/nhopt/key=17-0; Class: NextHopTableEntry; Instance: 48 Value: Destination address: 17; QoS-id: 0; Cost: 1; Next hop addresses: 18/ Name: /resalloc/nhopt/key=18-0; Class: NextHopTableEntry; Instance: 49 Value: Destination address: 18; QoS-id: 0; Cost: 1; Next hop addresses: 17/ 18 Jeroen van Leur, Jeroen Klomp 18/20 RINA

  20. Introduction Implementations Scenario 1 Scenario 2 Conclusion Conclusion • IRATI is still in an experimental phase • Routing was not resilient • Using IRATI requires Unix background and programming skills to debug issues • Ongoing progress: • Future projects will enhance IRATI • New ProtoRINA release this year • Active improvement of the RINA reference model Jeroen van Leur, Jeroen Klomp 19/20 RINA

  21. Introduction Implementations Scenario 1 Scenario 2 Conclusion Any questions? Jeroen van Leur, Jeroen Klomp 20/20 RINA

  22. References References Grasa, E. (2015, October). Rina essentials. NEXTWORKS, PRISTINE, and University of Pisa. Retrieved January 27, 2016, from http://ict-pristine.eu/wp- content/uploads/2015/11/IF2015-SDN-NFV-RINA- 04_RINA-essentials.pdf Grasa, E., Trouva, E., Phelan, P., de Leon, M. P., Day, J., Matta, I., . . . Bunch, S. (2011). Design principles of the recursive internetwork architecture (RINA). Retrieved January 29, 2016, from http://www.future- internet.eu/fileadmin/documents/fiarch23may2011/06- Grasa_ DesignPrinciplesOTheRecursiveInterNetworkArchitecture. pdf Jeroen van Leur, Jeroen Klomp 20/20 RINA

  23. References References Veselý, V., Marek, M., Hykel, T., & Ryšavý, O. (2015). Rinasim: your recursive internetwork architecture simulator. September 3, 2015 (7). Omnet++ community summit 2015. Zurich. Retrieved January 6, 2016, from https://summit.omnetpp.org/archive/2015/#keynotes Jeroen van Leur, Jeroen Klomp 20/20 RINA

Recommend


More recommend