CN112491939A - Multimedia resource scheduling method and system - Google Patents

Multimedia resource scheduling method and system Download PDF

Info

Publication number
CN112491939A
CN112491939A CN201910862829.5A CN201910862829A CN112491939A CN 112491939 A CN112491939 A CN 112491939A CN 201910862829 A CN201910862829 A CN 201910862829A CN 112491939 A CN112491939 A CN 112491939A
Authority
CN
China
Prior art keywords
cache node
user request
scheduling
heat coefficient
multimedia resource
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
CN201910862829.5A
Other languages
Chinese (zh)
Other versions
CN112491939B (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.)
Shanghai Bilibili Technology Co Ltd
Original Assignee
Shanghai Bilibili Technology Co Ltd
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 Shanghai Bilibili Technology Co Ltd filed Critical Shanghai Bilibili Technology Co Ltd
Priority to CN201910862829.5A priority Critical patent/CN112491939B/en
Publication of CN112491939A publication Critical patent/CN112491939A/en
Application granted granted Critical
Publication of CN112491939B publication Critical patent/CN112491939B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/56Provisioning of proxy services
    • H04L67/568Storing data temporarily at an intermediate stage, e.g. caching
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/40Support for services or applications
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/60Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/63Routing a service request depending on the request content or context

Abstract

The embodiment of the invention provides a multimedia resource scheduling method, which comprises the following steps: caching a multimedia resource to at least one caching node; distributing the multimedia resources in the at least one cache node to corresponding users according to user requests; calculating the heat coefficient of the at least one cache node in a preset historical time according to the multimedia resources cached in the at least one cache node; and when the heat coefficient of the at least one cache node is in a preset range, executing the scheduling of the at least one cache node. According to the technical scheme provided by the embodiment of the application, the utilization rate of the cache node can be effectively evaluated through the heat coefficient in the preset historical time, and the cache node scheduling is executed based on the utilization rate of the cache node, so that the bandwidth pressure of a network can be effectively relieved, and the content playing and browsing quality of multimedia resources such as videos and pictures of a client terminal user is improved.

Description

