In this paper, the computational problems of packet transmission probability (PTP) in a computer communication network (CCN) under flooding routing are investigated. To avoid a congestion under this routing, two control methods are considerd, i. e., copy storage control and hop count control. Problems of PTP under flooding routings with these two control methods are respectively shown to be equivalent to those of source-to-terminal reliability(STR) with an exception for a case of hop count control where the hop count is less than the length of the longest path. For this exceptional case, an efficient computational algorithm for PTP is developed. This algorithm is proposed as an efficient tool for the determination of hop count which satisfies a given reliability constraint. A numerical example illustrates a proposed algorithm.