Based on the state transition rule, the local updating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the least\|cost quality of service (QoS) unicast rou...Based on the state transition rule, the local updating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the least\|cost quality of service (QoS) unicast routing. The algorithm is used for solving the routing problem with delay, delay jitter, bandwidth, and packet loss\|constrained. In the simulation, about 52.33% ants find the successful QoS routing , and converge to the best. It is proved that the algorithm is efficient and effective.展开更多
This paper introduces Twist-routing, a new routing algorithm for faulty on-chip networks, which improves Maze-routing, a face-routing based algorithm which uses deflections in routing, and archives full fault coverage...This paper introduces Twist-routing, a new routing algorithm for faulty on-chip networks, which improves Maze-routing, a face-routing based algorithm which uses deflections in routing, and archives full fault coverage and fast packet delivery. To build Twist-routing algorithm, we use bounding circles, which borrows the idea from GOAFR+ routing algorithm for ad-hoc wireless networks. Unlike Maze-routing, whose path length is unbounded even when the optimal path length is fixed, in Twist-routing, the path length is bounded by the cube of the optimal path length. Our evaluations show that Twist-routing algorithm delivers packets up to 35% faster than Maze-routing with a uniform traffic and Erdos-Rényi failure model, when the failure rate and the injection rate vary.展开更多
下一代互联网NGI(Next Generation Internet)需要提供服务质量QoS(Quality of Service)路由能力,支持总最佳连接ABC(Always Best Connected).但是,由于链路状态的难以精确测量与用户QoS需求的难以准确表达,因此QoS路由基于的信息实际上...下一代互联网NGI(Next Generation Internet)需要提供服务质量QoS(Quality of Service)路由能力,支持总最佳连接ABC(Always Best Connected).但是,由于链路状态的难以精确测量与用户QoS需求的难以准确表达,因此QoS路由基于的信息实际上是模糊的.同时,在网络运营日益商业化的环境下,支持ABC需要兼顾用户和网络提供方利益,考虑双方效用共赢.为此,文中引入模糊数学、概率论和博弈论知识,设计了一种ABC支持型QoS单播路由机制.该机制采用区间形式描述用户QoS需求和边(链路)参数,引入用户满意度和边评价,通过博弈分析,基于人工鱼群算法,寻找使用户和网络提供方效用达到或接近Nash均衡下Pareto最优的QoS单播路径.仿真结果表明,该机制是可行和有效的.展开更多
文摘Based on the state transition rule, the local updating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the least\|cost quality of service (QoS) unicast routing. The algorithm is used for solving the routing problem with delay, delay jitter, bandwidth, and packet loss\|constrained. In the simulation, about 52.33% ants find the successful QoS routing , and converge to the best. It is proved that the algorithm is efficient and effective.
文摘This paper introduces Twist-routing, a new routing algorithm for faulty on-chip networks, which improves Maze-routing, a face-routing based algorithm which uses deflections in routing, and archives full fault coverage and fast packet delivery. To build Twist-routing algorithm, we use bounding circles, which borrows the idea from GOAFR+ routing algorithm for ad-hoc wireless networks. Unlike Maze-routing, whose path length is unbounded even when the optimal path length is fixed, in Twist-routing, the path length is bounded by the cube of the optimal path length. Our evaluations show that Twist-routing algorithm delivers packets up to 35% faster than Maze-routing with a uniform traffic and Erdos-Rényi failure model, when the failure rate and the injection rate vary.
文摘下一代互联网NGI(Next Generation Internet)需要提供服务质量QoS(Quality of Service)路由能力,支持总最佳连接ABC(Always Best Connected).但是,由于链路状态的难以精确测量与用户QoS需求的难以准确表达,因此QoS路由基于的信息实际上是模糊的.同时,在网络运营日益商业化的环境下,支持ABC需要兼顾用户和网络提供方利益,考虑双方效用共赢.为此,文中引入模糊数学、概率论和博弈论知识,设计了一种ABC支持型QoS单播路由机制.该机制采用区间形式描述用户QoS需求和边(链路)参数,引入用户满意度和边评价,通过博弈分析,基于人工鱼群算法,寻找使用户和网络提供方效用达到或接近Nash均衡下Pareto最优的QoS单播路径.仿真结果表明,该机制是可行和有效的.
