TCPIP协议原理ChapterIP组播PPT学习教案_第1页
TCPIP协议原理ChapterIP组播PPT学习教案_第2页
TCPIP协议原理ChapterIP组播PPT学习教案_第3页
TCPIP协议原理ChapterIP组播PPT学习教案_第4页
TCPIP协议原理ChapterIP组播PPT学习教案_第5页
已阅读5页,还剩56页未读 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

1、会计学1TCPIP协议原理协议原理Chapter IP组播组播单播组播广播第1页/共61页共有 90 个主机接收视频节目R1R3R4R2视频服务器 M30 个30 个90 个30 个30 个30 个30个第2页/共61页组播组成员共有 90 个R1R3R4R2视频服务器 M组播1 个组播1 个1 个1 个1 个组播1 个1 个发送 1 次组播复制第3页/共61页第4页/共61页第5页/共61页Example: Audio StreamingAll clients listening to the same 8-Kbps audio00.20.40.60.8TrafficMbps12040608

2、0100Number of ClientsMulticastUnicastMulticast Advantages第6页/共61页第7页/共61页Corporate BroadcastsDistance LearningTrainingVideo ConferencingWhiteboard/CollaborationMulticast File TransferData and File ReplicationReal-Time Data DeliveryFinancialVideo-On-DemandLive TV and Radio Broadcast to the Desktop第8页

3、/共61页IP组播编址机制组播编址机制组成员关系协议组成员关系协议组播路由协议组播路由协议组播体系结构组播体系结构第9页/共61页224.0.0.255238.255.255.255239.255.255.255224.0.0.0本地管理组播地址本地管理组播地址用户组播地址用户组播地址保留组播地址保留组播地址第10页/共61页第11页/共61页0000000000000001010111100111008162431D 类类 IP 地址地址这 5 位不使用48 位以太网地址0 1 0 0 5 E表示多播最低 23 位来自 D 类 IP 地址第12页/共61页第13页/共61页第14页/共61页

4、128.56.24.34135.27.74.52130.12.14.56130.12.14.43组播组226.15.37.123IGMPIGMPIGMPIGMPR1R4R3R2第15页/共61页第16页/共61页第17页/共61页第18页/共61页v 报文类型:查询,成员报告,退出报告。报文类型:查询,成员报告,退出报告。第19页/共61页第20页/共61页H2H2224.1.1.1Report1.1.1.1H1H31.1.1.101.1.1.111.1.1.12rtr-aIGMPv2Joining a Group第21页/共61页Query1.1.1.1IGMPv21.1.1.101.1.1

5、.111.1.1.12224.1.1.1Report224.1.1.1SuppressedX224.1.1.1SuppressedXH1H2H3IGMPv2Maintaining a Group第22页/共61页IGMPv21.1.1.11.1.1.2H1H2H31.1.1.101.1.1.111.1.1.12Initially, all routers send out a queryQueryQueryRouter with the lowest IP address is elected querierIGMPQuerierOther routers become non-querier

6、sIGMPNon-Querierrtr-artr-bIGMPv2Querier Election第23页/共61页Leave to224.0.0.2224.1.1.1Router sends Group-Specific QueryGroup-SpecificQuery to 224.1.1.1A remaining member host sends reportReport to224.1.1.1224.1.1.1Group remains activeH11.1.1.101.1.1.1rtr-aH31.1.1.121.1.1.11H2H2IGMPv2Leaving a Group第24页

7、/共61页Last host leaves group; sends Leave messageLeave to224.0.0.2224.1.1.1Router sends Group-Specific QueryGroup-SpecificQuery to 224.1.1.1No report is receivedGroup times outH21.1.1.1rtr-aH11.1.1.101.1.1.121.1.1.11H3H3IGMPv2Leaving a Group第25页/共61页在转发时,组播路由器使用数据报的源地址和目在转发时,组播路由器使用数据报的源地址和目的地址的地址第26

8、页/共61页第27页/共61页第28页/共61页第29页/共61页Source151.10.3.21Multicast Distribution TreeExample: RPF CheckingMulticast PacketsRPF Checks fail Packets arrived on wrong interface.第30页/共61页RPF Check SucceedsRPF Check Succeeds! Unicast Route TableNetwork Interface151.10.0.0/16S1198.14.32.0/24S0204.1.16.0/24E0E0S1S

