CSE 123 Lecture Notes - Lecture 27: Source Routing, Hypertext Transfer Protocol, Tcp Tuning
7 Dec 2018
School
Department
Course
Professor
Document Summary
| ethernet | ip | tcp | http | payload. Know the fields of each header, how to fragment, etc. Arbitrate which nodes can send frames at any point in time. Builds a table that maps a port number to a temporary one. Internet does not know about lan addresses (these are not even routable) In general, rewriting a set of ip addresses with another. Set up path out-of-band and store path identifier in routers. Router looks up address in forwarding table. 2 phases: reliable flooding - send lsp packets so every router learned about every other router. Every router has a map (no need to coordinate about how to route!: path calculation (dijkstra"s) Every router would compute the cost of how to get to the dest. Problem: only tell neighbors how much it costs. Never advertise dest through its next hop. Poison reverse: send negative info when advertising a destination through its next hop!
