## 6 Results  
This section will present the performance evaluation of our proposed method through the utilization of suggested examples and data. We will conduct the assessment by sequentially considering specific scenarios to demonstrate the effectiveness of the method for transmitting messages through different routes. We will provide examples that illustrate the formation of routes between vertices (stego nodes) within the graph (network system) and calculate the secrecy index in Case 1. Example 1: Consider a small experimental steganographic network diagram consisting of stego nodes A, B, C, D, E, and F arranged as shown in Figure 10. Each network interface (edge) is utilized to transmit covert data from one transmitting stego node to another. Each network interface has a predefined secrecy index (\(P_{con}\)). We have conducted the computation of \(P_{con}\) and \(P_{nk}\) between node A and all other nodes (B, C, D, E, F) within the steganographic network in two distinct scenarios. In the first scenario, we employed a fixed routing approach, which utilized [PERSON]'s algorithm. In the second scenario, we adopted a modified routing model, which employed a modified of [PERSON]'s algorithm. In this context, node A serves as the sender, while nodes B, C, D, E, and F represent various recipients within the steganographic network. Table 1 contains specific parameters for each network interface. \begin{table}
\begin{tabular}{c c c} \hline \hline
**Network Interface Type** & **Bandwidth (bit/s)** & **Delay (s)** \\ \hline Ethernet & \(10^{7}\) & \(10^{-3}\) \\ Serial Link (T1) & \(1544\times 10^{3}\) & \(0.02\) \\ Serial Link (E1) & \(2048\times 10^{3}\) & \(0.02\) \\ Token Ring (4 Mbps) & \(4\times 10^{8}\) & \(3.5\times 10^{-3}\) \\ \hline \hline \end{tabular}
\end{table} 
Table 1: Information about network interface types. Step 1: Calculating OSPF Metrics. Using the proposed parameters and the provided Equation (1), we computed the OSPF metrics. With the suggested secrecy index from [55], where k1 = 1, k2 = 0, k3 = k4 = 1, we proceeded to calculate the OSPF metrics. The results are presented in Table 2.  
Based on the results obtained in Table 2, we obtained information about the metrics and secrecy indices as shown in Figure 11:  
Step 2. Establishing Data Transmission Routes. In this step, utilizing the modified version of the Dijkstra algorithm [13], we will determine sets of data transmission routes along with their associated metrics. The algorithm's execution steps are detailed in Appendix A. Table 3 summarizes the primary routes (shortest paths) and backup routes. Here, \(\mathrm{D_{i}}\) represents the sets of metrics for primary routes, \(\mathrm{L_{i}}\) represents the sets of primary routes, \(Z_{i}\) represents the sets of backup routes, and \(\mathrm{S_{i}}\) represents the sets of metrics for backup routes. \begin{table}
\begin{tabular}{c c c c} \hline \hline
**Stegochanel** & **C** & \(P_{con}\) & **Metric** \\ \hline AB & 2,048,000 & 0.4 & 35 \\ AC & 2,048,000 & 0.5 & 33 \\ BD & 1,544,000 & 0.1 & 59 \\ BE & 10,000,000 & 0.3 & 8 \\ BC & 4,000,000 & 0.1 & 23 \\ CE & 4,000,000 & 0.2 & 21 \\ DC & 4,000,000 & 0.5 & 17 \\ DF & 2,048,000 & 0.1 & 44 \\ EF & 2,048,000 & 0.6 & 31 \\ \hline \hline \end{tabular}
\end{table} 
Table 2: OSPF metrics with secrecy index. Figure 10: Example 1 of a steganographic network system. Example 2: Consider a small steganographic network topology consisting of stego nodes A, B, C, D, and E arranged as shown in Figure 12. Each network interface (edge) is used to transmit hidden data from one transmitting stego node to another receiving node. Each network interface has a secrecy index (\(P_{cont}\)) assigned to it. We undertook the computation of \(P_{cont}\) and \(P_{nk}\) between node A and all other nodes (B, C, D, E) within the steganographic network in two distinct scenarios. In the first scenario, we employed a fixed routing approach, specifically using [PERSON]'s algorithm.