助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   network distance map 的翻译结果: 查询用时:0.007秒
图标索引 在分类学科中查询
所有学科
互联网技术
更多类别查询

图标索引 历史查询
 

network distance map
相关语句
  网络距离图
     "The Segment Algorithm" takes Network Distance Map into account, which can greatly promote reaction speed.
     其中"拓扑分割算法"借鉴了网络距离图的思想,从而提高了响应速度.
短句来源
  相似匹配句对
     NETWORK
     网络
短句来源
     Distance
     距离
短句来源
     NETWORK
     网络技术
短句来源
     Evaluation on the Adults Distance Network Study
     成人远程网络学习中的学习评价
短句来源
     Application of P2P in Distance Education Network
     P2P技术在远程教育系统开发中的应用研究
短句来源
查询“network distance map”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


The paper presents two algorithms about CDN content routing algorithm: "the Simple Algorithm" and "the Segment Algorithm", which can achieve network proximity. The two algorithms limit the performance of servers by round trip time and are simulated under the method of Discrete System Simulation. The paper also discusses implementation of the two algorithms in detail and analyzes the effect of algorithm performance according to system parameters. "The Segment Algorithm" takes Network Distance Map...

The paper presents two algorithms about CDN content routing algorithm: "the Simple Algorithm" and "the Segment Algorithm", which can achieve network proximity. The two algorithms limit the performance of servers by round trip time and are simulated under the method of Discrete System Simulation. The paper also discusses implementation of the two algorithms in detail and analyzes the effect of algorithm performance according to system parameters. "The Segment Algorithm" takes Network Distance Map into account, which can greatly promote reaction speed.

围绕内容分发网络内容路由技术,给出了两种基于网络拓扑的算法———"简单算法"和"拓扑分割算法",确保用户的Web请求被指向距离其最近的和最可用的高速缓存服务器.算法以巡回时间限制服务器性能,采用离散系统仿真方法进行仿真.详细讨论了两种算法的实现,并分析了各系统参数对算法性能的影响.其中"拓扑分割算法"借鉴了网络距离图的思想,从而提高了响应速度.

The paper described a hybrid P2P model with super-peer that is oriented on the special P2P applications, such as grid computing and cooperation work. The K-means algorism is utilized to cluster the nodes in the network in this model, and every cluster is a virtual sub network. The main function of super-peers is responsible for the registration, logout of the new peers, maintaining the index and network distance map. The model does not only improve the flexibility of the distributed computing platform,...

The paper described a hybrid P2P model with super-peer that is oriented on the special P2P applications, such as grid computing and cooperation work. The K-means algorism is utilized to cluster the nodes in the network in this model, and every cluster is a virtual sub network. The main function of super-peers is responsible for the registration, logout of the new peers, maintaining the index and network distance map. The model does not only improve the flexibility of the distributed computing platform, but also reduces the request messages. The model is conducive to distributed applications. The result of simulated test is described in the end of the paper that showed the efficiency of using K-means algorism to clustering network hosts.

本文面向网格计算、协同工作等特定P2P应用,提出了一种基于超节点的P2P混合网络模型。该模型的主要特点是采用K-means聚类算法对网络中的节点进行聚类,从而得到分组虚拟子网,由各子网内的超节点负责临近节点的加入与注销。该模型既克服P2P集中模型伸缩性不强,分散性P2P模型发送消息量大等缺点,又可以灵活地组织对等节点进行网格计算或组内协同工作等分布式应用。文章最后使用仿真实验表明K-means算法在网络节点聚类中的有效性。

>=The paper described a hybrid P2P model with super-peer that is oriented on the special P2P applications, such as grid computing and cooperation work. The K-means algorism is utilized to cluster the nodes in the network in this model, and every cluster is a virtual sub network. The main function of super-peers is responsible for the registration, logout of the new peers, maintaining the index and network distance map. The model does not only improve the flexibility of the distributed computing platform,...

>=The paper described a hybrid P2P model with super-peer that is oriented on the special P2P applications, such as grid computing and cooperation work. The K-means algorism is utilized to cluster the nodes in the network in this model, and every cluster is a virtual sub network. The main function of super-peers is responsible for the registration, logout of the new peers, maintaining the index and network distance map. The model does not only improve the flexibility of the distributed computing platform, but also reduces the request messages. The model is conducive to distributed applications. The result of simulated test is described in the end of the paper that showed the efficiency of using K-means algorism to clustering network hosts.

本文面向网格计算、协同工作等特定P2P应用,提出了一种基于超节点的P2P混合网络模型。该模型的主要特点是采用K-means聚类算法对网络中的节点进行聚类,从而得到分组虚拟子网,由各子网内的超节点负责临近节点的加入与注销。该模型既克服P2P集中模型伸缩性不强,分散性P2P模型发送消息量大等缺点,又可以灵活地组织对等节点进行网格计算或组内协同工作等分布式应用。文章最后使用仿真实验表明K-means算法在网络节点聚类中的有效性。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关network distance map的内容
在知识搜索中查有关network distance map的内容
在数字搜索中查有关network distance map的内容
在概念知识元中查有关network distance map的内容
在学术趋势中查有关network distance map的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社