期刊文献+

基于衰落Bloom Filter的P2P网络弱状态路由算法 被引量:2

P2P Weak State Routing Scheme Based on Decaying Bloom Filters
下载PDF
导出
摘要 在P2P网络中,基于衰落Bloom Filter的弱状态路由算法试图将每条查询消息沿着成员资格信息量最强的方向传递,并最终以较低的传输代价和传输时延确保较高的查准率.衰落Bloom Filter在传递过程中存在严重的多径叠加和噪音问题,这直接导致查询消息会以很高的概率沿着错误的方向传播,甚至会退化为泛洪路由算法.为了解决这一挑战性难题,提出了DWalker这种基于衰落Bloom Filter的高效弱状态路由算法.DWalker基于有向随机网络,采用指数衰落Bloom Filter来发布和传播每个节点共享资源的信息,且其最大传播距离小于网络中任意两点之间距离的期望值,从而有效抑制了衰落Bloom Filter在传播过程中的多径叠加问题.DWalker采用多个Bloom Filter而不是单个Bloom Filter来表达一项路由条目,在单个Bloom Filter的错误发生概率达到设计上限时,可按需动态增加新的Bloom Filter,以将更多资源对象信息纳入到当前路由条目中.DWalker仅根据当前节点的各项路由条目中值为1的比特位所占的最大比例,以及查询消息在正确转发方向对应的路由条目中对应比特位中值为1的个数的临界值,就能使进入目标对象传播范围内的查询消息以较高的概率辨认出正确的路由方向.理论分析和实验结果表明,DWalker能够以较低的查询消息代价、较小的路由条目存储开销以及较短的查询时延,使绝大多数查询消息沿正确方向转发,从而获得较高的查准率. The current weak state routing schemes cannot facilitate in-network queries effectively.When a query is given for an item at an arbitrary node,disturbance in unrelated routing entries are likely stronger than the useful information in the right routing entries.Consequently,the majority of queries are moved towards wrong nodes.To solve this problem,this paper presents DWalker,an efficient weak state routing scheme-based design based on decaying bloom filters.DWalker uses a bloom filter to represent the summary information of resources at each node and then propagated a bloom filter within a propagation range.The amount of information in each bloom filter decreases exponentially with the distance from the source.DWalker makes the max propagation range less than the expected distance between any two nodes;hence,effectively tackling the problem of multi-path propagation of a decaying bloom filter.DWalker replaces a single bloom filter with multiple bloom filters as a routing entry and holds more routing information.DWalker can ensure that any query can be forwarded in the right direction with high a probability that is based on the proportion of bits set to 1 in a bloom filter and the least number of bits set to 1 in an entry bloom filter for a query.The analysis and simulation of results show that DWalker can make many queries that can be forwarded in the right direction to achieve a high query hit rate with low cost and low delay
出处 《软件学报》 EI CSCD 北大核心 2011年第11期2810-2819,共10页 Journal of Software
基金 国家自然科学基金(60903206 61170284 60970094 61003304) 中国博士后科学基金(201104439) 湖南省自然科学基金(09ZZ4034) 国防科学技术大学预先研究项目(JC10-05-01)
关键词 对等计算 有向随机网络 弱状态路由 衰落Bloom Filter 噪音 peer-to-peer computing directed random network weak state routing decaying Bloom Filter disturbance
  • 相关文献

