面向ESB的重复消息检测方法研究

摘要

针对企业服务总线(ESB)消息重传机制带来的重复消息问题,提出一种基于二叉树的重复消息检测方法——BTD.理论分析和实验结果均表明,对于总数为n的消息集合,BTD的空间复杂度为O(8m· n),时间复杂度为O(m·n),其中,m是常数,等于消息散列值的位长度.与现有方法相比,BTD能够以较小的空间代价换取检测速度较大程度的提升.%Focusing on the problem of duplicate message incurred from message re-transmission mechanism in enterprise service bus, we propose a binary tree-based duplicate message detection method, named as BTD. Theoretical analysis and experimental results all show that for a message set with total number n, the space complexity of BTD is O(8m · n) while the time complexity of BTD is O(m ·n) , where m is a constant and is the bit length of the hash value for each message. Compared with existing method, BTD can reach a fast detection speed with the cost of a relatively small storage.