基于JXTA网络节点RPV表的JPDV算法

张安琳; 刘元博; 陈慧; 黄道颖; 丁冠铭; 谢兆贤

doi:10.3969/j.issn.2096-1553.2016.3.013

CN 41-1437/TS ISSN 2096-1553

基于JXTA网络节点RPV表的JPDV算法

张安琳 , 刘元博 , 陈慧 , 黄道颖 , 丁冠铭 , 谢兆贤

张安琳, 刘元博, 陈慧, 等. 基于JXTA网络节点RPV表的JPDV算法[J]. 轻工学报, 2016, 31(3): 93-98. doi: 10.3969/j.issn.2096-1553.2016.3.013

引用本文: 张安琳, 刘元博, 陈慧, 等. 基于JXTA网络节点RPV表的JPDV算法[J]. 轻工学报, 2016, 31(3): 93-98. doi: 10.3969/j.issn.2096-1553.2016.3.013

ZHANG An-lin, LIU Yuan-bo, CHEN Hui, et al. A JPDV algorithm based on peer's RPV of JXTA network node[J]. Journal of Light Industry, 2016, 31(3): 93-98. doi: 10.3969/j.issn.2096-1553.2016.3.013

Citation: ZHANG An-lin, LIU Yuan-bo, CHEN Hui, et al. A JPDV algorithm based on peer's RPV of JXTA network node[J]. Journal of Light Industry, 2016, 31(3): 93-98. doi: 10.3969/j.issn.2096-1553.2016.3.013

基于JXTA网络节点RPV表的JPDV算法

郑州轻工业学院计算机与通信工程学院, 河南郑州 450002;
河南财政金融学院现代教育技术中心, 河南郑州 451464

通讯作者: 黄道颖

基金项目: 河南省教育厅重点攻关项目(13A520379)
河南省重点攻关项目(132102210418)
中图分类号: TP311

A JPDV algorithm based on peer's RPV of JXTA network node

College of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China;
Modern Educational and Technological Center, He'nan Institude of Finance and Banking, Zhengzhou 451464, China

Corresponding author: HUANG Dao-ying,

Received Date: 2015-12-07
Available Online: 2016-05-15
CLC number: TP311

摘要: 针对基于JXTA平台的P2P网络底层网络拓扑失配,造成消息在网络传播过程中传输效率低下,网络资源浪费严重的问题,提出了一种基于JXTA网络节点集合点路由RPV表的时延统计向量(JPDV)算法.该算法中节点选择信誉度好、能力高的集合点作为界标节点,通过周期性对界标节点进行时延探测来构造时延统计向量并计算出距离值,然后与原逻辑邻居节点距离值比较,用距离值较小者更新节点路由表,使得在通信时选择距离自己较近的节点进行路径构造,从而提高与底层网络拓扑的匹配度.仿真实验结果表明,该算法可减少链接长度,提高检索效率,具有合理性和有效性.
- JXTA网络 /
- 拓扑匹配 /
- 集合点路由表 /
- JPDV算法
Abstract: In order to solve the P2P underlying network topology mismatch problem based on JXTA platform, which caused the lower transmission efficiency in the process of message transmission, severe waste of network resources, a statistical vector algorithm called JPDV (JXTA Rendezvous Peer-routing Algorithm Based on Delay Statistics Vector) based on the Peer's RPV (Rendezvous Peer-routing View) of JXTA was proposed. Node chose rendezvous with good creditworthiness and high capability as Landmarks node, and constructed delay statistics vector and got its distance by measured delay to Landmarks node, and then compared distance with old logical neighbor, modified its routing table with less distance. As the more near route path was chosen on communication to other peers, JPDV had better matching with the underlying network topology. Simulation experiment results showed that JPDV algorithm had the rationality and validity, which reduced the length of the peer link and improved the retrieval efficiency.
- JXTA network /
- topology adaptation /
- rendezvous peer-routing view /
- JPDV algorithm
1. [1]
  ZHU D,XU X Y,LIANG Y,et al.Research on overlay network topology-matching[J].Microcomputer applications, 2008(6):18.
2. [2]
  邱彤庆,陈贵海.一种令P2P覆盖网络拓扑相关的通用方法[J].软件学报,2007,18(2):381.
3. [3]
  孙建,郑明春,王战友.PSDV:一种无结构P2P网络的邻居选择策略[J].现代计算机,2009(12):29.
