nimrod routing feedback based routing
TRANSCRIPT
![Page 2: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/2.jpg)
![Page 3: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/3.jpg)
Summary
Limitations of actual routing system Feedback based routing (protocol)
Security, Fault tolerance Scalability, Rapid convergence
Nimrod routing (architecture) Security, Scalability, New Features Deployment
![Page 4: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/4.jpg)
Actual Routing protocol
Border Gateway Protocol BGP Distance vector Hopbyhop All routers collaborate
![Page 5: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/5.jpg)
What's wrong with that?
BGP Distance vector
Grows exponentially Slow convergence time
Hopbyhop No control on the route by users
All routers need to collaborate Tables must be consistent
![Page 6: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/6.jpg)
Feedback Based Routing
New routing protocol
Link state Distinguish structural and dynamic information
Edge: routing decisions and measurements Core: propagate information and forward packets
![Page 7: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/7.jpg)
Routing information
Structural Existence of links Propagated to the edge of the network
Dynamic Quality of paths Not propagated, but measured
![Page 8: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/8.jpg)
Access and Transit
Access routers at the border of edge networks select routes insert Internet Relay Tokens (IRT)
Transit routers at the border of autonomous systems (AS) don't compute routing tables forward packets with respect to IRT
![Page 9: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/9.jpg)
Normal route
![Page 10: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/10.jpg)
Feedback algorithm
Compute two routes to every network prefix disjoint routes exclusion of badlinks
Monitor the quality of the routes assign expiration time sample round trip time (RTT)
Define primary and backup routes
![Page 11: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/11.jpg)
New Routes
![Page 12: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/12.jpg)
Security
Access routers always monitor the route avoid black holes and bad links public key to authenticate the routers
Problems in monitoring bogus TCP answers: SYN / SYNACK
![Page 13: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/13.jpg)
Scalability
Route computation is moved to the edge no need to compute shortest path in core routers
Messages reduction: only structural changes Transit routers
independent from number of address prefixes can limit resources
![Page 14: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/14.jpg)
What can be better?
Policy routing provider restrictions (cost, services, accounting) user requirements (quality, provider)
Mobility of endpoints Different types of communication media
throughput, delay privacy
![Page 15: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/15.jpg)
Nimrod
Perfection is attained not when there is no longer anything to add, but when there is no longer anything to take away.Antoine de Saint Exupery
One ring to rule them all, one ring to find them, one ring to bring them all, and in the darkness bind them.J.R.R. Tolkien
![Page 16: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/16.jpg)
Nimrod Routing
Nimrod: it might run one day RFC 1992, many other documents Year 1996
Routing Architecture
![Page 17: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/17.jpg)
Architecture vs Protocol
Architecture provides a model to understand the internetwork description of functionalities and interactions
Architecture doesn't provide definition of the protocols definition of the algorithms
![Page 18: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/18.jpg)
Goals
Policies access control trust model information hiding accountability
Service specific routing besteffort, pay service user requirements, provider restrictions
![Page 19: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/19.jpg)
Goals
Support dynamic internetwork arbitrary size control routing information usercontrolled routes
Incremental deployment, interoperable changes Vendor independant
![Page 20: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/20.jpg)
Architecture
Node region of the internetwork host, continent, process
Adjacency Map
graph composed by nodes and adjacencies used for routing different levels of abstraction
![Page 21: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/21.jpg)
Architecture
Endpoint Identifiers (EID) identify host or user globally unique no topological significance
Locators identifies a location hierarchical used for routing decisions
![Page 22: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/22.jpg)
Raw Map
![Page 23: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/23.jpg)
Scalability
Clustering reduce the number of visible entities hierarchy with unique universal root must satisfy connectivity
Abstraction reduce the amount of information
Either algorithms are not imposed by Nimrod
![Page 24: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/24.jpg)
Abstract Map
![Page 25: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/25.jpg)
Scalability
Information hiding each node decides what information to disclose advertising of specific portions advertising to specific users
Limit forwarding information multiplex traffic flows install information only for active flows
![Page 26: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/26.jpg)
Scalability
Local selection of routes compute special routes only if needed protocol not imposed by Nimrod
Caching temporary routes used to generate the final ones expected duration of useful information
![Page 27: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/27.jpg)
Forwarding
Connectivity Specification Sequence sequence of nodes to visit doesn't specify physical path
Connectivity Specification Chain continuous list of nodes to visit doesn't specify physical path
![Page 28: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/28.jpg)
Forwarding
Flow mode initially installs a path in the routers for each packet, just follow the installed instructions
Datagram mode every packet carries source and destination locators no information is saved in routers
![Page 29: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/29.jpg)
Nimrod Agents
Entity representative entity attributes assign locators
Association agent answer queries propagate information
Route agent collect maps generate routes
Forwarding agent initiate relationships request routes
![Page 30: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/30.jpg)
Example of Path Setup
![Page 31: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/31.jpg)
Conclusions
Feedback based routing routing resources independent from network size offer better convergence times solves some security issues
![Page 32: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/32.jpg)
Conclusions
Nimrod provides a new architecture based on actual and future requirements provides base for diversity (networks, services, ...)
Transition is taken into account can be integrated with actual architecture changes are interoperable vendor specific algorithms
![Page 33: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/33.jpg)
Criticisms
Feedback based routing Addressing needs Endtoend principle Lack of support for new features
![Page 34: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/34.jpg)
Criticisms
Nimrod deployment IP as locators and EID? Global registries Implementation
![Page 35: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/35.jpg)
Questions?
![Page 36: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/36.jpg)
References
Feedback Based RoutingD. Zhu, M. Gritter, D. R. Cheriton
The Nimrod Routing Architecture, 1996I. Castineyra, N. Chiappa, M. Steenstrup
A Perspective on Nimrod Functionality, 1994M. Steenstrup; internet draft
A New IP Routing and Addressing ArchitectureN. Chiappa; draft
![Page 37: Nimrod Routing Feedback Based Routing](https://reader030.vdocuments.mx/reader030/viewer/2022020701/61f8d440d55044632e2c4d2c/html5/thumbnails/37.jpg)
Nimrod Routing
Feedback Based Routing
Thank you