计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2013年
7期
67-72
,共6页
邱清%王意洁%马行空%李小勇
邱清%王意潔%馬行空%李小勇
구청%왕의길%마행공%리소용
数据分发%应急场景%动态组播树%层次化分簇%覆盖网%前缀匹配
數據分髮%應急場景%動態組播樹%層次化分簇%覆蓋網%前綴匹配
수거분발%응급장경%동태조파수%층차화분족%복개망%전철필배
data dissemination%emergency environment%dynamic multicast tree%hierarchical clustering%overlay%prefix matching
已有的数据分发方法多侧重于某方面的优化,不能充分权衡数据分发的可靠性与高效性,难以满足应急场景下可靠快速分发数据的要求。为此,提出一种基于动态组播树的可靠数据分发方法。根据节点间延迟信息对节点进行层次化分簇和编号,以此构建层次化覆盖网,根据节点编号采用基于动态组播树的前缀匹配路由。理论分析和实验结果表明,与MEDYM方法相比,即使短时间内系统中产生大量消息,该方法仍能够可靠快速地分发数据,系统开销较小。
已有的數據分髮方法多側重于某方麵的優化,不能充分權衡數據分髮的可靠性與高效性,難以滿足應急場景下可靠快速分髮數據的要求。為此,提齣一種基于動態組播樹的可靠數據分髮方法。根據節點間延遲信息對節點進行層次化分簇和編號,以此構建層次化覆蓋網,根據節點編號採用基于動態組播樹的前綴匹配路由。理論分析和實驗結果錶明,與MEDYM方法相比,即使短時間內繫統中產生大量消息,該方法仍能夠可靠快速地分髮數據,繫統開銷較小。
이유적수거분발방법다측중우모방면적우화,불능충분권형수거분발적가고성여고효성,난이만족응급장경하가고쾌속분발수거적요구。위차,제출일충기우동태조파수적가고수거분발방법。근거절점간연지신식대절점진행층차화분족화편호,이차구건층차화복개망,근거절점편호채용기우동태조파수적전철필배로유。이론분석화실험결과표명,여MEDYM방법상비,즉사단시간내계통중산생대량소식,해방법잉능구가고쾌속지분발수거,계통개소교소。
Existing dissemination methods merely focus on single optimization objective and fail to ensure reliability and efficiency simultaneously, this makes them be inadaptable to meet the need of disseminating reliably and efficiently in the emergency environment. A reliable dissemination method based on dynamic multicast tree called RDBDMT is proposed. RDBDMT clusters and identify nodes in a hierarchical manner according to the delays between them, and based on which a hierarchical overlay is built. RDBDMT adopts prefix matching routing which is based on a dynamic multicast tree according to their identifications. Theoretical analysis and experimental results show that, RDBDMT is much more reliable and efficient than the existing methods, even in the emergency environment, where a large number of messages are published simultaneously in a very short time.