Research on Intelligent Scheduling Mechanism in Edge Network for Industrial Internet of Things

With the vigorous development of the Internet of Things, the Internet, cloud computing, and mobile terminals, edge computing has emerged as a new type of Internet of Things technology, which is one of the important components of the Industrial Internet of Things. In the face of large-scale data processing and calculations, traditional cloud computing is facing tremendous pressure, and the demand for new low-latency computing technologies is imminent. As a supplementary expansion of cloud computing technology, mobile edge computing will sink the computing power from the previous cloud to a network edge node. Through the mutual cooperation between computing nodes, the number of nodes that can be calculated is more, the types are more comprehensive, and the computing range is even greater. Broadly, it makes up for the shortcomings of cloud computing technology. Although edge computing technology has many advantages and has certain research and application results, how to allocate a large number of computing tasks and computing resources to computing nodes and how to schedule computing tasks at edge nodes are still challenges for edge computing. In view of the problems encountered by edge computing technology in resource allocation and task scheduling, this paper designs a dynamic task scheduling strategy for edge computing with delay-aware characteristics, which realizes the reasonable utilization of computing resources and is required for edge computing systems. This paper proposes a resource allocation scheme combined with the simulated annealing algorithm, which minimizes the overall performance loss of the system while keeping the system low delay. Finally, it is veriﬁed through experiments that the task scheduling and resource allocation methods proposed in this paper can signiﬁcantly reduce the response delay of the application.


Introduction
e rapid development of technologies such as the Internet of ings has brought mankind into a new era of intelligence. e rapid popularization of high-speed Internet has brought about continuous growth in the amount of websites and data. e massive amount of data has promoted the evolution of the entire computing model and also put forward higher requirements on data storage and processing technology [1]. However, due to the disadvantages of traditional cloud computing technology, such as insufficient bandwidth, real-time performance, and high energy consumption, it has been unable to efficiently process massive amounts of data [2]. erefore, edge computing emerged as a new computing model, which extends data to the edge of the network on the basis of cloud computing to achieve the overall performance of the Internet of ings technology [3,4].
Edge computing brings convenient services in the face of complex network environments and diverse application services, but it also brings a series of new problems and challenges, such as the configuration of computing resources and task scheduling. Literature [5] puts forward the theory of edge computing on the basis of cloud computing and transmits data to the edge of the Internet to improve the overall availability and scalability of the system; literature [6] puts forward the theoretical basis of fog computing for the first time, and the technology is also by configuring computing and storage devices at the edge of the Internet to reduce the amount of Internet data transmission, so as to achieve the purpose of reducing latency and saving bandwidth [7]. Compared with fog computing, edge computing technology pays more attention to the collaboration of resources between edge nodes and can handle data upstream of the cloud or downstream of the Internet of ings very well [8]. Resource allocation and task scheduling optimization in edge computing technology is one of the important research issues of this technology, and its implementation plan directly affects the utilization rate of resources and the service experience of users [9]. Literature [10] integrates optimization problems in edge computing scenarios and sorts out a number of optimization indicators according to the optimization scenarios. For the problem of resource optimization and allocation of edge computing, Brogi et al. sorted out the types of optimization algorithms, optimization goals, and constraints [11]. Aiming at the task scheduling problem, literature [12] specifically studied three task scheduling methods. e first method is concurrent, the second is FCFS (first come, first served), and the third method is allocated according to delay priority. In the first method, the acquired tasks are allocated to edge devices for processing, and there is no need to care about the usage of each device. In the second method, the acquired tasks will be processed in sequence according to the entry order. Only when the computing power of the edge node cannot handle the current task will the task be moved to the cloud for processing. In the delayed priority allocation method, the arriving tasks will be scheduled in the order of priority. When the edge computing resources are not enough, the low priority will be processed by the cloud. Research shows that although the number of tasks that can be executed at the same time is the largest in the first method, the equipment utilization is the highest, but because the resources that can be used for computing are limited, each task causes a large delay. In the second method, Since the order of task execution is carried out in order of priority, some tasks with lower priority will be sent to the cloud for execution, so this method cannot cope with some tasks with higher requirements for delay, and it also brings data transmission. Energy consumption is high. For this reason, literature [13] introduced a knapsack algorithm-based symbiosis search scheduling algorithm based on the above research. is method has significantly improved energy consumption, network utilization, and execution cost compared with the traditional knapsack algorithm and the FCFS method.
In order to make full use of the computing power of the edge server and further reduce the response delay of the application, literature [14] proposed a delay-aware application module management method oriented to the edge environment. Te-Yi et al. [15] divided the delay priority of different tasks and used heuristic algorithms to solve the problem of computing resource allocation, thereby improving the efficiency and quality of edge computing. According to the above-mentioned research findings, task scheduling and resource allocation in edge computing technology have attracted the attention of a large number of scholars, but the research on the two aspects of true comprehensive resource allocation and task scheduling needs to be further deepened.
is paper studies the problem of resource allocation and task scheduling for edge computing. First, through the realization of collaborative caching between different edge nodes, each edge node caches differentiated data, so as to train and obtain a submodel with greater difference. To achieve a more accurate edge integration model, second, use cache compression records and record sharing to achieve reasonable data distribution scheduling and caching, and finally design and implement the TCP/IP network node cache module in the edge computing framework.