Multimedia resource scheduling method and system
Technical Field
The embodiment of the invention relates to the technical field of computers, in particular to a multimedia resource scheduling method and system.
Background
At present, the playing service of internet multimedia resources generally adopts a mode that a content distribution network deploys an edge server to realize the distribution of the internet multimedia resources. Namely, the dispatching server receives the user request, finds the cache node closest to the user according to the user request, and directs the request to the cache node so that the user can obtain the multimedia resource nearby.
However, when a large amount of user request data is faced, the content scheduling method for obtaining multimedia resources by selecting the cache node closest to the user is likely to affect the content playing and browsing quality of the multimedia resources such as videos and pictures of the user due to network congestion.
Disclosure of Invention
The embodiment of the invention provides a multimedia resource scheduling method and a multimedia resource scheduling system, which are used for solving the problem that the content playing and browsing quality of multimedia resources such as videos, pictures and the like of a user is easily influenced due to network congestion by selecting a cache node closest to the user to obtain the content scheduling method of the multimedia resources in the face of a large amount of user request data.
The embodiment of the invention solves the technical problems through the following technical scheme:
a method of multimedia resource scheduling, the method comprising:
caching a multimedia resource to at least one caching node;
distributing the multimedia resources in the at least one cache node to corresponding users according to user requests;
calculating the heat coefficient of the at least one cache node in a preset historical time according to the multimedia resources cached in the at least one cache node;
and when the heat coefficient of the at least one cache node is in a preset range, executing the scheduling of the at least one cache node.
Further, the calculating a heat coefficient of the at least one cache node within a preset historical time according to the multimedia resource cached in the at least one cache node includes:
determining a heat coefficient HC corresponding to the at least one cache node through a formula HC ═ PV/UU;
PV is the number of times of accessing the multimedia resources in the preset historical time, and UU is the number of the multimedia resources after the duplication removal in the preset historical time.
Further, the cache nodes include a first cache node and a second cache node in a content distribution network, and when the heat coefficient of the at least one cache node is within a preset range, the performing scheduling of the at least one cache node includes:
when the heat coefficient corresponding to the first cache node and the second cache node is within the preset range, acquiring a first utilization rate corresponding to the first cache node and a second utilization rate corresponding to the second cache node;
if the first utilization rate is greater than the second utilization rate, judging that the first cache node corresponds to a high utilization rate, and the second cache node corresponds to a low utilization rate, and scheduling the first cache node to a corresponding user;
and if the first utilization rate is smaller than the second utilization rate, judging that the first cache node corresponds to a low utilization rate, and the second cache node corresponds to a high utilization rate, and scheduling the second cache node to a corresponding user.
Further, when the heat coefficient of the at least one cache node is within a preset range, performing scheduling of the at least one cache node includes:
receiving at least one current user request, wherein the current user request is used for requesting to acquire a corresponding target multimedia resource;
matching the at least one cache node corresponding to at least one current user request according to at least one current user request;
acquiring the heat coefficient of the at least one matched cache node;
and selecting the current optimal cache node matched with the current user request according to the heat coefficient and the current user request so as to schedule the current user request to the current optimal cache node.
Further, the selecting, according to the heat coefficient and the current user request, a current optimal cache node matching the current user request to schedule the current user request to the current optimal cache node further includes:
classifying the target multimedia resources according to preset multimedia resource category labels to obtain the classification types of the target multimedia resources;
and selecting the current optimal cache node matched with the current user request according to the heat coefficient and the classification type so as to schedule the current user request to the current optimal cache node.
Further, the selecting the current optimal cache node matching the current user request according to the heat coefficient and the classification type to schedule the current user request to the current optimal cache node further includes:
and when the heat coefficient of the at least one cache node is within the preset range and the at least one cache node comprises the classification type of the target multimedia resource, selecting the cache node closest to the user as the current optimal cache node, and scheduling the current user request to the current optimal cache node.
Further, the selecting the current optimal cache node matching the current user request according to the heat coefficient and the classification type to schedule the current user request to the current optimal cache node further includes:
and when the heat coefficient of the at least one cache node is within the preset range and the at least one cache node does not contain the classification type of the target multimedia resource, acquiring the utilization rate of each cache node, selecting the cache node with the highest utilization rate as the current optimal cache node, and scheduling the current user request to the current optimal cache node.
In order to achieve the above object, an embodiment of the present invention further provides a multimedia resource scheduling system, where the system includes:
the cache module is used for caching the multimedia resources to at least one cache node;
the selection module is used for distributing the multimedia resources in the at least one cache node to corresponding users according to user requests;
the computing module is used for computing the heat coefficient of the at least one cache node in preset historical time according to the multimedia resources cached in the at least one cache node;
and the scheduling module is used for executing the scheduling of the at least one cache node when the heat coefficient of the at least one cache node is in a preset range.
In order to achieve the above object, an embodiment of the present invention further provides a computer device, where the computer device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the multimedia resource scheduling method as described above when executing the computer program.
In order to achieve the above object, an embodiment of the present invention further provides a computer-readable storage medium, in which a computer program is stored, where the computer program is executable by at least one processor, so as to cause the at least one processor to execute the steps of the multimedia resource scheduling method described above.
According to the multimedia resource scheduling method and system provided by the embodiment of the invention, the heat coefficient of the corresponding cache node in the preset historical time is calculated according to the multimedia resource cached in each cache node; when the heat coefficient of the cache node is in the preset range, the cache node is scheduled, the utilization rate of the corresponding cache node can be effectively evaluated through the heat coefficient in the preset historical time, the cache node scheduling is executed based on the utilization rate of the cache node, the bandwidth pressure of a network can be effectively relieved, and the content playing and browsing quality of multimedia resources such as videos and pictures of a client terminal user is improved.
The invention is described in detail below with reference to the drawings and specific examples, but the invention is not limited thereto.
Drawings
FIG. 1 is a schematic diagram of an environmental application of an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a multimedia resource scheduling method according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating a multimedia resource scheduling method according to a second embodiment of the present invention;
FIG. 4 is a flowchart illustrating specific steps of performing cache node scheduling when the heat coefficient of the cache node is within a predetermined range according to a second embodiment of the present invention;
FIG. 5 is a block diagram of a multimedia resource scheduling system according to a third embodiment of the present invention;
FIG. 6 is a diagram of a hardware structure of a fourth embodiment of the computer apparatus according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the description relating to "first", "second", etc. in the present invention is for descriptive purposes only and is not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present invention.
FIG. 1 shows an environmental application diagram according to an embodiment of the invention.
In an exemplary embodiment, the content distribution network 1 may connect to at least one client terminal 3 through at least one network 2 and transmit corresponding multimedia assets to the at least one client terminal 3.
In an exemplary embodiment, the content distribution network 1 may distribute multimedia assets through various transmission techniques. The Transmission technology includes, but is not limited to, a TCP (Transmission Control Protocol), an https (Hypertext Transfer Protocol Secure) Protocol, and an http (request response) Protocol. The multimedia assets include, but are not limited to, video, audio, text, combinations thereof, and/or the like.
The network 2 may include physical links, such as coaxial cable links, twisted pair cable links, fiber optic links, and the like. The network 2 may also include wireless links, such as cellular links, satellite links, Wi-Fi links, and the like. The network 2 may be the internet.
The client terminal 3 may be any terminal device having a function of receiving data, including but not limited to a mobile phone, a tablet personal computer, a laptop computer. Each client terminal 3 may correspond to at least one user. Each user can access the content distribution network 1 using at least one client terminal 3. Each client terminal 3 may access the content distribution network 1 using the same or a different network 2. The client terminal 3 may output multimedia assets such as video, audio, text, combinations thereof and/or the like to a corresponding user.
Example one
Fig. 2 is a flowchart illustrating steps of a multimedia resource scheduling method according to a first embodiment of the present invention. It is to be understood that the flow chart in the first embodiment of the method is not used to limit the order of executing the steps. The following description takes the computer device 20 as an execution subject, specifically as follows:
as shown in fig. 2, the multimedia resource scheduling method may include steps S100 to S103, wherein:
step S100, caching the multimedia resource to at least one caching node.
Illustratively, the multimedia resources include, but are not limited to, a collection of one or all of video, audio, pictures, and text. At least one cache node may be stored in the content distribution network 1. The Content Delivery Network 1 includes, but is not limited to, a CDN (Content Delivery Network), and the cache nodes in the CDN Network are CDN cache nodes.
In the exemplary embodiment, the origin server contains all multimedia resources of the caching nodes in the content distribution network 1. Wherein the multimedia resource in the source server can be cached in the form of a copy to at least one caching node in the content distribution network 1.
Step S101, according to the user request, the multimedia resource in the at least one cache node is distributed to the corresponding user.
Illustratively, the user request is for a multimedia resource. For example, the user request may be for playing video content.
In an exemplary embodiment, computer device 20 may perform the following operations: the same or different user requests sent by at least one client terminal 3 are received simultaneously through the scheduling server, corresponding cache nodes are matched for each user according to each user request, and the multimedia resources of the corresponding cache nodes are distributed to the corresponding users. The cache node may be the closest cache node to the user.
In an exemplary embodiment, computer device 20 may perform the following operations: when the multimedia resource requested by the user is stored in the matched cache node, the scheduling server sends the user request to the cache node, and schedules the cache node to the corresponding client terminal 3, that is, the cache node directly returns the multimedia resource to the corresponding client terminal 3, so that the user corresponding to the client terminal 3 can play or browse the corresponding multimedia resource such as video, picture and the like.
In an exemplary embodiment, computer device 20 may perform the following operations: when the multimedia resource requested by the user is not stored in the cache node, the multimedia resource is returned to the source server through the scheduling server to obtain the corresponding multimedia resource from the source server, and the multimedia resource is cached in the cache node in a copy form, and the cache node returns the multimedia resource to the corresponding client terminal 3 so that the user corresponding to the client terminal 3 can play or browse the corresponding multimedia resource such as video, picture and the like.
Step S102, calculating the heat coefficient of the at least one cache node in the preset historical time according to the multimedia resource cached in the at least one cache node.
In an exemplary embodiment, the step S102 may include the steps of:
determining a heat coefficient HC corresponding to the at least one cache node through a formula HC ═ PV/UU; pv (page view) is the number of times the multimedia resource is accessed in the preset historical time, and uu (unique urls) is the number of the multimedia resource urls in the preset historical time after duplication removal. Url deduplication can be performed by a HASH (HASH) function.
Illustratively, a url (Uniform resource Locator) of the multimedia resource may be extracted from the user request.
By way of example, the calculation of PV can be understood as: when a user accesses a multimedia resource, it is counted as 1, when the same user accesses the multimedia resource twice, it is counted as 2, and so on. The calculation of a UU may be understood as: one multimedia resource is accessed multiple times, counting as 1, two different multimedia resources are accessed multiple times, counting as 2, and so on.
For example, the heat coefficient of each cache node in the content distribution network 1 in a preset historical time is calculated respectively. Wherein the preset historical time is set to include, but is not limited to, one day, one week, one month, or one half year. It should be noted that the preset historical time may also be set according to the duration of the viewing heat of the multimedia resource, and the specific time duration set by the preset historical time is not a hard requirement.
Step S103, when the heat coefficient of the at least one cache node is in a preset range, executing scheduling of the at least one cache node.
Illustratively, the cache nodes include a first cache node and a second cache node in the content distribution network 1.
In an exemplary embodiment, the step S103 may include the steps of:
when the heat coefficient corresponding to the first cache node and the second cache node is within the preset range, acquiring a first utilization rate corresponding to the first cache node and a second utilization rate corresponding to the second cache node;
if the first utilization rate is greater than the second utilization rate, judging that the first cache node corresponds to a high utilization rate, and the second cache node corresponds to a low utilization rate, and scheduling the first cache node to a corresponding user;
and if the first utilization rate is smaller than the second utilization rate, judging that the first cache node corresponds to a low utilization rate, and the second cache node corresponds to a high utilization rate, and scheduling the second cache node to a corresponding user.
For example, if the heat coefficients corresponding to the first cache node and the second cache node are both within a preset range, the first cache node corresponds to a high utilization rate, the second cache node corresponds to a low utilization rate, and the first cache node is the cache node closest to the user, the first cache node may be selected as the optimal cache node, the user request is scheduled to the first cache node, and the first cache node is scheduled to the corresponding user.
The technical scheme of the first embodiment has at least the following technical effects:
one is as follows: the utilization rate of the corresponding cache node can be effectively evaluated through the heat coefficient in the preset historical time.
The second step is as follows: the scheduling of the cache nodes is executed based on the heat coefficient of the cache nodes, so that the bandwidth pressure of the content distribution network 1 can be effectively relieved, and the content playing and browsing quality of multimedia data such as videos and pictures of a user of the client terminal 3 is improved.
Example two
Fig. 3 schematically shows a flowchart of a multimedia resource scheduling method according to the second embodiment of the present application. It is understood that the flowchart in the second embodiment of the method is not used to limit the order of executing the steps. The following description takes the computer device 20 as an execution subject, specifically as follows:
as shown in fig. 3, the multimedia resource scheduling method may include steps S200 to S203, wherein:
step S200, caching the multimedia resource to at least one caching node.
Illustratively, the multimedia resources include, but are not limited to, a collection of one or all of video, audio, pictures, and text. At least one cache node may be stored in the CDN network, and the cache node in the CDN network is a CDN cache node.
Step S201, distributing the multimedia resource in the at least one cache node to a corresponding user according to a user request.
Illustratively, the user request is for a multimedia resource. For example, the user request may be for playing video content.
In an exemplary embodiment, computer device 20 may perform the following operations: the same or different user requests sent by at least one client terminal 3 can be received simultaneously by the scheduling server, corresponding cache nodes are matched for each user according to each user request, and multimedia resources of the cache nodes are distributed to the corresponding users.
Step S202, calculating the heat coefficient of the at least one cache node in the preset historical time according to the multimedia resources cached in the at least one cache node.
In an exemplary embodiment, the step S202 may include the steps of:
determining a heat coefficient HC corresponding to the at least one cache node through a formula HC ═ PV/UU; pv (page view) is the number of times the multimedia resource is accessed in the preset historical time, and uu (unique urls) is the number of the multimedia resource urls in the preset historical time after duplication removal. Url deduplication can be performed by a HASH (HASH) function.
Step S203, when the heat coefficient of the at least one cache node is in a preset range, performing scheduling of the at least one cache node.
In an exemplary embodiment, as shown in fig. 4, step S203 may further include the steps of:
step S203A, receiving at least one current user request, where the current user request is used to request to acquire a corresponding target multimedia resource.
Step S203B, matching the at least one cache node corresponding to at least one of the current user requests according to at least one of the current user requests.
In an exemplary embodiment, the at least one cache node that matches based on the current user request may include a cache node closest to the user, and at least one candidate cache node. The candidate caching node may be selected by parsing the url of the target multimedia resource requested by the current user. Illustratively, a url of a target multimedia resource requested by a current user is obtained, the url is analyzed to extract domain name information from the url, the target multimedia resource information is calculated according to a preset content matching rule, and an ID of the target multimedia resource is obtained according to the domain name information and the target multimedia resource information to judge a storage location of the target multimedia resource at a cache node, that is, at least one candidate cache node is matched through the ID of the target multimedia resource.
Step S203C, obtaining the heat coefficient of the at least one cache node that matches.
Illustratively, the heat coefficient of each cache node is a heat coefficient of the corresponding cache node in a preset historical time calculated according to the multimedia resource cached in each cache node.
Step S203D, selecting a current optimal cache node matching the current user request according to the heat coefficient and the current user request, so as to schedule the current user request to the current optimal cache node.
In an exemplary embodiment, the target multimedia resource is classified according to a preset multimedia resource category label to obtain a classification type of the target multimedia resource; and selecting the current optimal cache node matched with the current user request according to the heat coefficient and the classification type so as to schedule the current user request to the current optimal cache node.
The preset multimedia resource category labels include, but are not limited to, a primary label, a secondary label, and a tertiary label. For example, when the multimedia resource is a video resource and the content played by the video resource is a funny animation, the primary label of the multimedia resource is a video label, the secondary label of the multimedia resource is an animation label, and the tertiary label of the multimedia resource is a funny label.
It should be noted that the classification type includes, but is not limited to, a primary classification type, a secondary classification type, and a tertiary classification type, and each level of labels of the multimedia resource corresponds to each level of classification type. Illustratively, all levels of classification types corresponding to the target multimedia resource can be obtained according to all levels of labels corresponding to the target multimedia resource. For example, when the target multimedia resource is a video resource and the content played by the video resource is a funny animation, the first-level label of the target multimedia resource is a video label, and the corresponding first-level classification type is a video type; the secondary label of the target multimedia resource is an animation label, and the corresponding secondary classification type is an animation type; the third-level label of the target multimedia resource is a funny type label, and the corresponding third-level classification type is a funny type.
In an exemplary embodiment, when the heat coefficient of the at least one cache node is within the preset range and the at least one cache node includes the classification type of the target multimedia resource, selecting a cache node closest to a user as the current optimal cache node, and scheduling the current user request to the current optimal cache node.
In an exemplary embodiment, when the heat coefficient of the at least one cache node is within the preset range and the at least one cache node does not include the classification type of the target multimedia resource, the usage rate of each cache node is obtained, the cache node with the highest usage rate is selected as the currently optimal cache node, and the current user request is dispatched to the currently optimal cache node.
By way of example, computer device 20 may perform the following operations: and if the heat coefficient of the at least one cache node is within the preset range and the at least one cache node does not contain the classification type of the target multimedia resource, acquiring the utilization rate of each cache node, returning the source to the source server through the scheduling server to obtain the target multimedia resource, scheduling the current user request to the cache node with the highest utilization rate, caching the target multimedia resource in the cache node in a copy mode, and scheduling the cache node to the client terminal 3 so that the user can look up the corresponding target multimedia resource.
In the embodiment of the invention, the scheduling server stores the scheduling result in the log center in the form of an access log form in the scheduling process, wherein the access log form comprises the current user request, the information of the current optimal cache node, the scheduling result and the information of the target multimedia resource. The scheduling result is stored in the log center by accessing the form of the log form, so that the subsequent construction of the content distribution network 1 is facilitated.
The technical scheme of the second embodiment has at least the following technical effects:
one is as follows: the utilization rate of the corresponding cache node can be effectively evaluated through the heat coefficient in the preset historical time.
The second step is as follows: the scheduling of the cache nodes is executed based on the heat coefficient of the cache nodes, so that the bandwidth pressure of the content distribution network 1 can be effectively relieved, the consumption of computing resources is saved, and the playing quality of the multimedia resources of the client user is improved.
And thirdly: by storing the access log form, the subsequent construction of the content distribution network 1 is facilitated.
EXAMPLE III
Fig. 5 is a schematic diagram showing program modules of a multimedia resource scheduling system according to a third embodiment of the present application. In this embodiment, the multimedia resource scheduling system 300 may be divided into at least one program module, and one or more program modules are stored in a storage medium and executed by at least one processor to implement the present invention and implement the multimedia resource scheduling method. The following description will specifically describe the functions of each program module in the present embodiment, in which the program module refers to a series of computer program instruction segments capable of performing specific functions.
As shown in fig. 5, the multimedia resource scheduling system 300 may include a caching module 301, a selecting module 302, a calculating module 303, and a scheduling module 304; wherein:
a caching module 301, configured to cache a multimedia resource to at least one caching node;
a selecting module 302, configured to distribute the multimedia resource in at least one of the cache nodes to a corresponding user according to a user request;
a calculating module 303, configured to calculate a heat coefficient of the at least one cache node within a preset historical time according to the multimedia resource cached in the at least one cache node;
a scheduling module 304, configured to perform scheduling on the at least one cache node when the heat coefficient of the at least one cache node is within a preset range.
Optionally, the calculating module 303 is further configured to:
determining a heat coefficient HC corresponding to the at least one cache node through a formula HC ═ PV/UU; pv (page view) is the number of times the multimedia resource is accessed in the preset historical time, and uu (unique urls) is the number of the multimedia resource urls in the preset historical time after duplication removal. Url deduplication can be performed by a HASH (HASH) function.
Optionally, the cache nodes include a first cache node and a second cache node in the content distribution network 1, and the scheduling module 304 is further configured to:
when the heat coefficient corresponding to the first cache node and the second cache node is within the preset range, acquiring a first utilization rate corresponding to the first cache node and a second utilization rate corresponding to the second cache node;
if the first utilization rate is greater than the second utilization rate, judging that the first cache node corresponds to a high utilization rate, and the second cache node corresponds to a low utilization rate, and scheduling the first cache node to a corresponding user;
and if the first utilization rate is smaller than the second utilization rate, judging that the first cache node corresponds to a low utilization rate, and the second cache node corresponds to a high utilization rate, and scheduling the second cache node to a corresponding user.
Optionally, the scheduling module 304 is further configured to:
receiving at least one current user request, wherein the current user request is used for requesting to acquire a corresponding target multimedia resource;
matching the at least one cache node corresponding to at least one current user request according to at least one current user request;
acquiring the heat coefficient of the at least one matched cache node;
and selecting the current optimal cache node matched with the current user request according to the heat coefficient and the current user request so as to schedule the current user request to the current optimal cache node.
Example four
Fig. 6 schematically shows a hardware architecture diagram of a computer device suitable for implementing the multimedia resource scheduling method according to a fourth embodiment of the present application. In the present embodiment, the computer device 20 is a device capable of automatically performing numerical calculation and/or information processing according to a preset or stored instruction. The computer device 20 may be a rack server, a blade server, a tower server or a rack server (including an independent server or a server cluster composed of a plurality of servers), and the like. As shown in FIG. 6, the computer device 20 includes, but is not limited to, at least a memory 21, a processor 22, and a network interface 23, which may be communicatively coupled to each other via a system bus. Wherein:
in this embodiment, the memory 21 includes at least one type of computer-readable storage medium including a flash memory, a hard disk, a multimedia card, a card-type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Programmable Read Only Memory (PROM), a magnetic memory, a magnetic disk, an optical disk, and the like. In some embodiments, the storage 21 may be an internal storage unit of the computer device 20, such as a hard disk or a memory of the computer device 20. In other embodiments, the memory 21 may also be an external storage device of the computer device 20, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), or the like, provided on the computer device 20. Of course, the memory 21 may also include both internal and external storage devices of the computer device 20. In this embodiment, the memory 21 is generally used for storing an operating system and various application software installed on the computer device 20, such as the program codes of the multimedia resource scheduling system 300 of the above-mentioned embodiment. Further, the memory 21 may also be used to temporarily store various types of data that have been output or are to be output.
Processor 22 may be a Central Processing Unit (CPU), controller, microcontroller, microprocessor, or other data Processing chip in some embodiments. The processor 22 is typically used to control the overall operation of the computer device 20. In this embodiment, the processor 22 is configured to execute the program code stored in the memory 21 or process data, for example, execute the multimedia resource scheduling system 300, so as to implement the multimedia resource scheduling method of the above-mentioned embodiment.
The network interface 23 may comprise a wireless network interface or a wired network interface, and the network interface 23 is generally used for establishing communication connection between the computer apparatus 20 and other electronic devices. For example, the network interface 23 is used to connect the computer device 20 to an external terminal through a network, establish a data transmission channel and a communication connection between the computer device 20 and the external terminal, and the like. The network may be a wireless or wired network such as an Intranet (Intranet), the Internet (Internet), a Global System of Mobile communication (GSM), Wideband Code Division Multiple Access (WCDMA), a 4G network, a 5G network, Bluetooth (Bluetooth), Wi-Fi, and the like.
It is noted that fig. 6 only shows the computer device 20 with components 21-23, but it is to be understood that not all shown components are required to be implemented, and that more or less components may be implemented instead.
In this embodiment, the multimedia resource scheduling system 300 stored in the memory 21 can be further divided into one or more program modules, and the one or more program modules are stored in the memory 21 and executed by at least one processor (in this embodiment, the processor 22) to complete the present invention.
For example, fig. 5 is a schematic diagram illustrating program modules for implementing a third embodiment of the multimedia resource scheduling system 300, in which the multimedia resource scheduling system 300 may be divided into a caching module 301, a selecting module 302, a calculating module 303, and a scheduling module 304. The program modules referred to herein are a series of computer program instruction segments capable of performing specific functions, and are more suitable than programs for describing the execution process of the multimedia resource scheduling system 300 in the computer device 20. The specific functions of the program modules 301 and 304 have been described in detail in the third embodiment, and are not described herein again.
EXAMPLE five
The embodiment also provides a computer-readable storage medium, which is used for storing the multimedia resource scheduling system 300 and implementing the multimedia resource scheduling method in the embodiment when being executed by a processor.
In this embodiment, the computer-readable storage medium includes, for example, a flash memory, a hard disk, a multimedia card, a card-type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Programmable Read Only Memory (PROM), a magnetic memory, a magnetic disk, an optical disk, a server, an App application mall, etc., and the computer program is stored thereon, and when executed by a processor, the program implements a corresponding function. In some embodiments, the computer readable storage medium may be an internal storage unit of the computer device, such as a hard disk or a memory of the computer device. In other embodiments, the computer readable storage medium may be an external storage device of the computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the computer device. Of course, the computer-readable storage medium may also include both internal and external storage devices of the computer device. In this embodiment, the computer-readable storage medium is generally used for storing an operating system and various types of application software installed in the computer device, for example, the program code of the multimedia resource scheduling method in the embodiment, and the like. Further, the computer-readable storage medium may also be used to temporarily store various types of data that have been output or are to be output.
It will be apparent to those skilled in the art that the modules or steps of the embodiments of the present invention described above may be implemented by a general purpose computing device, may be integrated into a single computing device or distributed across a network of multiple computing devices, and may alternatively be implemented by program code executable by a computing device, such that the steps shown or described may be executed by a computing device stored in a storage device and, in some cases, may be executed out of order from that shown or described, or separately fabricated into individual circuit modules, or fabricated into a single circuit module from multiple modules or steps of the same. Thus, embodiments of the invention are not limited to any specific combination of hardware and software.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.