4. [4]
  连淑娟,孙波,魏云刚.结构化P2P网络拓扑匹配技术综述[J].计算机应用研究,2009,26(8):2807.
5. [5]
  黄敬磊,黄永忠,王磊.基于JXTA技术的网络计算模型[J].计算机工程与设计,2007,28(3):574.
6. [6]
  魏强,李建春,黄道颖,等.基于分区的JXTA网络搜索策略研究[J].郑州轻工业学院学报,2012,27(2):77.
7. [7]
  黄道颖,史利华,张安琳,等.JXTA网络路由机制研究[J].郑州轻工业学院学报(自然科学版),2013,28(2):87.
8. [8]
  HALEPOVIC E, DETERS R.The JXTA performance model and evaluation[J].Future generation computer systems,2005,21(3):377.
9. [9]
  史利华,张安琳,黄道颖,等.JXTA网络短链路由改进算法[J].火力与指挥控制,2013,38(7):168.
1. [1]
  费致根 , 鲁豪 , 宋晓晓 , 赵鑫昌 , 郭兴 , 肖艳秋 . 基于改进ResNet网络的烟丝输送带洁净度分类模型. 轻工学报, 2024, 39(5): 71-77. doi: 10.12187/2024.05.008

点击查看大图

计量

PDF下载量: 57
文章访问数: 1510
引证文献数: 0

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

张安琳, 刘元博, 陈慧, 等. 基于JXTA网络节点RPV表的JPDV算法[J]. 轻工学报, 2016, 31(3): 93-98. doi: 10.3969/j.issn.2096-1553.2016.3.013

引用本文: 张安琳, 刘元博, 陈慧, 等. 基于JXTA网络节点RPV表的JPDV算法[J]. 轻工学报, 2016, 31(3): 93-98. doi: 10.3969/j.issn.2096-1553.2016.3.013

ZHANG An-lin, LIU Yuan-bo, CHEN Hui, et al. A JPDV algorithm based on peer's RPV of JXTA network node[J]. Journal of Light Industry, 2016, 31(3): 93-98. doi: 10.3969/j.issn.2096-1553.2016.3.013

基于JXTA网络节点RPV表的JPDV算法

通讯作者: 黄道颖

郑州轻工业学院计算机与通信工程学院, 河南郑州 450002;
河南财政金融学院现代教育技术中心, 河南郑州 451464

收稿日期: 2015-12-07
网络出版日期: 2016-05-15

基金项目: 河南省教育厅重点攻关项目(13A520379)河南省重点攻关项目(132102210418)

关键词:

摘要: 针对基于JXTA平台的P2P网络底层网络拓扑失配,造成消息在网络传播过程中传输效率低下,网络资源浪费严重的问题,提出了一种基于JXTA网络节点集合点路由RPV表的时延统计向量(JPDV)算法.该算法中节点选择信誉度好、能力高的集合点作为界标节点,通过周期性对界标节点进行时延探测来构造时延统计向量并计算出距离值,然后与原逻辑邻居节点距离值比较,用距离值较小者更新节点路由表,使得在通信时选择距离自己较近的节点进行路径构造,从而提高与底层网络拓扑的匹配度.仿真实验结果表明,该算法可减少链接长度,提高检索效率,具有合理性和有效性.

English Abstract

A JPDV algorithm based on peer's RPV of JXTA network node

Corresponding author: HUANG Dao-ying,

College of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China;
Modern Educational and Technological Center, He'nan Institude of Finance and Banking, Zhengzhou 451464, China

Received Date: 2015-12-07
Available Online: 2016-05-15

Abstract: In order to solve the P2P underlying network topology mismatch problem based on JXTA platform, which caused the lower transmission efficiency in the process of message transmission, severe waste of network resources, a statistical vector algorithm called JPDV (JXTA Rendezvous Peer-routing Algorithm Based on Delay Statistics Vector) based on the Peer's RPV (Rendezvous Peer-routing View) of JXTA was proposed. Node chose rendezvous with good creditworthiness and high capability as Landmarks node, and constructed delay statistics vector and got its distance by measured delay to Landmarks node, and then compared distance with old logical neighbor, modified its routing table with less distance. As the more near route path was chosen on communication to other peers, JPDV had better matching with the underlying network topology. Simulation experiment results showed that JPDV algorithm had the rationality and validity, which reduced the length of the peer link and improved the retrieval efficiency.

参考文献 (9) 相关文章 (1)