参考文献15

  • 1Yuen WH, Schulzrinne H. Improving search efficient using Bloom filters in partially connected ad hoc networks: A node-centric analysis. Computer Communications, 2007,30(16):3000-3011. [doi: 10.1016/j.comcom.2007.05.055].
  • 2Hebden P, Pearce AR. Data-Centdc routing using bloom filters in wireless sensor networks. In: Alex H, Begg R, eds. Proc. of the 4th Int'l Conf. on Intelligent Sensing and Information Processing. Washington: IEEE Computer Society, 2006. 72-77. [doi: 10.1109/ICISIP.2006.4286065].
  • 3Chan CF, Mole: Multi-hop object location in wireless mesh networks [Ph.D. Thesis]. Hong Kong: Hong Kong University of Science and Technology, 2008.
  • 4Acer UG, Kalyanaraman S, Abouzeid AA. Weak state routing for large scale dynamic networks. In: Hou J, Ramanathan R, eds. Proc. of the 13th ACM Int'l Conf. on Mobile Computing and Networking. New York: ACM, 2007. 290-301. [doi: 10.1145/ 1287853.1287888].
  • 5Reynolds P, Vahdat A. Efficient peer-to-peer keyword searching. In: Schmidt D, Endler M, eds. Proc. of the ACM/IFID/USENIX 2003 Int'l Conf. on Middleware. New York: Springer-Verlag, 2003.21-40.
  • 6J~lasity M, Montresor A, Jesi GP. The PcerSim simulator. 2009. http://peersim.sf.net.
  • 7Zhang YM, Lu XC, Zheng QB, Li DS. PST: An efficient search algorithm for large-scale P2P systems. Journal of Software, 2008, 19(6):1473-1480 (in Chinese with English abstract), http://www.jos.org.cn/1000-9825/19/1473.htm [doi: 10.3724/SP.J.1001.2008. 01473].
  • 8Bloom BH. Space/Time tradeoffs in hash coding with allowable errors. Communications of the ACM, 1970,13(7):422-426. [doi: 10.1145/362686.362692].
  • 9Gilbert R, Johnson K, Wu SM, Zhao BY, Zheng HT. Location independent compact routing for wireless networks. In: Petrioli C, Ramjee R, eds. Proc. of the 1st Int'l Workshop on Decentralized Resource Sharing in Mobile Computing and Networking. New York: ACM, 2006. 57-59. [doi: 10.1145/1161252.1161267].
  • 10Rhea SC, Kubiatowicz J. Probabilistic location and routing. In: Lee D, Orda A, eds. Proc. of the IEEE INFOCOM 2002. Washington: IEEE Computer Society, 2002. 1248-1257. [doi: 10.1109/INFCOM.2002.1019375].

二级参考文献11

  • 1Lu XC, Wang HM, Wang J. Virtual computing environment (IVCE): Concept and architecture. Science in China (Series E), 2006,36(10): 1081-1099.
  • 2Matei R, Ian F, Adriana I. Mapping the Gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal, 2002,6(1):50-57.
  • 3Christos G, Milena M, Amin S. Random walks in peer-to-peer networks. In: Proc. of the IEEE INFOCOM 2004. New York: IEEE Press, 2004. 120-130.
  • 4Zheng QB, Lu XC, Zhu PD, Peng W. An efficient random walks based approach to reducing file locating delay in unstructured P2P network. In: Proc. of the IEEE GLOBECOM 2005, Vol.2. St. Louis: IEEE Press, 2005. 980-984.
  • 5Francisco MCA, Christopher P, Richard PM, Thu DN. PlanetP: Using gossiping to build content addressable peer-to-peer information sharing communities. Technical Report, DCS-TR-487, Piscataway: Rutgers University, 2002.
  • 6Yatin C, Sylvia R, Lee B, Nick L, Scott S. Making Gnutella-like P2P systems scalable. In: Proc. of the ACM SIGCOMM 2003. New York: ACM Press, 2003. 407-418.
  • 7Beverly Y, Hector GM. Efficient search in peer-to-peer networks. In: Proc. of the ICDCS 2002. Vienna: IEEE Computer Society, 2002.5-14.
  • 8Burton HB. Space/Time trade-offs in hash coding with allowable errors. Communications of the ACM, 1970,13(7):422-426.
  • 9Abhishek K, Jun (Jim) X, Ellen WZ. Efficient and scalable query routing for unstructured peer-to-peer networks. In: Proc. of the IEEE INFOCOM. 2005. 1162-1173.
  • 10http://vce.org.cn/ymzhang/PST_TR.pdf

共引文献21

同被引文献11

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部