CMPT 371 Chapter Notes - Chapter 4: Delimiter, Solar Energy Generating Systems, Alohanet

• School: Simon Fraser University
• Department: Computing Science
• Course: CMPT 371
• Professor: Jiangchuan Liu

Document Summary

Network layer functions: dv vs ls. Deliver packets to receiving hosts. Protocols in every host and router. Important functions: path determination: route taken bit packets from source to dest. O(n^2) comparisons: routers only know physically connected neighbors and their link costs, uses distance vector algos. Bellman- ford equation: each local change is caused by local link costs changes and dv updates from neighbors. Ls: n=nodes, e=links, o(n*e) mgs sent: decentralized router, speed of convergence, robustness: Dv: exchange is between neighbors only, so convergence time is varied. Ls = o(n^2) for algo, o(n*e) msgs. Dv: convergence varies: problems include routing loops or count- to- infinity. Ls : nodes can advertise incorrect link cost, while each node computes only its own table. If we have 200 mil. Destinations, we can"t host these in our routing tables: basically, performs inter- as with other. We aggregate routers into regions of autonomous systems (as). Run intra- as routing with other routers in the same as.