期刊文献+

网络拓扑模型述评 被引量:8

Survey of Network Topology Models
下载PDF
导出
摘要 网络拓扑模型广泛地应用于网络研究中。简单概述了网络拓扑模型的相关度量及常见的网络拓扑模型,重点综述了从真实网络中总结的幂法则及相应的模型,并描述了最近发现的RichClub现象及其模型。最后剖析了该领域当前存在的问题,展望了今后的发展方向。 Network topology models are widely used i n network research. In this paper, the metrics of the models and the common models are presented. The power-laws of the real networks and the relative models are also summarized and analyzed. And then the Rich-Club phenomenon discovered recently and its models are described too. Finally, the existing problems and the future direction in this field are discussed.
出处 《计算机应用研究》 CSCD 北大核心 2005年第7期1-4,8,共5页 Application Research of Computers
基金 国家自然科学基金资助项目(60373010) 国家"973"计划资助项目(2003CB314801)
关键词 网络拓扑模型 度量 幂法则 Rich—Club Network Topology Model Metrics Power-law Rich-Club
  • 相关文献

参考文献22

  • 1L Brakmo, S O'Malley, L Petersom TCP Vegas:New Techniques for Congestion Detection and Avoidance [C]. Proc.of the ACM SIGCOMM, New York : ACM Press, 1994.24- 35.
  • 2D Mitzel, S Shenker. Asymptotic Resource Consumption in Multicast Reservation Styles [C]. Proc. of the ACM SIGCOMM, New York:ACM Press, 1994. 226-233.
  • 3C Williamson. Optimizing File Transfer Response Time Using the Loss-load Curve Congestion Control Mechanism [C]. Proc. of the ACM SIGCOMM, New York: ACM Press, 1993. 117-126.
  • 4J Behrens, J J Garcia-Luna-Aceves.Distributed, Scalable Routing Based on Link-State Vectors[C]. Proc. of the ACM SIGCOMM, New York : ACM Press,1994.136-147.
  • 5S Sibal, A DeSimone. Controlling Alternate Routing in General-Mesh Packet Flow Networks [C].Proc.of the ACM SIGCOMM, New York: ACM Press, 1994. 168-179.
  • 6William T Zaumen, J J Garcia-Luna-Aceves. Dynamics of Distributed the Shortest-Path Routing Algorithms [C]. Proc. of the ACM SIGCOMM, New York: ACM Press, 1991. 31-42.
  • 7D Sidhu, T Fu, S Abdallah, et al. Open Shortest Path First(OSPF) Routing Protocol Simulation[C]. Proc. of the ACM SIGCOMM, New York: ACM Press, 1993. 53-62.
  • 8Dinesh C Verma, P M Gopal. Routing Reserved Bandwidth Multi-Point Connections[C]. Proc. of the ACM SIGCOMM, New York:ACM Press, 1993. 96-105.
  • 9Bernard M Waxman. Routing of Multipoint Connections[J]. IEEE J.on Selected Areas in Communications, 1988, 6(9) :1617-1622.
  • 10E W Zegura, K L Calvert, M J Donahoo. A Quantitative Comparison of Graph-based Models for Internetworks [J]. IEEE/ACM Transactions on Networking, 1997, 5(6):770- 783.

同被引文献81

引证文献8

二级引证文献53

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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