The Evaluation Model of Network QoS Based on Intelligent Water Droplets Algorithm

In order to solve the problem of the user demands to the quality of service (QoS) of network, this paper provides a novel QoS evaluation model based on the intelligent water droplets (IWD) algorithm. +e model firstly gives the evaluation indexes of network QoS and establishes a multiobjective optimization function for solution in combination with the improved IWD. +en, mathematical simulation is used to conduct the in-depth study of the key factors influencing the evaluation model. Compared with the other methods, the algorithm has shown better adaptability in the simulation results.


Introduction
Web services with the same or similar functions continue to emerge with its increasing number. Although web service composition technology can find service combinations that meet user needs, the combinations are with similar functions and lacks evaluation parameters other than functional attributes, so it is difficult to choose the best service from them. e way, to efficiently implement service selection and combination among different quality of service (QoS) candidate service sets, has become a key link in building a highly reliable and high-quality combined service. QoSbased Web service recommendation can be divided into two categories [1][2][3][4][5][6][7]: one is to model the service selection with multiple QoS constraints as a directed acyclic graph optimal path problem and give a service selection algorithm based on this model; the other is to establish QoS ontology with the description and deduction ability of which the accuracy of service matching can be improved.
A large amount of evaluation indexes are proposed for the network QoS. Wang [8] proposed a typical QoS-aware web service orchestration engine and used a three-layered pyramidal structure to capture the requirements of the customers, characteristics, and behaviors of engine. Tran et al. [9] proposed a novel approach for designing and developing a QoS ontology and its QoS-based ranking algorithm for evaluating web services. e QoS ontology could support not only describing QoS information in great detail but also facilitating various service participants expressing their QoS offers and demands at different levels of expectation. Luo et al. [10] presented a novel QoS prediction approach to serve this purpose through the combination of fuzzy neural networks and adaptive dynamic programming. e experimental results on a large-scale QoS service dataset verified the prediction accuracy of this approach. Chen et al. [11] have studied QoS dependency-aware service composition considering multiple QoS attributes, and it takes advantage of vector ordinal optimization techniques to search for Pareto optimal composition solutions with QoS dependency involved. Luo et al. [12] presented a data-driven scheme of predicting the missing QoS values for the IIoT based on a kernel least mean square algorithm, in which kernel least mean square algorithm was used to analyze the hidden relationships between all the known QoS data and corresponding QoS data with the highest similarities. Parejo et al. [13] proposed a metaheuristic algorithm for performing QoS-aware web service composition at runtime. Mao et al. [14] proposed a search-based prediction framework to address the QoS ranking problem, and a fitness function for an ordered service sequence is defined to guide search algorithm to find high-quality ranking results. Ding et al. [15] addressed the issue of selecting and composing web services via a genetic algorithm and gave a transaction and QoS-aware selection approach. Temglit et al. [16] proposed a distributed and optimal QoS selection approach based on multiagents paradigm and distributed constraint optimization formalism, and it takes into account the specificities of the service composition context and the satisfaction of the global user's constraints. Gu et al. [17] proposed an agent-based distributed QoS multicast routing algorithm, and it takes advantage of the cooperation of different agent groups to find the optimum multicast routing that satisfies the QoS constraint. Huang et al. [18] presented an efficient service selection scheme to help service requesters select services by considering two different contexts: single QoS-based service discovery and QoS-based optimization of service composition. Lo et al. [19] presented a local neighborhood matrix factorization application that incorporates domain knowledge in artificial intelligence technique, and it integrated the geographical information to build up an extended matrix factorization approach for personalized QoS prediction. However, most of the existing evaluation methods for the QoS are based on describable quality attributes or reputable recommendation information by default, so the evaluation results may become inaccurate.
In order to recommend high-quality services to users, a key issue is how to obtain quality parameter values for web services, which are generally represented by QoS. However, in practice, the QoS of most web services is unknown to users. In addition, the QoS parameters of web services are affected by factors such as the network environment. As a result, users at different locations may observe different QoS values on the same service. Although the user can call the web service to evaluate its own QoS, it is not realistic to accurately evaluate the QoS of a large number of candidate services in a short time since the users are not experts in evaluating the service.
With the studies above, in order to further fulfill user demands on network QoS, the paper provides a novel QoS evaluation method on the basis of improved intelligent water droplets (IWD). e IWD, with high self-organization, is a novel algorithm merging probability choice and heuristic search and very adaptive to complex problems. is paper considers the number of users on the web as that of water droplets, and the drop rolling rule is regarded as the evaluation index of service quality. e process of water droplets optimization is considered as that of service quality optimization and the group that has used the service is considered as the sediment taken away. e best web service can be found out with the continuous iteration and update therefrom. e paper provides the evaluation indexes for the network QoS and then establishes a multiobjective optimization function to solve the problem with the IWD.

