首页> 外文会议>Local Computer Networks (LCN 2007), 2007 IEEE 32nd Conference on >N-Best Optimal Path Ant Routing Algorithm for State-Dependent N Best Quality of service Routes in IP Networks
【24h】

N-Best Optimal Path Ant Routing Algorithm for State-Dependent N Best Quality of service Routes in IP Networks

机译:IP网络中状态相关的N条最佳服务质量路由的N条最佳路径蚂蚁路由算法

获取原文

摘要

As Routing mechanism is a key to success of future communication networking, computing constrained shortest paths is fundamental to some important network functions such as QoS routing or traffic engineering. The problem is to find feasible paths satisfyi
机译:由于路由机制是未来通信网络成功的关键,因此计算受限的最短路径对于某些重要的网络功能(如QoS路由或流量工程)至关重要。问题是找到满足条件的可行路径

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号