9、0S2Multicast packet fromsource 151.10.3.21Packet arrived on right interface!S1Forward out of all outgoing interfaces.(i. e. down the distribution tree)RPF Check (cont.)第31页/共61页RPF Check Fails!RPF Check FailsPacket arrived on wrong interface!E0S1S0S2Multicast acket fromsource 151.10.3.21XDiscard pac

10、ket! Unicast Route TableNetwork Interface151.10.0.0/16S1198.14.32.0/24S0204.1.16.0/24E0S1RPF Check第32页/共61页第33页/共61页第34页/共61页第35页/共61页Shortest-Path or Source Distribution TreeReceiver 1BEADFSource 1Notation: (S, G) S = Source G = GroupCReceiver 2Source 2Shortest-Path Trees第36页/共61页Shortest-Path or S

11、ource Distribution TreeReceiver 1BEADFSource 1Notation: (S, G) S = Source G = GroupCReceiver 2Source 2The Tree is per SOURCEShortest-Path Trees第37页/共61页第38页/共61页第39页/共61页Shared Distribution TreeReceiver 1BEADFNotation: (*, G) * = All Sources G = GroupCReceiver 2(RP)(RP) PIM Rendezvous PointShared Tr

12、eeShared Distribution Tree第40页/共61页Shared Distribution TreeReceiver 1BEADFNotation: (*, G) * = All Sources G = GroupSource 1CReceiver 2Source 2Source Tree(RP)(RP) PIM Rendezvous PointShared TreeShared Distribution Tree第41页/共61页第42页/共61页第43页/共61页第44页/共61页第45页/共61页Initial FloodingSourceReceiverMultica

13、st Packets(S, G) state created inevery router in the network!PIM-DM Flood and Prune第46页/共61页Pruning Unwanted TrafficSourceReceiverMulticast PacketsPrune MessagesPIM-DM Flood and Prune (cont.)第47页/共61页SourceResults after PruningReceiverMulticast PacketsFlood and Prune processrepeats every three minut

14、es!(S, G) state still exists inevery router in the network!PIM-DM Flood and Prune (cont.)第48页/共61页第49页/共61页ReceiverRP(*, G) JoinShared Tree(*, G) State created onlyalong the Shared Tree.PIM-SM Shared Tree Join第50页/共61页ReceiverRP(S, G) JoinSourceShared Tree(S, G) Register(unicast)Source Tree(S, G) St

15、ate created onlyalong the Source Tree.Traffic FlowPIM-SM Sender Registration第51页/共61页ReceiverRPSourceShared TreeSource TreeRP sends a Register-Stop back to the first-hop router to stop the Register process.(S, G) Register-Stop(unicast)Traffic Flow(S, G) Register(unicast)(S, G) traffic begins arrivin

16、g at the RP via the Source tree.PIM-SM Sender Registration (cont.)第52页/共61页ReceiverRPSourceShared TreeSource TreeTraffic FlowSource traffic flows nativelyalong SPT to RP.From RP, traffic flows downthe Shared Tree to Receivers.PIM-SM Sender Registration (cont.)第53页/共61页ReceiverRP(S, G) JoinSourceSour

17、ce TreeShared TreeLast-hop router joins the Source Tree.Additional (S, G) State is created along new part of the Source Tree.Traffic FlowPIM-SM SPT Switchover第54页/共61页ReceiverRPSourceSource TreeShared Tree(S, G)RP-bit PruneTraffic begins flowing down the new branch of the Source Tree.Additional (S,

18、G) State is created along along the Shared Tree to prune off (S, G) traffic.Traffic FlowPIM-SM SPT Switchover第55页/共61页ReceiverRPSourceSource TreeShared Tree(S, G) Traffic flow is now pruned off of the Shared Tree and is flowing to the Receiver via the Source Tree.Traffic FlowPIM-SM SPT Switchover (cont.)第56页/共61页ReceiverRPSourceSource TreeShared Tree(S, G) traffic flow is no longer needed by the RP, so it Prunes

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

评论

0/150

提交评论