Evaluation Indexes on Web Services
Because there are a large number of candidate web services, it is not feasible for users to experience all services and then make a decision. Service recommendations can be made by referring to the QoS history of other users, while most existing service recommendation methods use the QoS history record of all users. Due to the large amount of QoS data, the time complexity of service recommendation is exorbitant and the real-time capability is not strong. Moreover, different users have different interests that may make users not to access some certain services, which may just meet the user's requirements for QoS performance, resulting in a decrease in the accuracy of the recommendation. Although web service composition technology can find service combinations that meet user needs, the result is a batch of service combinations with similar functions. In addition, there is a lack of evaluation parameters other than functional attributes, so it is difficult to choose the best service, too. To solve this problem, a web service quality composition method based on nonfunctional attributes is proposed.
e evaluation of network QoS, adopting specified tools and methods, is an active procedure for the objective evaluation and measurement of the QoS, according to certain standards and rules. Many important attributes can be used to measure the network QoS, like the latency, the accuracy and the reliability. e quality vector of a certain web service w is defined as Q(w) herein. When the service is being used, the QoS may be different from the predefined value, and the user may consider QoS quite poor because of the large difference. In order to analyze the deviation between the actual value and the predictive value of QoS, the paper defines the evaluation indexes for the network QoS. For web service w, making the predefined quality vector be Q(w) � (Q 1 , Q 2 , . . . , Q n ) and the actual quality vector be Q ′ (w) � (Q 1 ′ , Q 2 ′ , . . . , Q n ′ ), the evaluation value of the network QoS will be If P(w) ≥ 1, the actual QoS is or better than the predefined one; if P(w) < 1, the QoS is poor; if P(w) < 0, the web service is nearly unavailable. For the service w, users can select different types of it based on the historical evaluation, which can be set as the recommendation reliability ξi of the service w; for service w, making p w(k) i be the satisfaction evaluation to the quality attribute q ∈ Qw (Qw is the set of the quality attributes of the service w) of web service w by the user i, and Yw be the set of user group who have used service w; the satisfaction of user i and the user group Yw to certain quality attribute k of the service w is erefore, the satisfaction to the service w can be expressed by where |K| is the number of the quality attributes in service, so the reliability of the recommended service w is 2 Discrete Dynamics in Nature and Society where χ is the set of the services commented by user i. In actual web service, due to different experiences and environments of users, it is not enough to consider solely the reliability of the recommendation. erefore, the paper takes the preference similarity into consideration, and the preference similarity of users i and j in service w is where q k i,w � q 1 i,w , q 2 i,w , . . . , q k i,w , . . . , q n i,w is the evaluation set of all attributes of service w given by user i after using service, and similarly, q k j,w � q 1 j,w , q 2 j,w , . . . , q k j,w , . . . , q n j,w is the evaluation set of all attributes of service w given by user j.
Setting user i as the service applicant and user j as the service recommender who used service w before, the evaluation results of the service w by the user i are Meanwhile, mean absolute deviation (MAE) is used to represent the reliability; the smaller the MAE, the higher the QoS. MAE is as follows: where p i � p 1 , p 2 , . . . , p N represents the evaluation set of the users and q i � q 1 , q 2 , . . . , q N represents the actual score set.
In combination with the satisfaction ϕ, the reliability ξ, the preference similarity ψ, and the MAE, the objective optimization model is defined as follows: Objective function: Constraint conditions: αϕ + βξ + cψ > 0, where the objective function z is used to obtain the optimal QoS of web, and α, β, c, and λ are weight coefficients. According to the services in the set S, the preference similarities of users i and j in each service are synthesized, η is set to be the threshold value of set S, and formula (9) stands for the preference similarity. When the recommendation reliability is lower than ρ, the system will automatically ignore the service and only adopt reputable users' comments in the evaluation of QoS attributes. e click rate of each service determines users' knowledge to it, so the paper uses the factor δ(i, w) � sumiw/ N sumjw to modify the evaluation value; in the formula, sumiw is the service wused by user i and Y W is the number of users who used the service w, and formula (10) represents the modified QoS attribute.