Principle Analysis of Collaborative Cache for Edge
Computing. In order to improve the performance of edge computing, the process of edge computing is first studied. Integrated diversity, that is, the difference between submodels, is the key issue of integrated learning methods.
rough research, it is found that if the same submodels are combined, there will be no performance improvement; if there is a performance improvement after the combination, there must be a difference between the submodels. Tumer et al. [16] analyzed the simple soft voting integration method through decision boundary analysis. In order to keep it simple, assuming that all submodels have the same error rate, the θ term is introduced to describe the relationship between the different submodels, and the expected cumulative error after integration is shown in the following formula: In the above formula, err i (h i ) is the expected error rate of the submodel and n is the size of the integration scale. It can be seen from the formula that if the submodels are independent of each other, namely, θ � 0, the ensemble learning error will be reduced by n times. If each submodel is associated with all other submodels, namely, θ � 1, the performance of the integrated submodel will not be effectively improved. is analysis clearly reveals the importance of different submodels in ensemble learning, and the same conclusion is also applicable to other ensemble methods [17].
However, it is not easy to generate highly diverse submodels [18]. e biggest obstacle is that the submodels are obtained on the same task and the same training set, so there is often a high correlation between the submodels. Many theoretically feasible methods, such as the optimal solution of the weighted average method, are difficult to work in reality, and the situation may even be worse. In fact, the performance of the submodels should not be too bad; otherwise, the combined performance not only will not be improved but also will be reduced, which makes it more challenging to generate diverse submodels. If the performance of the submodel is poor, the cumulative errors after simple soft voting integration will continue to increase, and other integration methods have similar results [19,20].
If the submodels are independent of each other, the error of ensemble learning will be reduced. If each submodel is related to other submodels, the error of ensemble learning will become larger.
is analysis clearly reveals the importance of the different submodels. In this case, it is necessary to implement collaborative caching between different edge nodes, and each edge node caches differentiated data, so as to train a submodel with larger differences and realize a more accurate edge integration model.

Cache Compression Records and Record Sharing.
e compressed record of the cached data plays an important role in the intelligent scheduling of the cache. e efficient compression recording method can record the data information cached by each edge node and realize the exchange and collection of cache information between edge nodes. e cache intelligent scheduling scheme can reasonably schedule the cache according to the data distribution and supports the distributed submodel learning and final integrated learning of each edge node, as shown in Figure 1. In this section, we mainly introduce two parts: cache data record and record sharing.

