网路层通讯协定75.pptVIP

第四章 網路層通訊協定;Protocol Stack;網路層的特色;網路層的主要功能;Service Model;Virtual Circuit;Virtual Circuit;Datagram Network;Network Service Model;Network Service Model;Routing;Routing Algorithm的分類;Link-State Algorithm (Global);Dijkstra’s Algorithm;Dijkstra’s Algorithm (Example);Dijkstra’s Algorithm;Dijkstra’s Algorithm: 時間複雜度;Distance Vector Algorithm (decentralized);Distance Vector Algorithm: Distance Table;Distance Vector Algorithm: Distance Table - Routing Table;Distance Vector Algorithm;Distance Vector Algorithm;8 loop 9 wait (until I see a link cost change to neighbor V 10 or until I receive update from neighbor V) 11 12 if (c(X,V) changes by d) 13 /* change cost to all dests via neighbor v by d */ 14 /* note: d could be positive or negative */ 15 for all destinations y: D (y,V) = D (y,V) + d 16 17 else if (update received from V wrt destination Y) 18 /* shortest path from V to some Y has changed */ 19 /* V has sent a new value for its min DV(Y,w) */ 20 /* call this received new value is newval */ 21 for the single destination y: D (Y,V) = c(X,V) + newval 22 23 if we have a new min D (Y,w)for any destination Y 24 send new value of min D (Y,w) to all neighbors 25 26 forever ;Distance Vector Algorithm;Distance Vector Algorithm;Distance Vector: link cost changes;Distance Vector: link cost changes;Distance Vector: Poison reverse;Hierarchical Routing;Intra-AS and Inter-AS routing;Intra-AS and Inter-AS routing;網路層通訊協定;IP addressing;IP addressing;IP addressing;IP addressing;IP addressing;IP addressing;IP addressing;傳送IP封包的過程;傳送IP封包的過程;傳送IP封包的過程;傳送IP封包的過程;IP封包格式;IP封包切割與重組;IP封包切割與重組;ICMP: Internet Control Message Protocol;Routing in the Internet;Internet AS Hierarchy;Intra-AS Routing;RIP (Routing Information Protocol);RIP (Routing Information Protocol);RIP處理連結(Link)變化的方式;管理RIP的Routing Table;RIP Table的範例;OSPF (Open Shortest Path First);OSPF (Open Shortest Path First);Hierarchical OSPF;IGRP (Interior