Network size estimation method based semantic attraction

被引：0
|
作者：
机构：
[1] National Key Laboratory for Parallel and Distributed Processing, College of Computer, National University of Defense Technology
来源：
Ma, X.-K. (mxkong@gmail.com) | 1600年 / Chinese Academy of Sciences卷 / 23期
关键词：
Aggregation estimation; Network size; P2P; Semantic attraction; Size estimation;
D O I：
10.3724/SP.J.1001.2012.03990
中图分类号：
学科分类号：
摘要：
Network size is the fundamental information of the distributed applications. Network size estimation methods must feature both high accuracy and adequate robustness in order to adapt to a large environment with a high node churn. Considering the fact that the existing network size estimation methods mainly focus on single optimization objective and fail to ensure accuracy and robustness simultaneously, a network size estimation method based semantic attraction-SEBSA is proposed in this paper. As the semantic information in SEBSA, hash values are hashed in real intervals by the peers' identifies. The peers with adjacent hash values in SEBSA periodically exchange hash neighbors to attract the most adjacent peers in a hash space quickly. Meanwhile, every peer computes the average spacing among hash values of the hash neighbors to estimate network size. Theoretic analysis and experimental results reveal that compared with existing size estimation methods, SEBSA can provide accurate size estimation information quickly even in continually fluctuating network environment. © 2012 ISCAS.
引用
收藏
页码：662 / 676
页数：14
相关论文
共 16 条
  • [1] Rowstron A., Druschel P., Pastry: Scalable, decentralied object location and routing for large-scale peer-to-peer systems, Proc. of the IFIP/ACM Int'l Conf. on Distributed Systems Platforms, pp. 329-350, (2001)
  • [2] Stoica I., Morris R., Karger D., Kaashoek M.F., Balakrishnan H., Chord: A scalable peer-to-peer lookup service for Internet applications, Proc. of the 2001 SIGCOMM Conf, 31, 4, pp. 149-160, (2001)
  • [3] Ganesh A.J., Kermarrec A.M., Massoulie L., Peer-to-Peer membership management for gossip-based protocol, IEEE Trans. on Computers, 52, 2, pp. 139-149, (2003)
  • [4] Baldoni R., Beraldi R., Quema V., Querzoni L., T-Piergiovanni S., TERA: Topic-Based event routing for peer-to-peer architectures, Proc. of the 2007 Inaugural Int'l Conf. on Distributed Event-Based Systems, (2007)
  • [5] Jelasity M., Montresor A., Epidemic-Style proactive aggregation in large overlay networks, Proc. of the Int'l Conf. on Distributed Computing Systems, pp. 102-109, (2004)
  • [6] Bawa M., G-Molina H., Gionis A., Motwani R., Estimating aggregates on a peer-to-peer network, (2003)
  • [7] Flajolet P., Martin G.N., Probabilistic counting algorithms for data base applications, Journal of Computer and System Sciences, 31, 2, pp. 182-209, (1985)
  • [8] Kennedy O., Koch C., Demers A., Dynamic approaches to in-network aggregation, Proc. of the IEEE 25th Int'l Conf. on Data Engineering, pp. 1331-1334, (2009)
  • [9] Massoulie L., Le Merrer E., Kermarrec A.M., Ganesh A., Peer counting and sampling in overlay networks: Random walk methods, Proc. of the 25th Annual ACM Symp. on Principles of Distributed Computing, pp. 123-132, (2006)
  • [10] Kostoulas D., Psaltoulis D., Gupta I., Birman K., Demers A., Decentralized schemes for size estimation in large and dynamic groups, Proc. of the 4th IEEE Int'l Symp. on Network Computing and Applications, pp. 41-48, (2005)
12