期刊文献+

SubCounter:一种基于语义簇聚的节点子集规模估计方法

SubCounter:A Node Subset Size Estimation Approach Based on Semantic Clustering
下载PDF
导出
摘要 为进一步改进性能,很多P2P应用需要系统中各节点子集的规模信息。已有的节点子集规模估计方法主要基于对已有的系统节点规模估计方法的直接应用。本文提出了SubCounter——一种基于语义簇聚的节点子集规模估计方法。SunCounter通过节点间周期性的邻居交换为每个节点维护一个语义簇聚的邻居列表,以保持每个节点与自己所属各子集其他节点的联系。基于这种联系,SubCounter以反熵聚集的方式实现节点子集规模估计。实验结果表明,相比于已有方法,SubCounter在节点所属子集较多的情况下具有更快的收敛速度,并且能够以更小的通讯与存储开销保证同样的估计精度和相似的鲁棒性。 Many P2P applications need the size values of node subsets in the system to enhance performance.The existing subset size estimation approaches are based on applying the size estimation approach directly.This paper proposes SubCounter,a node subset size estimation approach based on semantic clustering.SubCounter maintains a semantic clustering neighbor list for each node by view exchange,so each node can keep contacts with others in the same subset.Based on the semantic clustering,SubCounter realizes the estimation of subset sizes,through anti-entropy aggregation.The experimental results show that compared with the existing approaches,SubCounter converges more quickly when each node belongs to many subsets simultaneously,and ensures the same precision and similar robustness with less communication and storage cost.
出处 《计算机工程与科学》 CSCD 北大核心 2012年第2期104-110,共7页 Computer Engineering & Science
基金 国家973计划资助项目(2011CB302601) 国家自然科学基金资助项目(60873215) 湖南省自然科学杰出青年基金项目(S2010J5050) 高等学校博士学科点专项科研基金资助课题(200899980003)
关键词 网络规模 规模估计 反熵聚集 P2P network size size estimation anti-entropy aggregation P2P
  • 相关文献

参考文献13

  • 1Montresor A, lelasity M, Babaoglu O. Robust Aggregation Protocols for Large-Scale Overlay Networks[R]. Technical Report UBLCS-2003-16, Department of Computer Science, University of Bologna, 2003.
  • 2J elasity M, Montresor A. Epidemic-Style Proactive Aggregation in Large Overlay Networks[C]// Proc of ICDCS' 04, 2004,102-111.
  • 3j elasity M, Kowalczyk W, van Steen M. An Approach to Massively Distributed Aggregate Computing on Peer-to-peer Network[C]// Proc of the 12th Euromicro Conference on Parallel Distributed and Network-Based Processing (PDP' 04).2004:200-207.
  • 4Shafaat T M, Ghodsi A. Haridi S. A Practical Approach to Network Size Estimation for Structured Overlays[C]//Proc of the 3rd International Workshop on Self-Organizing Systems CIWSOS'08). 2008:71-83.
  • 5Flajolet P, Martin G N. Probabilistic Counting[C]//Proc of the 24th Annual Symposium on Foundations of Computer Science (FOCS' 83) .1983: 76-82.
  • 6Przydatek B. Song D. Perrig A. Sia , Secure Information Aggregation in Sensor Networks[C]//Proc of the 1st Int'l Conf on Embedded Networked Sensor Systems. 2003: 255-265.
  • 7Kostoulas D. Psaltoulis D, Gupta I. et al. Decentralized Schemes for Size Estimation in Large and Dynamic Groups [C]//Proc of the 4th IEEE International Symposium on Network Computing and Applications (NCA'05). 2005 :41-48.
  • 8Massoulie L. Merrer E L, Kermarrec A. et al. Peer Counting and Sampling in Overlay Networks: Random Walk Methods[C]//Proc of the 25th Annual ACM Symposium on Principles of Distributed Computing. 2006: 123-132.
  • 9Kennedy 0, Koch C, Demers A. Dynamic Approaches to Innetwork Aggregation [C]// Proc of the 25th International Conference on Data Engineering (ICDE' 09), 2009: 13311334.
  • 10Cardoso J C S, Baquero C, Almeida P S. Probabilistic Estimation of Network Size and Diameter[C]// Proc of the 4th Latin-American Symposium on Dependable Computing (LADC'09),2009:33-40.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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