CIS 3210 Lecture Notes - Lecture 30: Routing Protocol, Open Shortest Path First

• School: University of Guelph
• Department: Computing and Information Science
• Course: CIS 3210
• Professor: Xiaodong Lin

Document Summary

The dv algorithm is much simpler because you only need to know your neighbour. Dv: the speed is usually very fast, but in special situations, the link cost may go up dramatically (count to in nity problem) If only one router goes down what happens for the algorithms. Thus far the routing protocol is idealized, all routers are identical and networks are at Aggregate routers into regions known as autonomous systems (as) aka domain intra-as routing. Routing among hosts, routers in same as ( network ) All routers in as must run same intra-domain protocol. Routers in di erent as can run di erent intra-domain routing protocol. Gateway router: at the edge of its own as has links to routers in other as"es. Gateways perform inter domain routing as well as intra-domain routing. For sending a packet out of the as domain the gateway router will need to know both protocols.