CN111629217A - XGboost algorithm-based VOD (video on demand) service cache optimization method in edge network environment - Google Patents

XGboost algorithm-based VOD (video on demand) service cache optimization method in edge network environment Download PDF

Info

Publication number
CN111629217A
CN111629217A CN202010311154.8A CN202010311154A CN111629217A CN 111629217 A CN111629217 A CN 111629217A CN 202010311154 A CN202010311154 A CN 202010311154A CN 111629217 A CN111629217 A CN 111629217A
Authority
CN
China
Prior art keywords
video
cache
edge server
model
ith
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202010311154.8A
Other languages
Chinese (zh)
Other versions
CN111629217B (en
Inventor
张晖
孙叶钧
赵海涛
孙雁飞
倪艺洋
朱洪波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN202010311154.8A priority Critical patent/CN111629217B/en
Publication of CN111629217A publication Critical patent/CN111629217A/en
Application granted granted Critical
Publication of CN111629217B publication Critical patent/CN111629217B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/21—Server components or server architectures
    • H04N21/218—Source of audio or video content, e.g. local disk arrays
    • H04N21/2183—Cache memory
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N20/00—Machine learning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/21—Server components or server architectures
    • H04N21/222—Secondary servers, e.g. proxy server, cable television Head-end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/258—Client or end-user data management, e.g. managing client capabilities, user preferences or demographics, processing of multiple end-users preferences to derive collaborative data
    • H04N21/25866—Management of end-user data
    • H04N21/25891—Management of end-user data being end-user preferences

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Medical Informatics (AREA)
  • Evolutionary Computation (AREA)
  • Data Mining & Analysis (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Physics & Mathematics (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Artificial Intelligence (AREA)
  • Computer Graphics (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

The invention discloses a VOD service cache optimization method based on XGboost algorithm in edge network environment, comprising the following steps: collecting video data; taking the average visit amount as a prediction target, and performing regression modeling by using an XGboost algorithm to obtain a prediction model; predicting the average visit quantity by using a prediction model; establishing a cache optimization model according to the prediction result; and (5) solving the optimization model by using a knapsack algorithm to obtain a final caching scheme. The invention considers that the edge server needs to process a large amount of video information and the excellent data analysis capability of machine learning in big data processing, thereby leading the edge server to reduce service access delay to the utmost extent and improving the cache efficiency of the edge server.

Description

XGboost algorithm-based VOD (video on demand) service cache optimization method in edge network environment
Technical Field
The invention belongs to the technical field of edge networks, and particularly relates to a method for optimizing VOD service cache based on XGboost algorithm in an edge network environment.
Background
With the development of scientific technology, ports and devices of various standards and various services and applications are connected to the internet, so that service requests in the network are increased explosively, and then data traffic in the network is also increased in a well-spraying manner, wherein the video traffic is mainly increased. The core network is an important component in the distribution of services and the provision of services. One of the main functions of the core network is to access requests entering the network through devices and interfaces of different systems to different service networks according to service requirements, so that each service request obtains the due service. Another main function of the core network is as a service side, processing service requests submitted by each interface. The core network itself includes a plurality of different service networks, and when a service request comes, the core network provides a service for the service, and with the explosion of the traffic, the amount of the service provided by the core network increases sharply, so that the core network bears a great load pressure in both the service request processing and the service providing.
The edge network is the part of the network closest to the user. The edge network, on the one hand, shares the processing pressure of the service request for the core network, and, on the other hand, puts the service provision to the edge network, and processes the service required by the service on the edge network side if the edge network has the capability of processing. However, since the computing power of the edge network is limited, the key to maximally offload the core network is how to improve the service efficiency, and the edge cache is the key to improve the service efficiency. The edge cache means that resources with higher service use frequency are cached on an edge server, when the related services come again, the resources are directly obtained from the cache, and the service requirements which cannot be met by the edge server are obtained from a core network.
In addition, with the advent of the big data era, efficient knowledge acquisition through machine learning has gradually become one of the main impetus for technical development in various fields, and the edge network field is no exception. In the big data era, with the explosive growth of data, various new data types needing to be analyzed are emerging continuously, such as semantic understanding, image analysis, network data analysis and the like, so that machine learning plays an extremely important role in the big data environment.
The existing video caching algorithm is usually dependent on the popularity of the video, wherein the most commonly accepted method is that the popularity of the video obeys zipf distribution, which is a conclusion obtained based on a user behavior statistical mode, the mode usually has larger hysteresis and limited reference indexes, so that machine learning has better service index analysis capability at the present time of service index diversification. The prediction of the video service directly influences the caching efficiency of the edge server, the caching hit rate is high, the time delay is reduced when the user acquires data at the edge side, otherwise, the user acquires the data from the core network, and the time delay is greatly increased.
Disclosure of Invention
The purpose of the invention is as follows: in order to overcome the defects in the prior art, the XGboost algorithm-based VOD service cache optimization method in the edge network environment is provided, the XGboost algorithm in machine learning is used for carrying out regression modeling and prediction on VOD service access amount, and a novel XGboost algorithm-based VOD service cache optimization method is provided on the basis.
The technical scheme is as follows: in order to achieve the above object, the present invention provides a method for optimizing a VOD service cache based on an XGBoost algorithm in an edge network environment, comprising the following steps:
s1: collecting video data;
s2: taking the average visit amount as a prediction target, and performing regression modeling by using an XGboost algorithm to obtain a prediction model;
s3: predicting the average visit quantity by using a prediction model;
s4: establishing a cache optimization model according to the prediction result;
s5: and (5) solving the optimization model by using a knapsack algorithm to obtain a final caching scheme.
Further, the obtaining of the prediction model in step S2 specifically includes: and carrying out regression training by taking the average visit quantity as a dependent variable and taking the rest characteristics as independent variables, dividing a data set, outputting importance ranks of all characteristic values, deleting the characteristics according to the ranks to obtain final modeling characteristic values, and modeling according to the modeling characteristic values to form a prediction model.
Further, parameter adjustment is carried out in a combined parameter adjusting mode in the process of modeling and forming the prediction model according to the modeling characteristic value, and the model with the minimum output square error is obtained and is the final model.
Further, the establishment of the cache optimization model in step S4 specifically includes:
setting the cache space size of the edge server as S, and the video volume set as V ═ V1,v2,…,vKThe video access amount is set as PV ═ PV }1,pv2,…,pvKAnd K is the total number of videos, so that the following cache optimization model is obtained:
Figure BDA0002457891770000021
wherein
Figure BDA0002457891770000022
Selection of optimal buffering for video, ak0 means that video k does not need to be buffered, ak1 indicates that the video k needs to be cached; a formula
Figure BDA0002457891770000023
There are two possibilities when akWhen 0, the formula is 0, and when a is not practicalkWhen 1, the ratio of the access amount of the video k to the video k volume is expressed, and the value is to balance the access amount and the video volume, so that the formula is defined
Figure BDA0002457891770000031
Representing the caching cost performance of the video k; constraint conditions
Figure BDA0002457891770000032
The sum of the volumes representing the cached videos should be less than the cache space of the edge server.
Further, the solving process of the optimization model in the step S5 specifically includes:
let c (i, j) be the sum of cost performance corresponding to the best caching mode of the front i part video when the remaining capacity of the current edge server is j, that is
Figure BDA0002457891770000033
The following recursion relationship is obtained:
Figure BDA0002457891770000034
the second formula of formula (3) is illustrated below: when the remaining capacity of the edge server is sufficient for the ith video to be cached, the ith video is not necessarily the optimal cache selection video, and thus two situations may occur, where the first situation is that the ith video is not the optimal selection, that is, the ith video is not cached, ai0, in this case:
c(i,j)＝c(i-1,j) (4)
the second case is that the ith video is the best choice, i.e. the ith video needs to be buffered, ai1, namely:
Figure BDA0002457891770000035
in the formula (5), viIs the volume of the ith video, c (i, j-v)i) The sum of the optimal cost performance obtained by the previous decision before the ith video is processed is added with the cost performance of the ith video on the basis, namely the total cost performance after the ith video is cached;
comparing the twoTaking the maximum value of the performance price ratio obtained under the condition that the residual capacity of the edge server is sufficient for the ith video to be cached, and finally obtaining the optimal caching scheme
Figure BDA0002457891770000036
The invention utilizes XGboost algorithm in machine learning to model and predict the access amount of VOD service. On the basis, a cache optimization model is provided, so that the service delay is reduced to the maximum extent, and the cache efficiency of the edge server is improved. On one hand, the XGboost algorithm in the scheme has high prediction accuracy and is very suitable for distributed occasions; on the other hand, the scheme is very simple and easy to implement, and has a good application prospect.
The invention gives full play to the advantages of machine learning in big data processing and enables the edge side. The advantage of using the cache is that the resource acquisition speed is high, and the cache can be replaced at any time, so that the change of service change with time on the use of the resource content can be flexibly met.
Has the advantages that: compared with the prior art, the invention firstly utilizes the XGboost algorithm in machine learning to carry out regression modeling and prediction on the weekly average access quantity of the video in consideration of the fact that the edge server needs to process a large amount of video information and the outstanding data analysis capability of the machine learning in big data processing, thereby providing a new video cache optimization model on the basis and solving the model by using the knapsack algorithm. The machine learning has great advantages in learning and analyzing a large amount of data, especially in analyzing diversified user indexes, so that the accuracy in prediction is high, and therefore, based on the prediction result, the optimization result obtained by the optimization model calculation is closer to the actual optimization result, so that the cache hit rate of the edge server is greatly improved, when a large amount of services arrive, the probability of directly obtaining the data from the edge side is greatly improved, the service access delay is reduced to the maximum extent by the edge server, and the scheme is very simple and easy to implement, and has a good application prospect.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention;
FIG. 2 is a graph comparing the average weekly visit rate of video prediction with the average weekly visit rate of actual video prediction;
FIG. 3 is a graph comparing a weekly average visit performance cost ratio for video prediction with an actual weekly average visit performance cost ratio;
FIG. 4 is a graphical representation of weekly average visitation prediction accuracy, weekly average visitation performance cost ratio prediction accuracy, and cache hit rate over time.
Detailed Description
The invention is further elucidated with reference to the drawings and the embodiments.
As shown in fig. 1, the present invention provides a method for optimizing a VOD service cache based on an XGBoost algorithm in an edge network environment, which specifically comprises the following steps:
1) XGboost algorithm based modeling and prediction of access amount of VOD (video on demand) service
1.1) acquisition of sample video data and data preprocessing
The method comprises the steps of randomly collecting relevant information of 100000 VOD videos on a video playing platform, extracting the information from the relevant information, aligning data decimal points, and rounding off the rest decimal points, wherein the obtained information comprises video access amount, online time, movie popularity list name, popularity, praise number, comment number, video score and the like. The online time is divided into the number of online days due to the fact that the online time is different, the rest data are time alignment of data, each data is processed by taking a certain time as a starting point and taking a week as a time interval, and the weekly average value of the video access amount, the online time, the movie popularity list ranking, the popularity, the praise number, the comment number, the video score and the like is obtained and cannot be rounded up for decimal values (such as the online time, the popularity list ranking and the like). And if the online time is less than one week, the missing data is filled with 0.
1.2) modeling and prediction with XGboost Algorithm
Before modeling by using an XGboost algorithm, firstly carrying out null value processing on data, wherein information loss occurs when video information is incomplete, so that model training is influenced, preprocessing is carried out on the data by using an Imputer class in a preprocessing package of sklern, null value filling is carried out by using a median, 60% of data sets are used as training sets, 40% of the data sets are used as test sets, the above line time, film popularity ranking, popularity, comment number and score are used as independent variables, and the visit amount is used as a dependent variable for carrying out regression training. And dividing the data set by using 10-fold cross validation, outputting the importance ranking of each characteristic value, removing the characteristics with too low importance, reducing the complexity of the model and obtaining the final modeling characteristic value.
In the modeling process, a combined parameter adjusting mode is used for parameter adjustment to obtain a model with the minimum output square error, namely a final model, and the model is used for predicting the weekly visit quantity of the next week of videos.
2) Establishing a cache optimization model
Assuming that the cache space of the edge server is S, the video volume set is V ═ V1,v2,…,vKThe video access amount is set as PV ═ PV }1,pv2,…,pvKK is the total number of videos, so that the following cache optimization model can be obtained:
Figure BDA0002457891770000051
wherein
Figure BDA0002457891770000052
Selection of optimal buffering for video, ak0 means that video k does not need to be buffered, ak1 indicates that the video k needs to be cached; a formula
Figure BDA0002457891770000053
There are two possibilities when akWhen 0, the formula is 0, and when a is not practicalkWhen 1, the ratio of the access amount of the video k to the video k volume is expressed, and the value is to balance the access amount and the video volume. Suppose that the predicted amount of access for video k is high, but at the same time the volume of the videoThe video cache memory of the edge server is occupied due to the fact that the video volume is very large, if the number of the videos is large, the videos which can be cached in the edge server are reduced greatly, and the caching effect cannot be guaranteed, so that the defined expression
Figure BDA0002457891770000054
The caching cost performance of the video k is expressed, and the optimization aim is to maximize the caching cost performance of the video; furthermore, constraints
Figure BDA0002457891770000055
The sum of the volumes representing the cached videos should be less than the cache space of the edge server.
3) Solving optimization models using knapsack algorithm
The problem represented by the above optimization model is actually a 0-1 knapsack problem in nature, namely: there are K items, each having its own value, the value being represented by formula
Figure BDA0002457891770000056
The edge server is a backpack, and the capacity of the backpack is certain, namely, how to load the articles with the largest sum of values in the backpack. The knapsack problem belongs to a dynamic planning problem, the dynamic planning solving idea is similar to the dividing and treating idea, large problems are decomposed into small problems, and the small problems are solved by finding the relation between the large problems and the small problems, so that the solution of the large problems can be obtained. The solving process is divided into three steps, firstly modeling, secondly searching for constraint, and finally searching for a recursion relational expression, wherein the idea of searching for the recursion relational expression is as follows:
when the video is cached in the edge server, two possibilities exist, the first is that the residual capacity of the edge server is smaller than the volume of the ith video currently being cached in the edge server, and the edge server cannot load the video to be cached currently, namely the value of the ith video is the same as the value of the (i-1) th video. The second case is that the remaining capacity of the current edge server is larger than the volume of the i-th video currently being played back to the edge server, but the i-th video is not always optimal after being played back, and therefore, it is necessary to select between loading and unloading.
According to the above thought, let c (i, j) be the sum of the cost performance corresponding to the best caching mode of the front i part video when the remaining capacity of the current edge server is j, that is to say
Figure BDA0002457891770000061
The following recursion relation can be obtained:
Figure BDA0002457891770000062
the second formula of formula (3) is illustrated below: when the remaining capacity of the edge server is sufficient for the ith video to be cached, the ith video is not necessarily the optimal cache selection video, and thus two situations may occur, where the first situation is that the ith video is not the optimal selection, that is, the ith video is not cached, ai0, in this case:
c(i,j)＝c(i-1,j) (4)
the second case is that the ith video is the best choice, i.e. the ith video needs to be buffered, ai1, namely:
Figure BDA0002457891770000063
in the formula (5), viIs the volume of the ith video, c (i, j-v)i) The sum of the optimal cost performance obtained by the previous decision before the ith video is processed is added with the cost performance of the ith video on the basis, namely the total cost performance after the ith video is cached.
Comparing the two situations to obtain the cost performance, taking the maximum value as the sum of the cost performances obtained under the condition that the residual capacity of the edge server is sufficient for the ith video to be cached, and finally obtaining the optimal cached video set
Figure BDA0002457891770000071
According to the summary, the scheme of the invention mainly comprises three contents: firstly, modeling and predicting the access amount of the VOD service by using an XGboost algorithm in a week unit; secondly, establishing a cache optimization model under the condition that the cache space of the edge server is limited; thirdly, solving the optimization model by using a knapsack algorithm according to the prediction result.
The present embodiment utilizes the existing data simulation results to illustrate the optimization effect of the present invention. Let the test video set be c ═ c1,c2,…cLTesting the average visit quantity of the video in the video set as pv ═ pv1,pv2,…,pvLThe average access amount per cycle of the actual video is pv' ═ pv1',pv'2,…,pv'LAnd defining the weekly average visit rate prediction accuracy as follows:
Figure BDA0002457891770000072
the comparison of the average weekly visit rate of video prediction and the average weekly visit rate of actual video prediction is shown in the simulation result in fig. 2. P can be obtained through calculationpv＝93.8％。
The prediction cycle average access capacity performance price ratio set of the video in the test video set is cp ═ cp1,cp2,…,cpLThe performance price ratio set of the actual weekly average access volume is cp' ═ cp1',cp'2,…,cp'LDefining weekly average visit volume performance price ratio prediction accuracy:
Figure BDA0002457891770000073
a comparison of the weekly average visit rate for video prediction and the actual weekly average visit rate is shown in fig. 3. P can be obtained through calculationcp＝93.3％。
Assume that the set of videos cached in the edge server is cAPractice ofThe average visit volume performance price ratio of the week is sorted in descending order, and the video set is cBWherein the set cAAnd cBThe lengths are equal, and the cache hit rate is defined as:
Figure BDA0002457891770000074
p is obtained through calculationc＝94.9％
From the simulation results, the weekly average visit rate prediction accuracy, the weekly average visit rate performance price ratio prediction accuracy and the cache hit rate are higher, which shows that the effect of the invention on improving the caching efficiency of the edge server is obvious, and in addition, the cache hit rate is high, which also shows that the service reaching the edge server obtains the required resources with high probability, thereby reducing the service delay.
Fig. 4 is a schematic diagram of the weekly average visit rate prediction accuracy, the weekly average visit rate performance price ratio prediction accuracy and the cache hit rate changing with time, which illustrates that the optimal cache set obtained by the present invention does not fluctuate greatly with time, and the update cost of the prediction algorithm is low.