Solution Algorithm
e objective function established above is a nonlinear programming problem, and its optimal solution is usually obtained through rapid convergence by using artificial intelligence algorithm. By imitating the natural process of water droplets dripping, the IWD has the advantage of solving nonlinear problems quickly. erefore, this paper improves the intelligent water droplet algorithm for the objective function mentioned above. e improved algorithm maintains the diversity of the population through mutation and exchange methods and adopts the optimal selection method to accelerate convergence and improve the speed as well as accuracy of service optimization problems at the same time. e IWD belongs to successive searching algorithm, of which the basic idea is, by dividing paths, the water droplets move in dispersed steps. e water droplets have two attributes of movement velocity v IWD and sediment content s IWD , which are updated with the position change of the water droplets; the IWD has the main characteristic of evaluating the minimum value of the divided paths.
Corresponding to the abovementioned objective function of web service quality, this paper considers the number of users in the web as that of water droplets, the path of water droplet seeking segmentation as that for finding services in the network, the speed of motion as that of users finding services, and the process of water droplets optimization as that of service quality optimization. In addition, the rule of water droplets rolling down is regarded as an evaluation index of service quality. e groups who have used the service are regarded as the sediment taken away, and each water drop is regarded as a different service in the web service. Each optimization cycle filters a service that carries the most sediment and iterates through this to find the best service in the web service. e solution steps are as follows: Step 1: initialized: making the number of users be N, velocity update be coefficient z, the searching velocity of user be v IWD , the number of users who have used the service be s IWD , the maximum number of iterations be Max, and the number of optional service path be k.

Discrete Dynamics in Nature and Society
Step 2: on the basis of the initialized parameters, the satisfaction ϕ, the reliability ξ, the preference similarity ψ ,and the MAE, the adaptability of QoS objective function is calculated: where k stands for a constant, k > 0, and the minimum value of the adaptability in the first iteration is stored in the array A[]; the optimal solution of each iteration is expressed by OPT, so as to evaluate all service paths.
Step 3: making the probability of a user moving from service i to service j be p i,j , its velocity increment Δv IWD and the number of users who have used the service s IWD are in nonlinear inverse proportion: ,. erefore, the searching velocity of the users meets Δv where a ′ , b ′ , c ′ , and z are weight parameters.
Step 4: making the number of users who have used the service meet s IWD � s IWD + Δs IWD ; the reduced number of groups is where a, b, and c are constants other than 0 and the τ v IWD i,j is the time spent by the user moving from service i to service j at the velocity v IWD ; HUD is an inverse heuristic function, representing the extent to which users refuse to use other services, which is in direct proportion with the distance between the service i and the service j, so the number of users from service i to service j is where ω + μ � 1, and both ω and μ are decimals in (0, 1).
Step 5: for the multiple paths to find a service, the user often chooses a path with smaller groups. erefore, the probability of the user from service i to service j is p i,j � (f(s i,j )/ f(s i,k )), and σ is an optional smaller integer to ensure that f(s i,j ) is an effective value: where g(s i,j ) is to make sure that the number of groups between the service i to service j is not negative and min(s i,j ) stands for the minimum number of groups from service i to service j.
Step 6: the velocity and the number of groups are updated, and mutation operation is conducted to each user: Step 7: according to formula (23), interlace operation is conducted to the user meeting certain conditions with the optimal individuals obtained at the first time; meanwhile, the number of users seeking service path is constantly updated, which is more conducive to avoiding local optimum: Step 8: to determine whether the current number of iterations reaches the maximum value Max, if so, the A [] and the optimal solution OPT are output. Otherwise, the procedure goes back to Step 3 for repetition.
Step 9: the end.

