ToChord:一种面向任务的结构化数据链信息服务发现算法  

ToChord: a Task-oriented Data Link Information Service Discovery Algorithm

作　　者：王阵[1] 彭来献[1] 赵文栋[1] 

机构地区：[1]解放军理工大学通信工程学院,南京210007

出　　处：《小型微型计算机系统》2015年第5期943-948,共6页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61201217)资助;中国博士后科学基金项目(2012M512085)资助

摘　　要：针对集中式数据链信息分发结构存在的抗毁性差、分发效率低的问题,根据数据链用户信息需求相对固定的特点,借鉴DHT的设计思想,提出了一种新的面向任务的结构化信息服务发现算法To Chord(Task-Oriented Chord).To Chord算法将单一物理节点扩展形成多个虚拟节点,并分别与信息需求相关联,缩短了信息发布的目的节点与潜在需求节点间的逻辑距离.另外,利用多张Finger表协同路由技术实现了发布与请求消息的快速路由,使得信息查找复杂度为O(1).仿真结果表明,该算法较Chord算法,减少了近20%的信息发布开销,降低了平均查找时延,并具有更好的可扩展性.To solve the low robustness and poor efficiency problems of centralized data link information distribution subsystem, with referred to DHT, a task-oriented data link information service discovery algorithm called ToChord was proposed, which was based on the fact that nodes＇ information needs were stable in data link systems. In ToChord, each physical node was extended to several virtual nodes according to its information needs. The logical distance between information publishing destination node and potential information needed nodes was shorted. The complexity of information lookup process isO （ 1 ）. In addition, within multi-Finger tables routing technology, the publish messages and query messages were routed more efficiently. Simulation results show that compared with Chord, the proposed algorithm eliminates about 20% costs of information publishing process, reduces the average time delay of queries and has better extendibility.

关 键 词：面向任务 数据链 CHORD ToChord 虚拟节点 多Finger表路由 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]