Cache Data on Edge Computing Nodes and Record
Efficiently.
e data required for the training of the integrated learning model is collected from the neighboring user terminal equipment and transmitted to the edge node, and the edge node is cached in the LRU mode and is efficiently recorded using the combinable counting bloom filter (CCBF). e specific process is as follows: when the data arrives at a certain edge node, whether the data has been cached by querying the CCBF is judged. If it has been cached, the data is not cached; if it has not been cached, the data is cached using LRU and used CCBF performs highefficiency compression recording. e specific operation is as follows: use k hash functions to hash the data received by the edge node into k bit arrays and check whether the corresponding unit of orBarr in CCBF is 1; if it is 1, it means that the data has been cached, so do not proceed. If it is not 1, LRU cache is required. e implementation of LRU adopts the form of a linked list. When caching, it is necessary to determine whether the cache capacity of the edge node is reached. If the cache capacity of the edge node is not reached, the data is cached at the head of the linked list; if the cache capacity has been reached, it is the oldest. e used data is eliminated, and, through the pseudorandom number generator, the bit array corresponding to the unit of each hash function operation in the last insertion operation of the data is cleared to zero, the orBarr array is updated, and the cache record is cleared. en add the new data to the head of the cache linked list.
After adding the data to the cache, use the pseudorandom number generator to correspond to the bit array whose location unit (unit with subscript Hash j (d)) has been set to 1 according to the hash result. Randomly select a bit array barr i (the i-th bit array of CCBF) in the g bit array, set its subscript as Hash j (d) to 1, update the OrBarr array, and complete the update of CCBF.

Exchange and Merge Compressed Records of Cached
Data with Neighbor Nodes. e compressed representation of cached data (CCBF) is exchanged and merged with neighbors within a certain range in order to obtain a global view of the edge node cached data, and the subsequent cache scheduling process can be guided based on this global view. Once a node receives a compressed record of the neighbor node cache data from the interface, the compressed record will be stored with the name CCBF i , where i is the ID number of the corresponding edge node interface.
Use the ID number of the edge network node to exchange CCBF i , hash the received data into k bit array units through k hash functions, and then query whether the orBarr unit corresponding to the neighbor node is 1; if it is 1, it means that the data has been existing in the cache data of the neighbor node, it is necessary to delete the redundant cache data, set the unit corresponding to the middle bit array of the node to 0, and update CCBF i the node. e original compression record of the edge node is merged with the received neighbor nodes. e specific operation is to first determine whether the amount of cached data represented by the merged compression has exceeded the capacity n of CCBF, and then, according to the different bit arrays label, merge each bit array in order, and update the orBarr array to get a global view of the edge network cache data. After merging, a global view of the data compression records cached in the neighbor nodes can be obtained, and this view will be used to guide the neighbor nodes to cache various data subsequently received.

Differentiated Adaptive Collaborative Caching.
e cache intelligent scheduling scheme can reasonably schedule the cache according to the data distribution and supports the distributed submodel learning and final integrated learning of each edge node. In this section, we mainly introduce the differentiated adaptive collaborative caching method for model learning.

Cache Different Data between Neighbor Nodes.
When an edge node requests to cache some data, it needs to determine whether the data already exists in the cache of the node and its neighbor nodes according to the global view of Security and Communication Networks the cached data. e specific operation is as follows: query, which represents a global view of data cached in neighbor nodes. Hash the cached data requested by the node k times to obtain k hash results, and check whether the corresponding array orBarr unit is 1; if the corresponding unit in the orBarr array is 1, it means that the data has been cached at this edge. On the network node, the data is ignored, no caching operation is performed, and the following data processing is performed; if the corresponding unit of the array in is 0, it means that there is no compressed record of the data in the cache, indicating the cache of other neighboring nodes. If the data is not included, the data is added to the cache of the edge node, and the compressed record of the data is added to the corresponding node. rough the above operations, it can be ensured that different data can be cached on neighboring nodes for training different submodels, and, at the same time, communication overhead can be reduced through collaborative caching.

Distributed Training of Submodels.
e data cached on a node is used to train the local submodel. When the local data is not enough to make the submodel converge, it is necessary to expand the scope of collaboration by requesting differentiated data from other edge nodes. By performing merging of orBarr in CCBF i of different neighboring nodes' cached data, the obtained cached data records of different neighboring nodes are compared with the cached data records of the local node to obtain the required data compression record CCBF i and send it to the corresponding edge node. When the corresponding edge node receives the request, it queries the cache of the local node according to orBarr and returns the differentiated data to the requesting node. After the requesting node receives the data, it caches the data and updates CCBF i and CCBF and then inputs the data into the submodel for training. Repeat these processes until the submodel converges.

