Get Network’s Disjoint MPs Based on Discrete Events Simulation

DOI

10.2991/icitmi-15.2015.126How to use a DOI?

Keywords

Network’s reliability; Disjoint Minimal Path sets; Discrete event simulation; SimEvents

Abstract

From the point of message transmission and processing, this paper puts forward a new disjoint Minimal Path sets (MPs) algorithm to get the disjoint MPs of networks and trys to realize it by means of Discrete Events Simulation (DES). In the new method, the arcs of CoA network are regarded as processing units, nodes as storage units, and network as message transmission network. Taking SimEventsÒ as the platform, the modeling idea of nodes, arcs and message transmission network are described in detail. An example verifies the correctness of the processing rules and the feasibility of using DES to generate the disjoint MPs automatically.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jian Tang
AU  - Tao Han
AU  - Jianhu Yuan
AU  - Faming Shao
PY  - 2015/10
DA  - 2015/10
TI  - Get Network’s Disjoint MPs Based on Discrete Events Simulation
BT  - Proceedings of the 4th International Conference on Information Technology and Management Innovation
PB  - Atlantis Press
SP  - 758
EP  - 764
SN  - 2352-538X
UR  - https://doi.org/10.2991/icitmi-15.2015.126
DO  - 10.2991/icitmi-15.2015.126
ID  - Tang2015/10
ER  -