首页> 外文会议>Electrical and Computer Engineering, 2009. CCECE '09 >Reducing TE-LSP setup time by minimizing blockage with the use of pre-reservations during the path computation process
【24h】

Reducing TE-LSP setup time by minimizing blockage with the use of pre-reservations during the path computation process

机译:通过在路径计算过程中使用预保留来最大程度地减少阻塞,从而减少TE-LSP的建立时间

获取原文
获取原文并翻译 | 示例

摘要

A traffic engineered label switched path (TE-LSP) is usually deployed on an optimally computed path. In complex network scenarios, or when external nodes like path computation elements (PCEs) are solicited in a distributed manner, the already resource hungry task of optimal path computation could take a considerable amount of time during which network resources may fluctuate. This could result in blockage during the signaling of TE-LSPs. Given that a low setup time is often a requirement for TE-LSPs, the risk of blockage needs to be minimized. We propose a pre-reservation based solution applied to the case of inter-domain path computation. Simulation results on a real world network topology show that our method allows for better TE-LSP setup times. The results also show that our method does not deteriorate the overall network utilization.
机译:通常将流量工程标签交换路径(TE-LSP)部署在最佳计算的路径上。在复杂的网络场景中,或者当以分布式方式请求诸如路径计算元素(PCE)之类的外部节点时,最佳路径计算的本已资源匮乏的任务可能会花费相当长的时间,在此期间网络资源可能会发生波动。这可能导致在TE-LSP的信令期间阻塞。考虑到TE-LSP通常需要较短的建立时间,因此需要将阻塞的风险降到最低。我们提出一种适用于域间路径计算的基于预保留的解决方案。在现实世界的网络拓扑上的仿真结果表明,我们的方法可以缩短TE-LSP的建立时间。结果还表明,我们的方法不会降低整体网络利用率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号