Integrated Learning.
In order to reduce network data transmission traffic and ensure data privacy and security, the training results of the distributed submodels are uploaded to the data center, and the integrated results are obtained by assigning different weights to the output results of each submodel in the data center. e set output result H(x) is shown in the following formula: (2) In the above formula, ω i represents the weight of h, usually with the constraints of ω i ≥ 0 and n i�1 ω i � 1. e weights of these parameters in the submodel are uploaded to the central node, and the central node performs integrated learning. Specifically, for n sub-h 1 , . . . , h n models, the following methods are used for ensemble learning: p(x) is the distribution of the input, ϵ i (x) is the error term, and e optimal weight can be solved by the following formula: By Lagrangian multiplier method, ω i is obtained as shown in the following formula: (4)  LRU is the abbreviation of "Least Recently Used." It is a commonly used cache replacement algorithm. e cache data that has not been used the most recently is selected to be eliminated. e LRU cache in NS-3 mainly implements the function of caching data on each edge network node. In this section, the LRU cache on the TCP/IP edge network node is designed and implemented.

Design and Implementation of Node
First the implementation of LRU cache is introduced, followed by the way to implement LRU cache on the NS-3 platform. e specific operations are as follows: (1) e first step is to construct the code of the LRU cache, where the cache size needs to be set, so the function of LRU cache is used, and the capacity of the cache is set as a parameter of this function. e LRU cache is based on the encapsulated data packet as a unit for caching. e LRU cache mechanism uses the form of a linked list, placing the least recently used at the head of the linked list. It mainly includes three functions, namely, the addition, deletion, and search functions of cached data. e specific operations are as follows: (1) To increase the cache data (Memory), it is necessary to first determine whether the current cache has reached the capacity of the cache. If the cache capacity has been reached, delete the last one of the linked list, and then store it; if the cache capacity is not reached, store it directly at the head of the cache. (2) In the process of deleting the cached data (Remove), when the cache capacity is not enough, the last data in the linked list represents the most recently unused data, and it is deleted. (3) In the process of looking up cached data (Lookup), if the data is not found, -1 is returned; if it is found, the value of the data is returned, and then the data is placed at the head of the cache. (2) Implement LRU cache on the NS-3 platform.
To implement LRU caching on the NS-3 platform, you need to add a custom LRU caching module to the original module of NS-3.
(1) First, the basic structure of NS-3 is introduced here.
src is the source code directory of NS-3, and the directory structure basically corresponds to the compiled module. Each file in the src directory basically corresponds to a module, and the structure of all modules in it is basically the same.
(2) en, according to the design of NS-3, the implementation of LRU cache is added to NS-3 as a custom module.

Edge Network Node Deployment.
is paper deploys the edge network tree topology as shown in Figure 2. As shown in the figure, it includes a remote data center, a gateway node, four edge computing nodes, and eight terminal devices, which are connected through a gigabit link, and the data transmission between them is point-to-point transmission. Peer-to-peer technology (P2P), also known as peer-to-peer network technology, is a new network technology that relies on the computing power and bandwidth of participants in the network, instead of concentrating all the dependencies on a few servers in the edge network topology. e cache size of each edge computing node is 2000 KB. Each edge computing node can cache data, efficiently record cached data, and perform computing tasks for cached data. e data required for neural network model training are all released by the terminal equipment node. e terminal device generates the learning data of the model and sends the data to the edge computing node. After the edge computing node receives the data, it first performs data caching and efficient recording and then uses the different data in the collaborative cache to train the submodel and finally sends the training results of the submodel to the data center for integrated learning. Background traffic data is released by remote data center nodes. e data center generates background traffic data and sends the data to edge computing nodes. After the edge computing node receives the data, it caches the data and sends the background traffic data to the terminal device.

