期刊文献+

基于分群的层状叠加网模型

A Hierachical Overlay Network Model Based on Clustering
在线阅读 下载PDF
导出
摘要 为提高叠加网通信效率,提出一种分群自组织层状叠加网模型。以物理距离邻近主机组成的基群为基本自治单位,多个邻近基群自组织为二次群,多个邻近二次群自组织为三次群,依次叠代,形成适应于大规模网络的多次群层状结构。该模型具有逼近物理网结构、自适应网络变化和高效易管理的特点,理论分析证明具有较低通信开销。仿真实验表明,在网络规模较大时其通信负荷只有 Landmark 模型的30%~50%。 To improve the communication efficiency of overlay network, a hierachical self-organizing overlay network model based on clustering is proposed. In this model, basic clusters which are composed of a set of adjacent computers are the mini-autonomous units. Several adjacent basic clusters form a quadrie cluster and several adjacent quadric clusters form a cubic cluster and so forth, Then a multi-hierachical clustering structure which can suit the large-scale net work is produced. The model has the following characteristics: manageable, approaching the physical network which is based on, and adapting frequent changes of the physical network. Finally, theoretical analysis prove it has lower communieation load. The simulated result shows,while the network is large enough,the communication load in this model is only about 30%~50% of the one in a Landmark model.
作者 刘丹 李毅超
出处 《计算机科学》 CSCD 北大核心 2006年第1期28-30,34,共4页 Computer Science
基金 四川省科技攻关项目(02GG006-018)资助项目。
关键词 自组织 叠加网 通信负荷 分群 网络模型 层状结构 网模型 LANDMARK 通信效率 大规模网络 Self-organlzing,Overlay network,Communication load,Clustering,Network model
  • 相关文献

参考文献11

  • 1Waldovgel M, Rinaldi R. Efficient Topology-Aware Overlay Network [C]. ACM HotNets 2002, SIGCOMM/CCR, 2003.
  • 2Ratnasamy S, Handley M, Karp R, et al. Topologically-aware overlay construction and server selection [C]. INFOCOM 2002.Twenty First Annual Joint Conference of the IEEE Computer and Communications Societies. In: Proceedings, IEEE, Volume 3, 23-27.2002. 1190-1199.
  • 3Ratnasamy S, Francis P, Handley M, et al. A Scalable Content Addressable Network EC-. In : Proceedings of SIGGCOMM,2001. 161-172.
  • 4Xu Zhiehen , Tang Chunqiang , Zhang Zheng. Building topology-aware overlays using global soft-state [C]. Distributed Computing Systems,2003. In:Proceedings 23rd International Conference on,2003. 500-508.
  • 5Zhang Xin-Yan, Zhang Qian , Zhang Zhen-sheng, et al. A constion of locality-aware overlay network- mOverlay and its performance Selected Areas in Communications [J]. IEEE Journal on,2004,22(1):18 -28.
  • 6BRITE. [Online]. Available: http://www.cs. bu. edu/brite/.
  • 7Barabasi A L, Albert R. Emergence of scaling in random networks [J]. Science, 1999,286: 509-512.
  • 8Erdos P, Renyi A. On random graphs [M]. I Publ Math, 1959,6 :290-297.
  • 9Christensen E, Curbera F, Meredith G, et al. Web services description language(WSDL)l. 1. W3C( World Wide Web Consortium) [Online]. Cambridge, MA, 2001 http://www. w3. org/TR/wsdl.
  • 10Bela B. Random graphs. London-New York:Academic Press Inc,1985.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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