| 基于主成分分析的对等网络邻近标识符选择 |
| |
| 引用本文： | 蒋俊杰,汪为农.基于主成分分析的对等网络邻近标识符选择[J].上海交通大学学报,2007,41(1):56-59,65. |
| |
| 作者姓名： | 蒋俊杰 汪为农 |
| |
| 作者单位： | 1. 上海交通大学,网络中心,上海,200030;上海贝尔阿尔卡特股份有限公司,上海,200070
2. 上海交通大学,网络中心,上海,200030 |
| |
| 摘 要： | 保持对等网络与底层网络的拓扑良好契合是保障对等网络性能的重要条件.以对等网络系统CAN为基础,将底层网络拓扑建模为高维欧氏空间,使用主成分分析法将底层网络拓扑映射到低维CAN逻辑空间,从而根据节点在底层网络中的位置决定其在对等网络中的标识符.实验结果表明,该算法能够有效减少对等网络链路延时,提高路由效率.
|
| 关 键 词： | 对等网络 分布式哈希表 主成分分析 邻近标识符选择 |
| 文章编号： | 1006-2467（2007）01-0056-04 |
| 修稿时间： | 2005-12-07 |
The Proximity Identifier Selection Based on PCA for Peer-to-Peer Networks |
| |
| JIANG Jun-jie,WANG Wei-nong.The Proximity Identifier Selection Based on PCA for Peer-to-Peer Networks[J].Journal of Shanghai Jiaotong University,2007,41(1):56-59,65. |
| |
| Authors: | JIANG Jun-jie WANG Wei-nong |
| |
| Institution: | 1. Network Center, Shanghai Jiaotong Univ. , Shanghai 200030, China 2. Alcatel Shanghai Bell Co. Ltd. , Shanghai 200070, China |
| |
| Abstract: | It is desirable to make the topology of P2P networks match that of underlying network.This paper models the underlying network topology as an Euclidean space and uses PCA to map this higher dimensional space to the lower dimensional logical space of CAN.So a peer's identifier is determined by its location in underlying network.The experimental results indicate that this algorithm can reduce the overlay link latency and improve P2P routing performance significantly. |
| |
| Keywords: | peer-to-peer distributed hash table principal component analysis proximity identifier(selection) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
