摘要
能够支持负载均衡的ID分配方法是实现与维护DHT overlay的基础,已有常数度DHT多采用纯集中式或纯分布式方法,不能很好地解决拓扑信息维护开销与拓扑平衡程度这一矛盾.针对这一不足,在分析拓扑中通用树结构的基础上,本文提出了基于内在结构Routing Forest的ID分配方法RFIDAM,通过规律性地聚合局部平衡信息来指导新节点的加入以实现拓扑平衡.实验表明,通过引入少量维护与路由开销,该方法使得拓扑达到节点ID长度差小于2的最优平衡目标.
A Load Balancing-Supported ID assignment method is the foundation to implement and maintain DHT overlays,realized constant degree DHTs usually use simple pure centralized or distributed ID management strategies,which cannot resolve the contradiction between cost of maintaining topologies′ information and topologies′ balance.Analyzing the universal tree structures in the topologies,an ID Assignment method RFIDAM based on the internal structure Routing Forest is proposed,which regularly aggregates local balancing information to guide new nodes′ joining for overall balance.The experimental results show,with low maintenance and routing message overhead,the system′s loading balance is efficiently ensured with the length of IDs differ by at most 2.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2010年第11期2649-2654,共6页
Acta Electronica Sinica
基金
国家973重点基础研究发展计划(No.2005CB321801)
国家863高技术研究发展计划(No.2009AA01Z142)
全国优秀博士学位论文作者专项资金(No.200953)
国家自然科学基金(No.60703072
No.60903205)
高等学校博士学科点专项科研基金(No.20094307110008)
