Lecture 8: Routing I Distance-vector Algorithms
Lecture 8: Routing I Distance-vector Algorithms
CSE 123: Computer Networks Stefan Savage
This class
New topic: routing
How do I get there from
here?
Overview
Routing overview Intra vs. Inter-domain routing Distance-vector routing protocols
3
Router Tasks
Forwarding
Move packet from input link to the appropriate output link Purely local computation Must go be very fast (executed for every packet)
Routing
Make sure that the next hop actually leads to the destination Global decisions; distributed computation and communication Can go slower (only important when topology changes)
Forwarding Options
Source routing
Complete path listed in packet
Virtual circuits
Set up path out-of-band and store path identifier in routers Local path identifier in packet
Destination-based forwarding
Router looks up address in forwarding table Forwarding table contains (address, next-hop) tuples
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related download
- link state routing sharif
- riptutorial
- react js notes for professionals
- lecture 12 link state routing home computer science
- lecture 8 routing i distance vector algorithms
- reactjs tutorialspoint
- the complete beginner s guide to react html5 hive
- csci 1680 transport layer iii congestion control strikes back
- lecture 17 react part 3 george mason university
- an overview of routing theory jim binkley
Related searches
- vector distance formula
- vector distance formula 3d
- acls algorithms 2019
- acls algorithms pdf
- acls algorithms 2020
- how do i find my routing number
- acls aha algorithms 2020
- 2015 pals algorithms pdf download
- acls algorithms printable
- 2020 acls algorithms aha
- vector distance calculator
- distance between two vector calculator