Numerical Analysis
To verify the effectiveness of the improved IWD in QoS evaluation, the paper conducts a simulation experiment. Firstly, relevant parameters are set as follows: maximum number of iterations Max � 100, z � 0.05, a � 0.6, b � 1.2, c � 1.4, a ′ � 0.5, b ′ � 1.5, and c ′ � 1.2. e number of users who used the service w: Yw � 120, and the threshold value of the recommendation reliability ρ � 1. e number of water droplets N � 100, and the initial sediment content and the initial velocity are 0. In Figure 1, the paper compares the MAEs change of the three algorithms (BA, POS, and IWD) along with the change of the reliable recommendation number, and it is can be seen from the figure that the IWD has a great advantage that the MAE of IWD is smaller than that of the other two algorithms regardless of the reliable recommendation number. As mentioned before, the smaller the MAE value is, the better the recommendation reliability of the service will be, proving that the quality of the service is better than that of others. Of course, the figure also reflects that the MAE of the service is reducing along with the increase of the reliable recommendation number, showing that the recommendation reliability of the service is increasing. Meanwhile, each of the three algorithms of BA, POS, and IWD is used to calculate for 100 times, respectively, in this paper to count how many times each algorithm can find the optimal solution as well as the average value and the worst value of the evaluation service quality, as shown in Table 1. It is shown that the optimal solution times and the evaluation values of the QoS in different algorithms are greatly different. Among the three algorithms, IWD has better performance and can effectively find the web service with the best quality. Meanwhile, Figure 2 shows the variation of the number of optimal solutions in IWD along with the iteration, and it can be seen that the number of the optimal solutions increases with the increase of iteration. In addition, Figure 3 shows that the convergence time also increase along with the iteration increase. erefore, the convergence time and the number of the optimal solutions need to be considered in a comprehensive manner, which needs repeated experiments to find an equilibrium point.
In Figure 4, the paper compares the convergence precisions of the iteration in BA, POS, and IWD algorithms, and it is shown that the convergence precision of the algorithms reduces along with the iteration increase; even so, the convergence precision of IWD is higher than that of the other two algorithms. From what has been discussed above, it can be concluded that the IWD has a great advantage in evaluating the network QoS and is capable of recommending web service with better quality. Figure 5 illustrates QoS evaluation results along with the iteration change in the IWD; it can be seen that the iteration times can greatly influence the QoS and their relationship is nonlinear. When the iteration value is between 40 and 50, it is clear enough to see that the QoS achieves a peak value. However, the QoS is not always increasing along with the increase of the iteration, which can be influenced by other factors. erefore, comprehensive consideration of different factors is required in QoS selection.

Conclusions
Users can obtain their accurate QoS historical data in a real runtime environment by using a web service. us, by introducing the QoS history of the service into the web service recommendation, the accuracy of service recommendation can be improved. Since the network QoS cannot meet users' demands in many aspects, this paper provides a QoS evaluation method based on the IWD. IWD is a novel algorithm in the field of swarm intelligence algorithm, simulating the process by which the natural environment interacts with the water flow to form a river channel and can be used to solve some complex scientific problems. e service quality evaluation model is established by combining the service evaluation index system with the mathematical model of intelligent water droplets algorithm. e experimental results also prove the feasibility of the method, and in the future study, on the web service, a complete evaluation system can be established by referring to this paper.

Data Availability
e data used to support the findings of this study are included within the article.

Conflicts of Interest
e authors declare that they have no conflicts of interest.   Discrete Dynamics in Nature and Society