Claims (10)

1. A method for scheduling multimedia resources, the method comprising:
caching a multimedia resource to at least one caching node;
distributing the multimedia resources in the at least one cache node to corresponding users according to user requests;
calculating the heat coefficient of the at least one cache node in a preset historical time according to the multimedia resources cached in the at least one cache node;
and when the heat coefficient of the at least one cache node is in a preset range, executing the scheduling of the at least one cache node.
2. The method according to claim 1, wherein the calculating the heat coefficient of the at least one cache node in a preset historical time according to the multimedia resource cached in the at least one cache node comprises:
determining a heat coefficient HC corresponding to the at least one cache node through a formula HC ═ PV/UU;
PV is the number of times of accessing the multimedia resources in the preset historical time, and UU is the number of the multimedia resources after the duplication removal in the preset historical time.
3. The method according to claim 2, wherein the cache nodes comprise a first cache node and a second cache node in a content distribution network, and the performing the scheduling of the at least one cache node when the heat coefficient of the at least one cache node is in a preset range comprises:
when the heat coefficient corresponding to the first cache node and the second cache node is within the preset range, acquiring a first utilization rate corresponding to the first cache node and a second utilization rate corresponding to the second cache node;
if the first utilization rate is greater than the second utilization rate, judging that the first cache node corresponds to a high utilization rate, and the second cache node corresponds to a low utilization rate, and scheduling the first cache node to a corresponding user;
and if the first utilization rate is smaller than the second utilization rate, judging that the first cache node corresponds to a low utilization rate, and the second cache node corresponds to a high utilization rate, and scheduling the second cache node to a corresponding user.
4. The method according to claim 2, wherein the performing the scheduling of the at least one cache node when the heat coefficient of the at least one cache node is within a preset range comprises:
receiving at least one current user request, wherein the current user request is used for requesting to acquire a corresponding target multimedia resource;
matching the at least one cache node corresponding to at least one current user request according to at least one current user request;
acquiring the heat coefficient of the at least one matched cache node;
and selecting the current optimal cache node matched with the current user request according to the heat coefficient and the current user request so as to schedule the current user request to the current optimal cache node.
5. The method according to claim 4, wherein the selecting a currently optimal cache node matching the current user request according to the heat coefficient and the current user request to schedule the current user request to the currently optimal cache node further comprises:
classifying the target multimedia resources according to preset multimedia resource category labels to obtain the classification types of the target multimedia resources;
and selecting the current optimal cache node matched with the current user request according to the heat coefficient and the classification type so as to schedule the current user request to the current optimal cache node.
6. The method according to claim 5, wherein the selecting the current optimal cache node matching the current user request according to the heat coefficient and the classification type to schedule the current user request to the current optimal cache node further comprises:
and when the heat coefficient of the at least one cache node is within the preset range and the at least one cache node comprises the classification type of the target multimedia resource, selecting the cache node closest to the user as the current optimal cache node, and scheduling the current user request to the current optimal cache node.
7. The method according to claim 5, wherein the selecting the current optimal cache node matching the current user request according to the heat coefficient and the classification type to schedule the current user request to the current optimal cache node further comprises:
and when the heat coefficient of the at least one cache node is within the preset range and the at least one cache node does not contain the classification type of the target multimedia resource, acquiring the utilization rate of each cache node, selecting the cache node with the highest utilization rate as the current optimal cache node, and scheduling the current user request to the current optimal cache node.
8. A multimedia resource scheduling system, the system comprising:
the cache module is used for caching the multimedia resources to at least one cache node;
the selection module is used for distributing the multimedia resources in the at least one cache node to corresponding users according to user requests;
the computing module is used for computing the heat coefficient of the at least one cache node in preset historical time according to the multimedia resources cached in the at least one cache node;
and the scheduling module is used for executing the scheduling of the at least one cache node when the heat coefficient of the at least one cache node is in a preset range.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the multimedia resource scheduling method according to any of claims 1 to 7 when executing the computer program.
10. A computer-readable storage medium, having stored therein a computer program, the computer program being executable by at least one processor for causing the at least one processor to perform the steps of the multimedia asset scheduling method according to any of claims 1 to 7.
CN201910862829.5A 2019-09-12 2019-09-12 Multimedia resource scheduling method and system Active CN112491939B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910862829.5A CN112491939B (en) 2019-09-12 2019-09-12 Multimedia resource scheduling method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910862829.5A CN112491939B (en) 2019-09-12 2019-09-12 Multimedia resource scheduling method and system

