Routing (C13 & C14) Notes
The following notes discuss routing. Routing is the process of finding the best path to send data from source to destination. It explains in detail what an autonomous system is. In addition, it discusses the similarities and differences between interior routing protocols and exterior routing protocols. Moreover, it discusses routing tables and how they work and operate to do their required tasks. Furthermore, it discusses topics in discrete structures such as Dijkstra's algorithm, a dynamic graph, the distance vector routing protocol, the distance vector algorithm, link-state routing, etc.
Written for
Document information
- Uploaded on
- June 2, 2022
- Number of pages
- 8
- Written in
- 2020/2021
- Type
- Class notes
- Professor(s)
- Raymond law
- Contains
- All classes
Subjects
- routing
- routing tables
- discrete structures
- dynamic graph
- distance vector algorithm
-
interior routing protocols
-
exterior routing protocols
-
dijkstras algorithm
-
distance vector routing protocol