| 基于网络拓扑的CDN内容路由技术 |
| |
| 引用本文： | 王娟,赵问道.基于网络拓扑的CDN内容路由技术[J].江南大学学报(自然科学版),2004,3(5):441-444. |
| |
| 作者姓名： | 王娟 赵问道 |
| |
| 作者单位： | 浙江大学,信息与电子工程学系,浙江,杭州,310027 |
| |
| 基金项目： | 国家863项目(2001AA121043)资助课题. |
| |
| 摘 要： | 围绕内容分发网络内容路由技术,给出了两种基于网络拓扑的算法——“简单算法”和“拓扑分割算法”,确保用户的Web请求被指向距离其最近的和最可用的高速缓存服务器．算法以巡回时间限制服务器性能,采用离散系统仿真方法进行仿真．详细讨论了两种算法的实现,并分析了各系统参数对算法性能的影响．其中“拓扑分割算法”借鉴了网络距离图的思想,从而提高了响应速度．
|
| 关 键 词： | 内容路由 网络距离图 网络分割 |
| 文章编号： | 1671-7147(2004)05-0441-04 |
Content Routing Algorithms Achieving Network Proximity in Content Delivery Networks |
| |
| WANG Juan,ZHAO Wen-dao.Content Routing Algorithms Achieving Network Proximity in Content Delivery Networks[J].Journal of Southern Yangtze University:Natural Science Edition,2004,3(5):441-444. |
| |
| Authors: | WANG Juan ZHAO Wen-dao |
| |
| Abstract: | 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. |
| |
| Keywords: | content routing network distance map network segment |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
