NSLect09.ppt

第9讲 路由与组播 Routing modules in ns-2 讲课内容 单播及仿真方法 组播协议 仿真元件 组播仿真示例 1.1 Static Dijkstra’s SPF 1.1 Static Dijkstra’s SPF 1.1 Static Dijkstra’s SPF 1.2 Multipath routing Codes brief 2. Properties of multicasting The most complex service, vs uni-casting and broad-casting Underlined recipients can be over one million Group management 2.1 Internet Group Management Protocol (IGMP) It lets all the systems on a physical network know which hosts currently belong to which multicast groups. Format of datagram is similar to ICMP with constant length, IP header + IGMP message (8 bytes). Support joining, querying and reporting functions. An example (v1. RFC 1112) The router is asking each host to identify each group on that interface. 2.2 Flood and Prune Protocols known as reverse-path multicast algorithm. DVMRP (Distance Vector Multicast Routing Protocol) and Dense-mode PIM (Protocol Independent Multicast). 2.3 Center-based Trees To map the multicast group address to a particular unicast address of a router, and build explicit distribution trees centered around this particular router. Core-Based Trees (CBT), Sparse-mode PIM (SM-PIM) and the Border Gateway Multicast Protocol (BGMP). Formation of a CBT bidirectional shared tree Sparse-Mode PIM Summary of multicast routing Dense mode DVMRT, MOSFP, PIM-DM Sparse mode CBT, PIM-SM Scalable and reliable multicast (SRM) S.Floyd etal ’95, by ns-2 2.4 SRM, motivation SRM scheme Randomize NACKs (request repairs) All traffic including request repairs and repairs are multicast A repair can be sent by any node that heard the request A node suppresses its request repair if another node has just sent a request repair for the same data item A node suppresses a repair if another node has just sent the repair 2.4 SRM, an illustration 3.1 Enable mcast in Nodes 3.2 CtrMcast, a pure OTcl class Routing computations CtrMcactComp::compute-branch 4.1 Example, PIM-SM Joining schedules $ns at 1.1 $n7 join-group ..” $ns at 1.3 $n1 join-group ..” $ns at 2.0