Construction of Edge Network Node Learning Module.
In this article, the edge network node learning module is designed and implemented. When deploying a neural network model on the NS-3 edge simulation platform, the difficulty encountered is the joint compilation of the NS-3 platform and OpenNN. So, the method of joint compilation of NS-3 platform and OpenNN is introduced first, and then the process of edge integration learning based on OpenNN design pattern is introduced. e operation steps applied on the simulation platform of NS-3 are shown in Figure 3.
Because the NS-3 simulation platform is compiled with /waf, in the process of compiling the OpenNN neural network library, the newly added library needs to be included in the wscript file, and the corresponding library file needs to be included in the script. e specific operations are as follows: (1) Put the Eigen folder in OpenNN under the ndnSIM/ns-3 folder, which is the preliminary step of the joint compilation of OpenNN and NS-3. Eigen is a C++ template library for linear operations, supporting matrix and vector operations, numerical analysis, and related algorithms. Because OpenNN contains a lot of matrix operations, you need to use the Eigen library.  When using the OpenNN model, first include the OpenNN namespace, and then when using the OpenNN Vector vector, add "OpenNN:" in front, that is, OpenNN: : Vector * * * * * . In this way, the Vector vector in NS-3 can be distinguished from the vector in OpenNN. e ensemble learning process is closely related to different submodels. In the edge integrated learning scenario, different edge nodes often deploy similar models, build submodels by learning the data around the edge nodes, and finally distribute the submodels on different nodes through the central node to form an integrated model. In this case, it is necessary to provide different data for different edge nodes, so as to obtain the training results of different  submodels, so as to achieve a more accurate integrated model.
In this article, the integrated learning method based on the OpenNN design pattern obtains the results by assigning different weights to the output results of each submodel. e set output result is H(x), where H(x) � n i�1 ω i h i (x) represents the weight of ω i , usually with ω i ≥ 0 and n i�1 ω i � 1 constraints. e weights of these parameters in the submodel are uploaded to the central node, and the central node performs integrated learning. Specifically, for n submodels h 1 , . . . , h n , the following methods are used for ensemble learning.
Assume that the output of each submodel can be written as a true value plus an error term, as shown in the following formula: e integration error can be expressed as in the following formula: In the above formula, p(x) is the distribution of the input and ϵ i (x) is the error term. e optimal weight of can be solved by the following formula: By Lagrangian multiplier method, D is obtained by the following formula: (8)

Dataset.
In order to evaluate the performance of the collaborative caching scheme, this paper uses four datasets for learning. Specifically, two text datasets (D1 and D2) are used to train the MLP model. In order to train the VGG model, a tigerface image dataset (D3) and a human face dataset (D4) are applied.
(1) Covertype dataset (D1): this dataset includes the forest vegetation types of Roosevelt National Forest. ere are 4 types of soil, corresponding to 7 types of vegetation. e 581,012 data-item forest vegetation is divided into four soil types. e number of data items for different soil types is uneven. e number of type 4 is less than 3,000, and the number of type 5 is close to 10,000. e quantity of any other type is greater than 10,000.
(2) Healthy elderly dataset (D2): the sequential exercise data of 14 healthy elderly aged 66 to 86 years who used sensors to identify clinical environmental activities. Participants were assigned to two clinical room environments (S1 and S2). S1 (Clinical Room (1)) and S2 (Clinical Room (2)) are equipped with different sensor receiving numbers and positions. e number of data items is 75128, which is divided into 6 different behaviors on average. and each of them has 10 facial photos. According to the shooting angle (front position and side 45°), the dataset is divided into two scenes.

Validation Model.
is paper implements the two following learning models: the multilayer perceptron (MLP) model is used to train two text datasets, and the Visual Geometry Group (VGG) network model is used to train two image datasets. e model is introduced in detail.

