检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄泳翔[1] 钱德沛[1,2] 伍卫国[1] 刘涛[1]
机构地区:[1]西安交通大学电子与信息工程学院,西安710049 [2]北京航空航天大学中德软件技术研究所,北京100085
出 处:《西安交通大学学报》2009年第6期1-4,32,共5页Journal of Xi'an Jiaotong University
基 金:国家自然科学基金资助项目(60673180);国家高技术研究发展计划资助项目(2006AA01A109)
摘 要:为了解决采用一致性随机成员算法进行节点管理而导致覆盖网(overlay)系统不具备QoS感知能力的问题,设计并实现了一种应用非一致性随机成员算法的overlay构建协议.在协议框架中,构成overlay的节点选择某一节点为邻居节点的概率与该节点的输出带宽成正比,这样在传输可伸缩编码视频(SVC)数据时,可避免出现上游节点丢弃部分媒体数据而降低下游节点接收质量的情况.测试结果表明,与一致性随机成员算法及多树算法相比,所提协议构建的overlay可以更加有效地支持SVC数据的传输.To solve the problem of the QoS-awareness inability of the overlay that is constructed by uniform random membership management, a non-uniform random membership algorithm is proposed and implemented. Individual peer in the proposed mechanism chooses its neighbors with a probability that is proportional to the out-bandwidth of target peers, and hence the overlay constructed by the algorithm can avoid the situation that downstream peers degrade their receiving QoS that is caused by the upstream peers for adapting to the variation of network bandwidth in discarding part of non-key media data as transferring scalable video coding (SVC). Experiment results and comparisons with the uniform random membership algorithm and the multi-tree algorithm show that the proposed protocol can greatly improve the utilization of peers downlink capacity, and thus more efficiently support the transfer of SVC on the overlay system.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249