Data Transmission Reliability of a Two-source Single-sink Computer Network with a Common Arc

In a multi-state network (MSN), data can be transmitted through different paths. The previous literatures focus on the cases with arc-disjoint paths, but not the cases in which the paths have a common arc. In this work, we consider the case that two source nodes are sending data to the sink node through their own minimal paths (MP), where these two MPs possess a common arc in the computer network. Each source node generates a data sequence. The time intervals of the generated data are randomly distributed. Also, the amount of the data generated in different time instants are randomly distributed. These two variables can be obtained by the Monte-Carlo simulation method. As all the data are transmitted through a common arc, the data need to compete for the priority using the arc and conflictions may be caused. We consider the case that the two MPs are in connection and calculate the reliabilities of the data under their transmission time constraints. Simulation results reveal that the conflictions could prolong their transmission time and thus affect their reliabilities. This work may provide a cross-reference for managers to decide the amount of the data and the time intervals to get the ideal network reliabilities.