基于自适应周期的流言机制快速构建自组Overlay拓扑
作者:
基金项目:

Supported by the Natural Science Foundation of Hu'nan Province of China under Grant No.07JJ4018 (湖南省自然科学基金)

  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [20]
  • |
  • 相似文献 [20]
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

    分析了overlay拓扑管理中流言机制的一般过程,发现固定周期的流言报文中存在的数据交换盲目性的弊端.为此,引入动态的自适应周期来代替固定周期,使得局部拓扑稳定的节点较少发出流言报文,而局部拓扑动荡的节点较多发出流言报文.这种方法提高了数据交换效率,节省了网络资源,允许在局部加快数据交换,从而提高拓扑的整体收敛速度.通过仿真实例对该方法的有效性进行了验证,并证实该方法在动态网络环境中尤其适用.

    Abstract:

    Based on previous observation, a dynamic adaptive cycle into gossip-based topology management is introduced to replace the traditional fixed cycle and a quick topology convergence method based on adaptive cycle is also proposed . In this method, those nodes featured with local topology stability send fewer gossip packets, while nodes in frequently changing environment send more packets. This dynamic adaptive method improves data exchange efficiency, saves network resources, enables faster local data exchange, and consequently speeds up the overall topology convergence. In detail, by using logistic curve as the basic control function of the adaptive cycle, rules for accidental events is defined accordingly. Simulation is presented to show the validity of this approach and that it is especially suitable for dynamic network environment.

    参考文献
    [1] Babaoglu O, Canright G, Deutsch A, Di Caro G, Ducatelle F, Gambardella L, Ganguly N, Jelasity M, Montemanni R, Montresor A. Design patterns from biology for distributed computing. ACM Trans. on Autonomous and Adaptive Systems (TAAS), 2006,1(1): 26-66.
    [2] Andersen DG. Overlay networks: Networking on top of the network. 2004. http://www.reviews.com/hottopic/
    [3] Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, Balakrishnan H. Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Trans. on Networking (TON), 2003,11(1):17-32.
    [4] Rowstron A, Druschel P. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui R, ed. Proc. of the 18th IFIP/ACM Int’l Conf. on Distributed Systems Platforms (Middleware 2001). Berlin, Heidelberg: Springer-Verlag, 2001. 329-350.
    [5] Eugster PT, Guerraoui R, Kermarrec AM, Massoulie L. Epidemic information dissemination in distributed systems. IEEE Computer, 2004,37(55):60-67.
    [6] Eugster P, Guerraoui R, Handurukande S, Kermarrec AM, Kouznetsov P. Lightweight probabilistic broadcast. ACM Trans. on Computer Systems, 2003,21(4):341-374.
    [7] Kermarrec AM, Massoulie L, Ganesh AJ. Probabilistic reliable dissemination in large-scale systems. IEEE Trans. on Parallel and Distributed Systems, 2003,14(3):248-258.
    [8] Ganesh AJ, Kermarrec AM, Massoulie L. Scamp: Peer-to-Peer lightweight membership service for large-scale group communication. In: Crowcroft J, Hofmann M, eds. Proc. of the 3rd Int’l Workshop on Networked Group Communication. London: Springer-Verlag, 2001. 44-55.
    [9] Van Renesse R, Minsky Y, Hayden M. A gossip-style failure detection service. In: Davies N, Raymond K, Seitz J, eds. Proc. of the Middleware’98. New York: Springer-Verlag, 1998. 55-70.
    [10] Van Renesse R, Birman KP, Vogels W. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans. on Computer Systems, 2003,21(2):164-206.
    [11] Holliday J, Steinke R, Agrawal D, El Abbadi A. Epidemic algorithms for replicated databases. IEEE Trans. on Knowledge and Data Engineering, 2003,15(5):1218-1238.
    [12] Jelasity M, Babaoglu O. T-Man: Gossip-Based overlay topology management. In: Brueckner SA, Serugendo GDM, Hales D, Zambonelli F, eds. Proc. of the Engineering Self-Organising Applications (ESOA 2005). Utrecht: Springer-Verlag, 2005.
    [13] Montresor A, Jelasity M, Babaoglu O. Chord on demand. In: Caronni G, Weiler N, Waldvogel M, Shahmehri N, eds. Proc. of the 5th IEEE Int’l Conf. on Peer-to-Peer Computing (P2P 2005). Konstanz: IEEE Computer Society, 2005. 87-94.
    [14] Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S. Making Gnutella-like P2P systems scalable. In: Feldmann A, Zitterbart M, ed. Proc. of the ACM SIGCOMM 2003. Karlsruhe: ACM Press, 2003. 407-418.
    [15] Zhang H, Goel A, Govindan R. Using the small-world model to improve freenet performance. Computer Networks Journal, 2004, 46(4):555-574.
    [16] Fisk A. Gnutella ultrapeer query protocol v0.1. 2003. http://groups.yahoo.com/group/the_gdf/files/Proposals/Working Proposals/ search/Ultrapeer QRP/ultrapeer_qrp.html
    [17] Daswani S, Fisk A. Gnutella udp extension for scalable searches (guess) v0.1. 2002. http://groups.yahoo.com/group/the_gdf/files/ Proposals/Pending Proposals/GUESS/guess_01.html
    [18] Liu YB, Zhuang ZY, Xiao L, Ni LM. A distributed approach to solving overlay mismatching problem. In: Proc. of the 24th Int’l Conf. on Distributed Computing Systems (ICDCS 2004). Tokyo: IEEE Computer Society, 2004. http://ieeexplore.ieee.org/xpl/ freeabs_all.jsp?arnumber=1281576
    [19] Dabek F, Cox R, Kaashoek F, Morris R. Vivaldi: A decentralized network coordinate system. In: Proc. of the ACM SIGCOMM 2004. ACM Press, 2004. 15-26. http://portal.acm.org/citation.cfm?id=1030194.1015471
    [20] Aroiu S, Gummadi PK, Gribble SD. Measuring and analyzing the characteristics of Napster and Gnutella hosts. Multimedia Systems Journal, 2003,9(2):170-184.
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

孙 晓,王 晖,汪 浩,姜志宏,陶 钧.基于自适应周期的流言机制快速构建自组Overlay拓扑.软件学报,2008,19(9):2422-2431

复制
分享
文章指标
  • 点击次数:4359
  • 下载次数: 5600
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2006-07-01
  • 最后修改日期:2007-06-18
文章二维码
您是第19868246位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号