节点文献
WDM网络中支持多优先级动态业务的路由算法
Routing algorithm for priority-based dynamic operation in WDM network
【摘要】 路由问题始终是WDM网络中的一个核心问题。基于多优先级动态业务,对不同等级的业务设置不同的瓶颈门限,产生不同的禁用链路集,当一个连接请求到达时,根据其优先级在网络中将相应的禁用链路删去,在剩余网络中寻求最优路由,从而获得一种新的路由算法——链路限制法。算法能缓解通信链路中的“瓶颈”,同时保证高优先级的连接请求具有较好的传输指标。
【Abstract】 The problem of routing is still a core problem in WDM network. Based on the multipriority dynamic operations, different bottleneck threshold values for different priority-based dynamic operations could be set, and different banned edge sets were producted. When a connecting call arrived to network, its banned edge set was canceled from network topology, and then to seek for the shortest route for connecting call in new topology. A new routing algorithm-edge limited algorithm was achieved. This algorithm can relax the bottleneck edges of network and make high priority operations have better transmission performance.
【Key words】 WDM network; dynamic operation; multipriority; routing algorithm;
- 【文献出处】 计算机工程与设计 ,Computer Engineering and Design , 编辑部邮箱 ,2005年06期
- 【分类号】TN929.1
- 【被引频次】1
- 【下载频次】58