ComNET中的组播问题的分析与研究  

Analysis and research of the multicast problem in ComNET

作　　者：赵小明[1] 

机构地区：[1]云南机电职业技术学院工业信息技术系,云南昆明650203

出　　处：《微型机与应用》2014年第11期52-54,59,共4页Microcomputer & Its Applications

摘　　要：P2P网络广播使用广度优先的泛洪方式,导致对等点的处理负荷过大,网络流量激增,容易造成网络阻塞。在分析ComNET及组播的基础上,提出设计一个分布式算法,使一对多的消息传递变得高效而不含冗余,以此来解决ComNET中的组播问题。The P2P network broadcast adopts breadth-first manner, which leads to large flooding point load, the increase of network traffic, and is likely to cause network congestion. On the basis of ComNET and muhicast analysis, the paper proposes a distributed algorithm design, so that a one-to-many messaging becomes efficient while excluding redundancy, in order to solve the problem of multicast in ComNET.

关 键 词：P2P 组播 ComNET 分布式算法 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]