Multilayer Perceptron (MLP) Model.
MLP is a feedforward artificial neural network that can map multiple input data to output data. Each layer of MLP is a fully connected layer.
is paper implements a six-layer MLP model, including an input layer, four hidden layers, and an output layer. e following describes the internal structure of the multilayer perceptron.
Neurons can be combined into a neural network. e structure of a neural network refers to the number, arrangement, and connectivity of neurons. Any kind of network structure can be represented by a directed label graph, where nodes represent neurons, and edges represent connections between neurons. e edge labels represent the parameters of the neuron and indicate the inflow of the neuron. Most neural networks, even biological neural networks, present a hierarchical structure. In this case, the working layer is the basis for determining the structure of the neural network. erefore, a neural network usually consists of a set of perception nodes that constitute the input layer, one or more hidden layers of neurons, and a set of neurons that constitute the output layer. As mentioned above, the characteristic neuron model of the multilayer perceptron is the perceptron. On the other hand, the multilayer perceptron has a feedforward network structure. e feedforward structure does not contain cycles; that is, the structure of the feedforward neural network can be expressed as an acyclic graph. erefore, the neurons in the feedforward neural network are divided into a series of layer h + 1 neurons L (1) , . . . , L (h) , L (h+1) , so that the neurons in any layer are only connected to the neurons in the next layer. e input layer is composed of n external inputs, not a neuron layer; the hidden layer L (1) , . . . , L (h) , respectively, contains a hidden neuron in s (1) , . . . , s (h) ; the output layer L (h+1) is composed of m output neurons. Figure 4 shows the network structure of the multilayer perceptron. ere are n inputs, h hidden layers, s (i) neurons, and i � 1, . . . , h and neurons are in the output layer. In this chapter, the superscript is used to identify the layer. e multilayer perceptron neural network can be regarded as a parameterized function space V from input X ⊂ R n to output Y ⊂ R m . e element form of V is y: X ⟶ Y. ey are parameterized by neural parameters, which can be combined in a d-dimensional vector ζ � (ζ 1 ), . . . , (ζ d ). erefore, the dimension of the function space V is d.
For the first hidden layer L (1), by formula (9), the combined function is obtained by adding the dot product of the weight and the input to the deviation, thereby obtaining According to formula (10), the output of this layer a (1) is obtained by the combination of conversion and activation function: Similarly, for the last hidden layer, the combined function is given by the following formula: e output of this layer is found by formula (12) by using the activation function: e output of the neural network is obtained by transforming the output of the last hidden layer by the neurons in the output layer F. erefore, the combined form of the output layer is shown in the following formula: e output of the output layer is transformed by formula (14) through the combination of the layer and activation into Combining the above equations, an explicit expression of the multilayer perceptron function is obtained in the following form: In this way, the multilayer perceptron function is represented by formula (16) as the composition of the layer output function: Multilayer perceptron can be regarded as a function of multiple variables formed by the superposition and addition of functions of one variable. Different activation functions produce different function families, and multilayer perceptrons can define these function families. Similarly, different neural parameter sets cause different elements in the function space defined by a particular multilayer perceptron.