Publications (2)

Publication Number Publication Date
CN112491939A true CN112491939A (en) 2021-03-12
CN112491939B CN112491939B (en) 2022-12-27

Family

ID=74920582

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910862829.5A Active CN112491939B (en) 2019-09-12 2019-09-12 Multimedia resource scheduling method and system

Country Status (1)

Country Link
CN (1) CN112491939B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113472888A (en) * 2021-07-07 2021-10-01 挂号网(杭州)科技有限公司 Webpage access method, device, server equipment and storage medium

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101599994A (en) * 2009-06-01 2009-12-09 中兴通讯股份有限公司 The method of transfer files data between distributed file system, access node and node
CN102244900A (en) * 2011-07-15 2011-11-16 上海华为技术有限公司 Method, device and system for synchronizing cached data heat value, and distributed caching method
CN103414747A (en) * 2013-07-11 2013-11-27 广东工业大学 Adaptive streaming media caching method
CN104794064A (en) * 2015-04-21 2015-07-22 华中科技大学 Cache management method based on region heat degree
CN105376218A (en) * 2015-10-21 2016-03-02 上海思华科技股份有限公司 Stream media system and method for fast responding to user request
CN107370811A (en) * 2017-07-14 2017-11-21 北京知道创宇信息技术有限公司 A kind of resource distribution method of CDN, computing device and readable storage medium storing program for executing
CN107426302A (en) * 2017-06-26 2017-12-01 腾讯科技(深圳)有限公司 Access scheduling method, apparatus, system, terminal, server and storage medium
CN107872478A (en) * 2016-09-26 2018-04-03 中国移动通信有限公司研究院 A kind of content buffering method, device and system
CN109167828A (en) * 2018-08-22 2019-01-08 杭州领智云画科技有限公司 CDN caching method and system
CN109688171A (en) * 2017-10-18 2019-04-26 中国电信股份有限公司 Spatial cache dispatching method, device and system

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101599994A (en) * 2009-06-01 2009-12-09 中兴通讯股份有限公司 The method of transfer files data between distributed file system, access node and node
CN102244900A (en) * 2011-07-15 2011-11-16 上海华为技术有限公司 Method, device and system for synchronizing cached data heat value, and distributed caching method
CN103414747A (en) * 2013-07-11 2013-11-27 广东工业大学 Adaptive streaming media caching method
CN104794064A (en) * 2015-04-21 2015-07-22 华中科技大学 Cache management method based on region heat degree
CN105376218A (en) * 2015-10-21 2016-03-02 上海思华科技股份有限公司 Stream media system and method for fast responding to user request
CN107872478A (en) * 2016-09-26 2018-04-03 中国移动通信有限公司研究院 A kind of content buffering method, device and system
CN107426302A (en) * 2017-06-26 2017-12-01 腾讯科技(深圳)有限公司 Access scheduling method, apparatus, system, terminal, server and storage medium
CN107370811A (en) * 2017-07-14 2017-11-21 北京知道创宇信息技术有限公司 A kind of resource distribution method of CDN, computing device and readable storage medium storing program for executing
CN109688171A (en) * 2017-10-18 2019-04-26 中国电信股份有限公司 Spatial cache dispatching method, device and system
CN109167828A (en) * 2018-08-22 2019-01-08 杭州领智云画科技有限公司 CDN caching method and system

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113472888A (en) * 2021-07-07 2021-10-01 挂号网(杭州)科技有限公司 Webpage access method, device, server equipment and storage medium
CN113472888B (en) * 2021-07-07 2024-01-05 挂号网(杭州)科技有限公司 Webpage access method and device, server equipment and storage medium

