摘要： 在协议无关组播稀松模型中,作为共享树的根,数据包都从源点直接发送到,再由沿共享树-(PIM-SM)RP(Rendezvous Point)RPRP发送到各接收点。在一个组播域里,的选择十分重要。文章提出了一种能反映网络拓扑的方法。在一个连通图中,从一个点出发到所有点RP所经过的最短路径是经过其到所有点的树,而树的权和都是一样的,不同的选择仅是决定于各源点到的代价之DIJKSTRADIJKSTRARPRP和,即选择网络的大约的中心为。""RP

关键词: 组播, 协议无关组播稀松模型, 聚合点选择, 网络拓扑

Abstract: In current widely used protocol independent multicast-sparse mode,RP(Rendezvous Point)is the root of the shared tree,datagram is sent from source to RP and forwarded along the shared tree. So in a multicast region, the choice of RP is very important. We discuss a way that relates the topology of the network.The way a point to all the other points is its Dijkstra tree in a weighted linked graph,but all Dijkstra trees have the same sum of weight, so we choose the most central point. ;;;

中图分类号: 

• TP393