基于SimEvents仿真获取网络不交化最小路集

Generate Network's Disjoint MPs Based on Sim Events Simulation

从信息传递角度,将Co A网络转换为具有前向和逆向传输路径的信息传输网络;在对网络不交化MPs(Minimal Path sets)算法原理分析基础上,设计了信息在网络中的传输和改写规则(包括正向和逆向传输规则),并以离散事件仿真(Discrete Event Simulation,DES)为手段,对网络建模,对算法实现。以Sim Events为平台,阐述了基于DES进行算法实现的基本思路:即以实体(Entity)为信息载体,以节点为暂存和处理单元。仿真过程中,信息随实体在网络中传输,并不断改写,直至完成不交化MPs的生成。对桥型网络和复杂网络的仿真结果验证了信息处理规则的正确性,和基于DES进行算法实现的可行性。

The disjoint MPs（Minimal Path sets） algorithm proposed was improved from the point of signal transmission. The Co A network was transformed into a corresponding signal network, which was composed of forward and backward transmitting paths. According to the basic principle of disjoint MPs algorithm, a set of signal transmitting and rewriting rules, including forward and backward processing rules, were designed to make the disjoint MPs could be generated by means of DES（Discrete Event Simulation）. The basic realizing idea was studied in Sim Events, in which, the entities acted as the information carriers, and the nodes as the message storage and processing units. During the operation of the network model, messages carried by entities will be constantly rewritten and transmitted before all the entities arrived to the terminal node. Until then, all the disjoint MPs could be automatically generated. The simulation results of bridged network and a more complex one verified the correctness of the transmitting rules and the feasibility to realize this algorithm by means of DES.