Also Published As

Publication number Publication date
CN112491939B (en) 2022-12-27

Similar Documents

Publication Publication Date Title
US20180246862A1 (en) Methods for prerendering and methods for managing and configuring prerendering operations
CN107463641B (en) System and method for improving access to search results
CN106933871B (en) Short link processing method and device and short link server
WO2017167050A1 (en) Configuration information generation and transmission method, and resource loading method, apparatus and system
CN105472045A (en) Database migration method and database migration device
CN111163072B (en) Method and device for determining characteristic value in machine learning model and electronic equipment
US10506027B2 (en) Selecting a content delivery network
CN110781372B (en) Method and device for optimizing website, computer equipment and storage medium
US10242102B2 (en) Network crawling prioritization
CN112104505B (en) Application recommendation method, device, server and computer readable storage medium
CN113411404A (en) File downloading method, device, server and storage medium
CN109982158B (en) UGC video distribution method and device and server
US9832322B1 (en) Techniques to transform network resource requests to zero rated network requests
CN109657164B (en) Method, device and storage medium for publishing message
CN112423134A (en) Video content recommendation method and device and computer equipment
CN112491939B (en) Multimedia resource scheduling method and system
CN107634854B (en) Service data processing method and device
CN113538024B (en) Advertisement management method, system and content transmission network equipment
CN112818270A (en) Data cross-domain transfer method and device and computer equipment
CN110708361B (en) System, method and device for determining grade of digital content publishing user and server
CN106294417A (en) A kind of data reordering method, device and electronic equipment
CN110020290B (en) Webpage resource caching method and device, storage medium and electronic device
CN113849125B (en) CDN server disk reading method, device and system
CN110691143B (en) File pushing method and device, electronic equipment and medium
CN110020111B (en) Travel recommendation method and device, computer equipment and storage medium

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