华北水利水电大学信息工程学院计算机网络课件 Lecture12.pptVIP

Distance Vector Routing Algorithm iterative: continues until no nodes exchange info. self-terminating: no “signal” to stop asynchronous: nodes need not exchange info/iterate in lock step! distributed: each node communicates only with directly-attached neighbors Distance Table data structure each node has its own row for each possible destination column for each directly-attached neighbor node example: in node X, for dest. Y via neighbor Z: Distance Table: example Distance table gives routing table Distance Vector Routing: overview Iterative, asynchronous: each local iteration caused by: l