《计算机网络——自顶向下方法与Internet特色》幻灯片Lecture46.pptVIP

Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing 网络层广播和多播(组播)的路由选择 因特网的TCP,IP协议实际上解决的是点对点的数据传输，也称为单播(unicast) 在网络中存在大量的应用需要解决一个或多个发送方须将数据发送到所有或一组接收方，例如： 一个网络软件的升级 流媒体的发送（网上实况转播） WWW的镜像站点的更新 此类应用的抽象称为多播或组播(Multicast) Broadcast Routing Deliver packets from source to all other nodes Source duplication is inefficient: In-network duplication Flooding: when node receives brdcst pckt, sends copy to all neighbors Problems: cycles broadcast storm Controlled flooding: node only brdcsts pkt if it hasn’t brdcst same packet before Node keeps track of pckt ids already brdcsted Or reverse path forwarding (RPF): only forward pckt if it arrived on shortest path between node and source Spanning tree No redundant packets received by any node Spanning Tree First construct a spanning tree Nodes forward copies only along spanning tree Spanning Tree: Creation Center node Each node sends unicast join message to center node Message forwarded until it arrives at a node already belonging to spanning tree Multicast Routing: Problem Statement Goal: find a tree (or trees) connecting routers having local mcast group members tree: not all paths between routers used source-based: different tree from each sender to rcvrs shared-tree: same tree used by all group members Approaches for building mcast trees Approaches: source-based tree: one tree per source shortest path trees reverse path forwarding group-shared tree: group uses one tree minimal spanning (Steiner) center-based trees 因特网的多播路由选择 DVMRP:Distance Vector Routing Protocol MOSPF:Multicast Open Shortest First CBT:Core-Based Trees PIM:Protocol Independent Multicast 现实的问题是，因特网中具有多播功能的路由器是极少数，如果某个多播路由器处于“孤岛”状态，它将如何进行工作 用“隧道方案”加以解决(p215) 因特网的多播路由选择 DVMRP:在因特网中得到广泛应用 使