## 4 Evaluation Results and Discussion
### Performance Analysis
#### 4.2.3 Analysis of the First Scenario of \(VNR_{1}\)  
The SP-related mechanism favors the shortest of the candidate paths. Thus, the paths with the lowest hop count are evaluated as the most preferred and ranked first, while the longest paths are placed at the bottom of the ranking table. Its simplistic approach does not provide the ability to compute the more favorable among paths with the same hop count, making this choice completely arbitrary without the development of a separate dedicated procedure. On the other hand, the delay-driven methodology explicitly prefers paths with the best \(L\) profile. After calculating the values of \(L\) for all candidate paths, the algorithm unidimensionally focuses on promoting the networking elements that may provide application functionality based on lower delay values. However, as the conducted research has already established, the allocation of resources for complex and sensitive user-centric applications demands a more comprehensive approach. The proposed PA-enabled QUAKE metric creates a four-dimensional performance-oriented profile for each examined path. Specifically, the developed framework commences by examining the incoming VNR and characterizing it according to its application category. After identifying the profile of the processed request, the Wii classification algorithm dictates the preferred exact weighting combination of \(w_{1},w_{2},w_{3},w_{4}\), which suits the VNR's customized specifications. The Wii customization stage is followed by the computation of the QUAKE values for all calculated paths. The framework then enters the path classification phase. The multidimensional description provided by the designed solution enables the accurate ranking of SN paths and the promotion of those that suit the examined scenario. Table 10 shows the path evaluation and ranking results of the specific trial. Values color-coded green are more desirable than their red counterparts. The intermediate color schemes from green to red represent the deterioration of the effectiveness of each metric. It becomes clear that the directions indicated by the compared strategies diverge significantly from each other. Figure 8: QUAKE’s reaction to the Wii #10-based influence of (**a**). PJ, (**b**). L, (**c**). \(RNR^{norm}\), and (**d**). \(RCR^{norm}\), for \(VNR_{2}\). After excluding the first two cases of the \(BAF\) and \(BEF\) paths, which are common to all counterparts, the SP- and delay-based mechanisms fail to produce reliable path gradings. Specifically, the three-hop \(BAEF\) path would be suggested as a prominent candidate, despite its unacceptable \(P\)\(J\) values. The same ranking behavior is exhibited by the delay-driven strategy, by focusing only on the low \(L\) value of the \(BAEF\) path. The situation becomes more dire considering that the \(BAF\) and \(BEF\) paths may be unavailable for participation in a VNR embedding, due to insufficient CPU or BW resources. QUAKE, on the other hand, provides a variety of candidate paths that satisfy the orientation for simultaneously significant values for \(P\)\(J\) and \(L\). Specifically, QUAKE highlights 33.3% more consecutive paths than the SP- and the delay-based algorithms. Paths \(BAF\), \(BEF\), \(BEAF\), \(BCDGF\), \(BCDEF\), and \(BAEF\) pose as satisfactory choices for \(VNR_{1}\) and are thus ranked accordingly by QUAKE, in contrast to the SP- and \(L\)-oriented solutions that classify only \(BAF\), \(BEF\), and \(BEAF\) at high-ranking positions. After calculating all possible paths of the experimental SN regardless of starting and ending node, it can be discerned that the adopted QUAKE methodology critically outperforms the legacy path evaluation strategies. In particular, the data presented in Table 11 demonstrate that 45 of 72 otherwise highly acceptable two-hop and three-hop paths, promoted by the SP strategy, are constrained to moderate QUAKE values.