期刊文献+

A study on IP-based hierarchical routing strategy in network simulation

A study on IP-based hierarchical routing strategy in network simulation
在线阅读 下载PDF
导出
摘要 The intrinsic routing policy of NS2—a network simulation tool— based on flat or hierarchical address has the disadvantage such as small topology scale,high resource consumption,low efficiency and so on.This paper proposes an IP based hierarchical routing strategy in network simulation to extend the topology scale and improve performance in simulating.Firstly,a stratification mechanism to identify IP address of nodes is described.Then,an algorithm of packet transmitting method(PTM) is presented for packet forwarding in the same subnet.Finally,algorithms of region partition(RP),routing computation based on region division(RCBRD) and routing distribution(RD) is proposed to implement regional segmentation,route calculation and route distribution for forwarding packets in different subnets respectively.The experiment results show that under the same condition,compared with plane address,the topology scale of the network simulation is extended two times and the consumption of time and memory during simulation is reduced by approximately 73%and 45.8% respectively.Compared with hierarchical address,the topology scale of the network simulation is expanded by more than 50%,and the consumption of time and memory is reduced by about 59.2% and 25% respectively.In addition,along with the growth of the node size,the proportion of reducing total simulation time and memory consumption would gradually increase. The intrinsic routing policy of NS2—a network simulation tool— based on flat or hierarchical address has the disadvantage such as small topology scale,high resource consumption,low efficiency and so on.This paper proposes an IP based hierarchical routing strategy in network simulation to extend the topology scale and improve performance in simulating.Firstly,a stratification mechanism to identify IP address of nodes is described.Then,an algorithm of packet transmitting method(PTM) is presented for packet forwarding in the same subnet.Finally,algorithms of region partition(RP),routing computation based on region division(RCBRD) and routing distribution(RD) is proposed to implement regional segmentation,route calculation and route distribution for forwarding packets in different subnets respectively.The experiment results show that under the same condition,compared with plane address,the topology scale of the network simulation is extended two times and the consumption of time and memory during simulation is reduced by approximately 73%and 45.8% respectively.Compared with hierarchical address,the topology scale of the network simulation is expanded by more than 50%,and the consumption of time and memory is reduced by about 59.2% and 25% respectively.In addition,along with the growth of the node size,the proportion of reducing total simulation time and memory consumption would gradually increase.
出处 《High Technology Letters》 EI CAS 2017年第2期156-164,共9页 高技术通讯(英文版)
基金 Supported by the National Science and Technology Support Project(No.2012BAH45B01) the National Natural Science Foundation of China(No.61100189,61370215,61370211,61402137) the National Information Security 242 Project of China(No.2016A104)
关键词 network simulation routing policy plane routing hierarchical routing network simulation, routing policy, plane routing, hierarchical routing
  • 相关文献

参考文献3

二级参考文献34

  • 1HUANG P,HEIDEMANN J. Minimizing routing state for lightweight network simulation[ A]. Proceedings of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems [C]. USA: IEEE Computer Society, Washington DC,2001.
  • 2HIROMORI A, YAMAGUCHI H, YASUMOTO K, et al. Reducing the size of routing tables for large-scale network simulation[A]. Proceedings of the IEEE Intemational Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems[ C]. USA: IEEE Computer Society, Washington DC, 2003.
  • 3CHEN J, GUPTA D, VISHWANATH K, et al. Routing in an Intemet-scale network emulator[ A ]. Proceedings of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems[C]. USA: IEEE Computer Society, Washington DC, 2004.
  • 4RILEY G, FUJIMOTO R, AMMAR M. Stateless routing in network simulations[ A]. Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems [ C ]. USA: IEEE Computer Society, Washington DC,2000.
  • 5MCCANNE S, FLOYD S. The LBNL network simulator[R]. USA: Lawrence Berkeley Laboratory, California, 1997.
  • 6MAGONI D, PANSIOT J. Intemet topology modeler based on map sarnpling[ A]. Proceedings of the 7th IEEE Symposium on Computers and Communications[ C]. USA: IEEE Computer Society, Washington DC, 2002.
  • 7XIONG Z G, ZHANG X M, XIA X- W,'et al. Analysis of discrete event generation model on result of network simulation[A]. Proc of the 2rid Inte/national Conference on Software Technology and Engineer- ing[C]. San Juan, PR, 2010, (2):2119-2122.
  • 8SCHMIDT S, BYE R, CHINNOW J, et al. Application-level simula- tion for network security[J]. Simulation, 2010,86(5-6):311:330.
  • 9SHEN J J , GAN Z C, YU X H. The research on tactical Intemet simulative training and its dynamic real-time network simulation[A]. Proc of the 2nd IEEE International Conference on Information Man- agement and Engineering[C]. Chengdu, China, 2010.354-358.
  • 10HUANG P, HEIDEMANN J. Minimizing routing state for light- weight network simulation[A]. Proceedings Of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems[C]. Cincinnati, OH, United states, 2001. 108 -116.

共引文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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