Claims (5)

1. A VOD service cache optimization method based on XGboost algorithm under edge network environment is characterized in that: the method comprises the following steps:
s1: collecting video data;
s2: taking the average visit amount as a prediction target, and performing regression modeling by using an XGboost algorithm to obtain a prediction model;
s3: predicting the average visit quantity by using a prediction model;
s4: establishing a cache optimization model according to the prediction result;
s5: and (5) solving the optimization model by using a knapsack algorithm to obtain a final caching scheme.
2. The XGboost algorithm-based VOD service cache optimization method in the edge network environment according to claim 1, wherein: the obtaining of the prediction model in step S2 specifically includes: and carrying out regression training by taking the average visit quantity as a dependent variable and taking the rest characteristics as independent variables, dividing a data set, outputting importance ranks of all characteristic values, deleting the characteristics according to the ranks to obtain final modeling characteristic values, and modeling according to the modeling characteristic values to form a prediction model.
3. The XGboost algorithm-based VOD service cache optimization method in the edge network environment according to claim 2, wherein: and performing parameter adjustment by using a combined parameter adjusting mode in the process of modeling and forming the prediction model according to the modeling characteristic value to obtain a model with the minimum output square error, namely the final model.
4. The XGboost algorithm-based VOD service cache optimization method in the edge network environment according to claim 1, wherein: the establishment of the cache optimization model in the step S4 specifically includes:
setting the cache space size of the edge server as S, and the video volume set as V ═ V1,v2,…,vKThe video access amount is set as PV ═ PV }1,pv2,…,pvKAnd K is the total number of videos, so that the following cache optimization model is obtained:
Figure FDA0002457891760000011
wherein
Figure FDA0002457891760000012
Selection of optimal buffering for video, ak0 means that video k does not need to be buffered, ak1 indicates that the video k needs to be cached; a formula
Figure FDA0002457891760000013
There are two possibilities when akWhen 0, the formula is 0, and when a is not practicalkWhen 1, the ratio of the access amount of the video k to the video k volume is expressed, and the value is to balance the access amount and the video volume, so that the formula is defined
Figure FDA0002457891760000014
Representing the caching cost performance of the video k; constraint conditions
Figure FDA0002457891760000015
The sum of the volumes representing the cached videos should be less than the cache space of the edge server.
5. The XGboost algorithm-based VOD service cache optimization method in the edge network environment according to claim 4, wherein: the solving process of the optimization model in the step S5 specifically includes:
let c (i, j) be the sum of cost performance corresponding to the best caching mode of the front i part video when the remaining capacity of the current edge server is j, that is
Figure FDA0002457891760000021
The following recursion relationship is obtained:
Figure FDA0002457891760000022
the second formula of formula (3) is illustrated below: when the remaining capacity of the edge server is sufficient for the ith video to be cached, the ith video is not necessarily the optimal cache selection video, and thus two situations may occur, where the first situation is that the ith video is not the optimal selection, that is, the ith video is not cached, ai0, in this case:
c(i,j)＝c(i-1,j) (4)
the second case is that the ith video is the best choice, i.e. the ith video needs to be buffered, ai1, namely:
Figure FDA0002457891760000023
in the formula (5), viIs the volume of the ith video, c (i, j-v)i) The sum of the optimal cost performance obtained by the previous decision before the ith video is processed is added with the cost performance of the ith video on the basis, namely the total cost performance after the ith video is cached;
comparing the two situations to obtain the cost performance, taking the maximum value as the sum of the cost performances obtained under the condition that the residual capacity of the edge server is sufficient for the ith video to be cached, and finally obtaining the optimal caching scheme
Figure FDA0002457891760000024
CN202010311154.8A 2020-04-20 2020-04-20 XGboost algorithm-based VOD (video on demand) service cache optimization method in edge network environment Active CN111629217B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010311154.8A CN111629217B (en) 2020-04-20 2020-04-20 XGboost algorithm-based VOD (video on demand) service cache optimization method in edge network environment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010311154.8A CN111629217B (en) 2020-04-20 2020-04-20 XGboost algorithm-based VOD (video on demand) service cache optimization method in edge network environment

