e-计算机网络基础3-IP路由.pptVIP

  • 4
  • 0
  • 约6.13千字
  • 约 19页
  • 2017-08-17 发布于河南
  • 举报
Routing on Internet(1) How is an IP Packet traverse over the Internet? Routing on Internet(2) How is an IP Packet is forwarded to its destination? Routing on Internet(3):Router Routing on Internet(4-1):Forwarding Table Routing on Internet(4-2) How an IP Packet is forwarded by a Router? Routing on Internet(4-3): Default Route Routing on Internet(4-4):Forwarding Algorithm IP分组转发算法:上机作业 Example#1:Write the correct forwarding table for each router( including the default route) Example#2: Determine the neighbor topology via forwarding table. Example#3(Route Aggregation): How few(!) route items are needed to correctly represent the topology? Example#4(Route Aggregation): Order really matters! Example#5: Multi-routes / route backup Principles for Multi-routes Scheduling For Reliability: Master/Slave Backup For Traffic Balance: Scheduling packets according (say) bandwidth or traffic load over different candidate routes( between two hosts) Dynamic Route Discovery(1): RIP Route Vector Principles How does RIP work on each router: 1)Initial forwarding table is setup to (only) indicate directly connected subnets. 2)Each router periodically multicasts its current forwarding table to its neighbors; 3) Each router tries to find/extract new route information from its neighbors’ reports. RIP algorithm(no fault detections) /* T是来自邻接路由器R的路由报告; 本路由器是R0 , 其当前路由表是T0 */ Vector_Distance_Shortest_Route_Discover(R, T) { for( T的每一项(Nk , Dk)) { if(T0中不存在形如(Nk ,﹒,﹒)的表项) { insert(T0, (Nk , R, Dk+1)); /* R0 发现了一个新目标网络及其路由*/ continue; } if(T0中存在形如(Nk , R, D)的表项 D≠Dk+1) { /* R0 到目标网络N的路由的距离发生了变化, R0无条件地接受这一变化[1] */ 将T0的表项(Nk , R, D)更新为(Nk , R, Dk+1); continue; } if(T0中存在形如(Nk , Rk, D)的表项 Dk +1D) { /* 这时一定R≠Rk */ /* R0发现了到达目标网络Nk的距离更短的路由*/ 将T0的表项(Nk , Rk, D)更新为(Nk , R

文档评论(0)

1亿VIP精品文档

相关文档