期刊文献+

OSPF协议的随机Petri网模型与性能分析 被引量:3

Stochastic Petri net model and performance analysis of OSPF
收藏 分享 导出
摘要 为了改进开放式最短路径优先(OSPF)协议实现的性能,该文深入分析了OSPF复杂的协议行为并建立了随机Petri网模型。同时提出了耗时过程的概念,并且从OSPF协议行为中提取出耗时过程,简化上述Petri网模型。最后利用工具SPNP进行了模拟分析。实验结果表明OSPF协议在不同的网络状况下具有不同的性能表现:当网络变化频繁时,OSPF协议的主要负载是路由计算;当网络变化平缓时,OSPF协议的主要负载是链路状态声明信息(LSA)检索。这样为提高OSPF协议的性能提供了定量分析方法。 The complex behavior of the open shortest path first (OSPF) algorithm was modeled using a stochastic Petri net. The model was simplified by removing the time consuming part of the analysis from the OSPF algorithm. The simulation results show that the OSPF algorithm performs differently for different network state. When the network changes frequently, the OSPF load is focused on routing calculations, but when the network is stable, the OSPF load is focused on searching the link state advertisement. This paper provides a quantitative analytical method for improving the OSPF performance for avariety of conditions.
作者 陈智波 徐明伟 崔勇 徐恪 CHEN Zhibo, XU Mingwei, CUI Yong, XU Ke (Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China)
出处 《清华大学学报:自然科学版》 EI CAS CSCD 北大核心 2006年第4期572-575,共4页 Journal of Tsinghua University(Science and Technology)
基金 国家“九七三”基础研究项目(2003CB314801) 国家自然科学基金资助项目(60373010和90104002)
关键词 计算机网络 随机PETRI网 开放式最短路径优先 性能分析 computer network stochastic Petri net open shortest path first performance analysis
  • 相关文献

参考文献13

  • 1RFC 2328.OSPF Version 2[S].IETF,April 1998. 被引量:1
  • 2Sharon O.Dissemination of routing information in broadcast networks:OSPF versus IS-IS[J].IEEE Network,2001,15:56-65. 被引量:1
  • 3Goyal M,FENG Wuchi.Achieving faster failure detection in OSPF networks[A].ICC 2003[C].Anchorage,2003. 被引量:1
  • 4Floyd S,Jacobson V.The synchronization of periodic routing messages[A].SIGCOMM '93[C].San Francisco,1993. 被引量:1
  • 5Watson D,Jahanian F.Experiences with monitoring OSPF on a regional service provider network[A].International Conference on Distributed Computing Systems[C].RI,2003. 被引量:1
  • 6Anindya B,Jon R.Stability issues in OSPF routing[A].SIGCOMM'01[C].San Diego,2001. 被引量:1
  • 7Aho A V,Lee D.Hierarchical networks and the LSA N-Squared problem in OSPF routing[A].GLOBECOM'00[C].San Francisco,2000. 被引量:1
  • 8RFC3623.Graceful OSPF Restart[S].IETF,November 2003. 被引量:1
  • 9Shaikh A,Dube R,Varma A.Avoiding instability during graceful shutdown of OSPF[A].INFOCOM 2002[C].New York,2002. 被引量:1
  • 10Guerin R,Orda A.QoS routing mechanisms and OSPF extensions[A].IEEE Global Telecommunications Mini-Conference[C].Phoenix,AZ,USA,Nov.1997. 被引量:1

同被引文献22

引证文献3

二级引证文献1

投稿分析
职称考试

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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