Publications (2)

Publication Number Publication Date
CN111629217A true CN111629217A (en) 2020-09-04
CN111629217B CN111629217B (en) 2021-11-26

Family

ID=72260545

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010311154.8A Active CN111629217B (en) 2020-04-20 2020-04-20 XGboost algorithm-based VOD (video on demand) service cache optimization method in edge network environment

Country Status (1)

Country Link
CN (1) CN111629217B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114500337A (en) * 2022-01-24 2022-05-13 西安电子科技大学 End-to-end available key rate measuring method for quantum metropolitan area network based on machine learning

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070064851A1 (en) * 2005-09-02 2007-03-22 Sbc Knowledge Ventures Lp Method for synchronizing a customer edge router or customer premise equipment associated therewith
CN102510529A (en) * 2011-09-22 2012-06-20 中国科学技术大学 Method for performing on-demand play quantity prediction and memory scheduling on programs
US20130144994A1 (en) * 2010-08-16 2013-06-06 Zte Corporation Content Delivery Network and Method for Content Delivery
CN104065663A (en) * 2014-07-01 2014-09-24 复旦大学 Auto-expanding/shrinking cost-optimized content distribution service method based on hybrid cloud scheduling model
CN105979274A (en) * 2016-05-06 2016-09-28 上海交通大学 Distributive cache storage method for dynamic self-adaptive video streaming media
CN110163418A (en) * 2019-04-26 2019-08-23 重庆大学 A kind of labor turnover behavior prediction method based on survival analysis
US20190387237A1 (en) * 2018-06-14 2019-12-19 Telefonaktiebolaget L M Ericsson (Publ) SYSTEM AND METHOD FOR ENCODING 360º IMMERSIVE VIDEO
US20200026710A1 (en) * 2018-07-19 2020-01-23 Bank Of Montreal Systems and methods for data storage and processing

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070064851A1 (en) * 2005-09-02 2007-03-22 Sbc Knowledge Ventures Lp Method for synchronizing a customer edge router or customer premise equipment associated therewith
US20130144994A1 (en) * 2010-08-16 2013-06-06 Zte Corporation Content Delivery Network and Method for Content Delivery
CN102510529A (en) * 2011-09-22 2012-06-20 中国科学技术大学 Method for performing on-demand play quantity prediction and memory scheduling on programs
CN104065663A (en) * 2014-07-01 2014-09-24 复旦大学 Auto-expanding/shrinking cost-optimized content distribution service method based on hybrid cloud scheduling model
CN105979274A (en) * 2016-05-06 2016-09-28 上海交通大学 Distributive cache storage method for dynamic self-adaptive video streaming media
US20190387237A1 (en) * 2018-06-14 2019-12-19 Telefonaktiebolaget L M Ericsson (Publ) SYSTEM AND METHOD FOR ENCODING 360º IMMERSIVE VIDEO
US20200026710A1 (en) * 2018-07-19 2020-01-23 Bank Of Montreal Systems and methods for data storage and processing
CN110163418A (en) * 2019-04-26 2019-08-23 重庆大学 A kind of labor turnover behavior prediction method based on survival analysis

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HUI ZHANG: "Modelling and Optimization Algorithm for Dynamic Volume of Access to VOD Business in Ubiquitous Wireless Environment", 《2019 IEEE 11TH INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS》 *
张志锋等: "基于XGBoost的二手房房价预测模型", 《数字技术与应用》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114500337A (en) * 2022-01-24 2022-05-13 西安电子科技大学 End-to-end available key rate measuring method for quantum metropolitan area network based on machine learning

