大型网络优化管理中协调信息的传递路由

Transmission Routings of Coordination Messages for the Optimal Management of Large-scale Networks

对大规模网络分解 -协调过程中产生的协调信息在网络中的传递问题进行了研究 ,根据两种不同的优化目标 :总的通信代价最小和各代理的最大等待时间最小 ,提出了两种不同的中央代理选取原则 :中央代理到其它代理的最短路径总长和中央代理按最短路径发信息到其它代理所用时间是所有可能方案中的最小者 ,并分别给出确定协调信息传递路径的算法 .

The transmission of coordination messages caused by the decomposition-coordination process in large-scale networks was investigated.Two principles,one is that the shortest total distance from the central agent to other agents is the minimum one of the distances of all possible schemes,the other is that the time cost of the message transmission from the central agent to other agents following the shortest distance is also the minimum one,which are used to select the central agent were proposed according to two different optimized objectives,such as the minimum communication cost and the minimum waiting time of each agent.The corresponding routing algorithms for coordination messages were also provided.An example was finally given by which the process of selecting the optimal central agent via the two algorithms was illuminated.