检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]哈尔滨理工大学网络信息中心,哈尔滨150080 [2]哈尔滨理工大学计算机科学与技术学院,哈尔滨150080
出 处:《计算机工程》2009年第18期105-107,110,共4页Computer Engineering
摘 要:针对P2P流媒体系统现有节点选择方法仅在请求节点执行且功能单一的问题,提出超级节点和请求节点双端协作的节点选择机制。在超级节点端,根据路由相似的思想提出面向网络拓扑聚集性的候选节点选择算法。在请求节点端,综合考虑系统动态性与异构性,提出基于枚举的服务节点选择算法,保证流服务质量,融入动态冗余思想以提高健壮性。仿真结果表明,该机制能更好地改进系统的网络拓扑聚集性,提高流服务质量和健壮性。In P2P media streaming system, the existing peer selection methods only focus on the implementation of the requesting peer, and the function is unitary. In order to resolve these problems, a double-ended cooperation peer selection strategy is proposed, which is between super peer and requesting peer. At the super peer, an algorithm of selecting candidate peers based on routing resemblance is proposed, which is topology conglomeration oriented. At the requesting peer, considering the dynamic and heterogeneity of the system, an algorithm of selecting service peers based on enumeration is proposed, which can guarantee the streaming QoS and meanwhile improve the robust by adding the thought of dynamic redundancy. Simulation results show that the strategy can improve the topology conglomeration, streaming QoS and robust much better.
关 键 词:P2P流媒体 节点选择 双端协作 路由相似 枚举 动态冗余
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.119.103.40