Visual Group Network (VGG)
Model. VGG is a deep convolutional neural network for computer vision. e implementation of this paper includes 5 convolutional blocks, each of which consists of 2-4 convolutional layers. At the same time, a maximum pooling layer is connected to the end of each block to reduce the size of the picture. e number of convolution kernels in each block is the same, and the number of convolution kernels in the later block is larger. For five convolution blocks, each layer contains 64-128-256-512 convolution kernels, and, in this article, 10 convolutional layers are used and 4 pooling layers are alternately performed, and the specific arrangement is shown in Figure 5. Among them, the convolution layer uses a 3 * 3 convolution kernel, the activation function uses the ReLU activation function, that is, F(x) � max (0, x), and the training algorithm uses the Adam algorithm that can adaptively adjust the learning rate. e following describes the Adam optimization algorithm. e Adam optimization algorithm is an extension of the stochastic gradient descent algorithm. Recently, it is widely used in deep learning applications, especially tasks such as computer vision and natural language processing. Adam is different from the classic stochastic gradient descent method. Stochastic gradient descent maintains a single learning rate (called α) for all weight updates, and the learning rate does not change during the training process.
e Adam optimization algorithm maintains a learning rate for each network weight (parameter) and adjusts it individually as the learning expands. is method calculates the adaptive learning rate of different parameters from the budget of the first and second moments of the gradient. e following describes the Adam parameter configuration: α: it is called the learning rate or step size. It controls the weight update rate (such as 0.001). A larger value (such as 0.3) will have faster initial learning before the learning rate is updated, while a smaller value (such as 1.0E-5) will make the training converge to better performance. β 1 : it is the exponential decay rate of the first moment estimation (such as 0.9). β 2 : it is the exponential decay rate of the second moment estimation (such as 0.999). is hyperparameter should be set to a number close to 1 in sparse gradients (such as in NLP or computer vision tasks).
ε: this parameter is a very small number, which is to prevent division by zero in implementation (such as 10E-8). Table 1 describes the classification accuracy of the MLP and VGG models trained on different schemes. For different training models and datasets, the collaborative caching scheme and the centralized scheme both achieve similar high performance in accuracy. is is because the collaborative caching solution can provide more valuable training data to support model training, while the centralized solution can collect all training data to support model training. On the contrary, the solution of periodically requesting cached data cannot provide enough training data in a short time, which affects the training of the edge nodes by the submodel, thereby reducing the performance of the integrated result. Figure 6 describes the learning delay of different models under the three schemes. It can be seen from the figure that both MLP and VGG can use cooperative caching to achieve rapid convergence. ere is a maximum difference of 7000 seconds in the learning delay between the periodic request cached data scheme and the collaborative cache scheme. Within one to two hours, the collaborative caching solution provided enough cached data items for the submodel learning and integration process. Since the centralized solution collects all training data to support model training, the centralized model learning delay is less than that of the solution that periodically requests cached data. On the other hand, the centralized transmission delay is large, which also reduces the efficiency of centralized model learning.

Network Data Transmission Traffic Load.
e network data transmission traffic load is shown in Figure 7. It can be seen from the figure that regardless of the model or dataset, the network data transmission traffic load of the collaborative caching scheme is always the smallest, and more X n y m  Security and Communication Networks powerful models such as VGG will consume more communication resources. e network data transmission traffic load of the centralized solution is twice that of the collaborative cache solution. Because all learning data needs to be sent to the data center, the network data transmission traffic load of the centralized solution is the largest. In addition, data request and cooperative caching are beneficial to the cooperative caching scheme in terms of transmission overhead. More valuable data is cached on edge nodes, thereby reducing redundant data transmission between different edge nodes and reducing the transmission traffic load in the network.

Cache Hit Rate.
Since the centralized scheme trains the model in the data center and does not cache the data at the edge nodes, we only compare the cache hit rates of Centralized, P-cache, and the proposed C-cache. e local learning hit rate is shown in Figure 8. e overall learning hit rate is shown in Figure 9. e local learning hit rate of     C-cache and P-cache middle and background traffic data are reduced to 0.17 and 0.19, respectively. For different training models and datasets, the cache hit rate under C-cache decreases faster than that under P-cache. is is because C-cache can use learning data better than P-cache and reserves less available cache space for caching background traffic data.

Conclusion
As a complementary extension of cloud computing technology, mobile edge computing will reduce the computing power of the previous cloud to the edge nodes of the network. rough the cooperation between computing nodes, the number of nodes can be calculated, the type can be more comprehensive, and the calculation range can be larger. e emergence of mobile edge computing makes up for the shortcomings of cloud computing technology. Aiming at the problem of network edge cache computing and intelligent scheduling of resource allocation, in order to reduce network traffic load and delay, a simulation framework is finally established within the framework of effective recording cache data collaboration and edge computing learning framework to verify the network collaborative cache solution proposed in this paper. A large number of simulation results show that the collaborative caching scheme proposed in edge network can significantly reduce the learning delay and transmission cost of ensemble learning. In future studies, more datasets and more complex integrated learning models can be used to further improve the experiment. e edge integrated learning framework designed in this paper can be further optimized.

Data Availability
No data were used to support this study.