一种集中调控的分布式服务路径选择算法

Distributed Service Path Selection Algorithm under Central Control

在可重构网络多态路由模型中,通常存在多条满足业务需求的服务路径。针对最优服务路径选择问题,该文设计了一种集中调控的分布式服务路径选择算法,各节点根据服务请求中的第1个元能力和目的节点生成路由表,控制器实时监控网络,调控代价过高路径并平衡网络的带宽和负载。性能分析和仿真结果表明,分布式路由表能够生成有效的服务路径,表项规模、收敛时间与元能力个数成正比,在30%的集中调控比例下,路径代价和负载均衡度性能良好,与其他算法相比,对服务请求的响应时延降低约50%。

There are many service paths which can satisfy the business requirements in polymorphic routing model of reconfigurable networks. For the issue of the best service path selection, this paper proposes a distributed service path selection algorithm under central control. Each node generates routing tables based on the first function and destination node in service request. The controller monitors the network in real time, regulates paths with high costs and balances the bandwidths and loads of the network. Performance analysis and simulation results show that the distributed routing tables can generate efficient service paths and the convergence time is proportional to the number of functions. When the proportion of central control is 30 percent, the algorithm has a good performance on average cost of paths and load balance. The response delay to service request decreases almost 50 percent compared with other algorithms.