Also Published As

Publication number Publication date
CN111629217B (en) 2021-11-26

Similar Documents

Publication Publication Date Title
CN110798517A (en) Decentralized cluster load balancing method and system, mobile terminal and storage medium
Huang et al. DeepAdapter: A collaborative deep learning framework for the mobile web using context-aware network pruning
EP3848815B1 (en) Efficient shared bulk loading into optimized storage
CN110830562A (en) Limited load consistency Hash load balancing strategy based on virtual nodes
CN112835698A (en) Heterogeneous cluster-based dynamic load balancing method for request classification processing
CN114327857A (en) Operation data processing method and device, computer equipment and storage medium
CN111629217B (en) XGboost algorithm-based VOD (video on demand) service cache optimization method in edge network environment
CN114417739B (en) Method and device for recommending process parameters under abnormal working conditions
Bornea et al. Adaptive join operators for result rate optimization on streaming inputs
CN111629216B (en) VOD service cache replacement method based on random forest algorithm under edge network environment
EP3871115A1 (en) Data retrieval
WO2021088605A1 (en) Big data-based decision method, device and medium
CN113568938A (en) Data stream processing method and device, electronic equipment and storage medium
Zhang et al. Optimizing execution for pipelined‐based distributed deep learning in a heterogeneously networked GPU cluster
CN110442616B (en) Page access path analysis method and system for large data volume
WO2021143010A1 (en) Response method and device for distributed computing task
JPH10154160A (en) Parallel data retrieval processor
CN111970327A (en) News spreading method and system based on big data processing
CN108256028B (en) Multi-dimensional dynamic sampling method for approximate query in cloud computing environment
Huang et al. Optimization of K-means Algorithm Base on MapReduce
CN110941767A (en) Network community detection countermeasure enhancement method based on multi-similarity integration
US20170293658A1 (en) Partition aware evaluation of top-n queries
KR102571783B1 (en) Search processing system performing high-volume search processing and control method thereof
CN115277708B (en) Dynamic load distribution method for streaming media server
CN117648495B (en) Data pushing method and system based on cloud primary vector data

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant