检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]娄底职业技术学院,娄底417000
出 处:《科学技术与工程》2010年第11期2751-2753,2757,共4页Science Technology and Engineering
摘 要:网络层任播算法的研究是解决IPv6网络中网络带宽发展跟不上视频服务发展速度的一条主要途径。为此提出了一种基于最小代价任播路由算法,改进了任播路由过程中获取最优服务器的方式。当网络中副本较多时能有效减少视频服务器的负载,提高服务效率。实验结果表明,在相同副本数和访问连接数前提下,该算法比SimpleOptimiser算法减少了服务器的访问量,更适合于视频服务应用。The network layer anycast algorithm is a main way to let the network bandwidth of the development of IPv6 network keep up the developing speed of video services. It's for this reason that I come up with an anycast routing algorithm which based on minimum cost. This algorithm improves the way of obtaining the best server in the process of anycast routing and it effectively reduces the load on video servers and improves the efficiency of service when there are more copies in the network. Experimental results show that under the premise of the same number of copies and connected reference, the algorithm has less visit capacity of the server than the simple optimiser algorithm and is more suitable for video s^rvices.
分 类 号:TN941.1[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.251.36