CN115086300B

CN115086300B - Video file scheduling method and device

Info

Publication number: CN115086300B
Application number: CN202210688725.9A
Authority: CN
Inventors: 孙国良; 于潜江
Original assignee: Letv Cloud Network Technology Beijing Co ltd
Current assignee: Letv Cloud Network Technology Beijing Co ltd
Priority date: 2022-06-16
Filing date: 2022-06-16
Publication date: 2023-09-08
Anticipated expiration: 2042-06-16
Also published as: CN115086300A

Abstract

The embodiment of the disclosure provides a video file scheduling method and device, which are applied to the technical field of computers. The method comprises the steps of receiving a play request sent by a client, and extracting code rate information and a file name suffix of a video file from the play request; searching whether a scheduling strategy corresponding to the video file with the corresponding code rate information exists in a scheduling strategy library; if yes, scheduling the video file according to the scheduling strategy, and returning a response to the client; if not, extracting CDN edge nodes with the difference value between the downloading speed and the code rate information in CDN edge nodes containing the same file name suffix and the lowest cost within a preset threshold according to the file name suffix, scheduling video files according to the extracted CDN edge node address information, and returning a response to the client. In this way, the indiscriminate source can be returned to the regional center node no longer when the video file is scheduled, the edge node can be fully utilized, and the CDN cost is saved.

Description

Video file scheduling method and device

Technical Field

The disclosure relates to the field of computer technology, and in particular, to a video file scheduling method and device.

Background

The CDN (Content Delivery Network ) is a layer of intelligent virtual network based on the existing internet by placing node servers throughout the network. The CDN can redirect the user's request to the service node nearest to the user according to the network flow, the connection of each node, the load condition, the distance to the user, the response time and other comprehensive information in real time, and the purpose is to select the node relatively nearer to the user to send the content required by the user to the user, thereby relieving the condition of network congestion and improving the response speed.

The traditional CDN adopts a hierarchical storage manner, the edge node stores a part of video files, the regional center (or called secondary node) stores most of the video files, and the center node (source station) typically stores all movies for the next-level node to use. As the video service demands of users develop towards high definition, mass and long tail, according to the traditional hierarchical storage mode, because all the return sources need to pass through the regional center node, the storage needed by the regional center node needs to be large enough, because the CDN storage file generally adopts an LRU policy (a page replacement algorithm for memory management, an operating system can remove data blocks (memory blocks) in a memory but not used as LRU according to which data belong to LRU and make space for the memory to load other data), after the storage is full, the file of the regional center node needs to be frequently swapped out, and after the swap-out, the file needs to be penetrated to a source station, thereby bringing about an increase in cost for the source station. Video files are indifferently sourced back to the regional center node, which is more costly than the edge nodes, since regional center nodes are typically BGP (external gateway protocol) or multi-line data centers. For video files, the video files are generally larger, and the playing experience is not affected by millisecond delay, so that the regional center nodes with good network quality or high cost are not required to be used for serving all video files.

Disclosure of Invention

The disclosure provides a video file scheduling method, a video file scheduling device, video file scheduling equipment and a storage medium.

According to a first aspect of the present disclosure, a video file scheduling method is provided. The method comprises the following steps:

receiving a play request sent by a client, and extracting code rate information and a file name suffix of a video file from the play request;

searching whether a scheduling strategy corresponding to the video file with the corresponding code rate information exists in a scheduling strategy library;

if yes, scheduling the video file according to the scheduling strategy, and returning a response to the client;

if not, extracting CDN edge nodes with the difference value between the downloading speed and the code rate information in CDN edge nodes containing the same file name suffix and the lowest cost within a preset threshold according to the file name suffix, scheduling video files according to the extracted CDN edge node address information, and returning a response to the client.

Further, the download speed is obtained by the following method:

and periodically extracting incremental data of each CDN edge node, and updating the downloading speed of each CDN edge node.

Further, the incremental data is obtained by the CDN edge node obtaining file name suffix information and corresponding file download speed information from a request log, and averaging the download speed information with the same file name suffix as a set of data.

Further, after the video file is scheduled according to the extracted CDN edge node address information, the method further includes:

if the video file is not scheduled according to the extracted CDN edge node address information, acquiring the address information of the region center node corresponding to the extracted CDN edge node, and scheduling the video file according to the acquired address information of the region center node;

if the video file is not scheduled according to the acquired address information of the regional center node, the video file is scheduled according to the default source return address.

Further, the default back source address is obtained by taking the address of the CDN edge node corresponding to the maximum weighting value after weighted summation according to the network condition from each CDN edge node to the corresponding area center node and the load condition of equipment in each area center node.

Further, after the scheduling of the video file according to the default back source address, the method further includes: and storing the path and the address which are finally called to the video file into the scheduling policy library.

According to a second aspect of the present disclosure, a video file scheduling apparatus is provided. The device comprises:

the information receiving module is used for receiving a play request sent by the client and extracting code rate information and file name suffixes of the video files from the play request;

the strategy searching module is used for searching whether a scheduling strategy corresponding to the video file with the corresponding code rate information exists in the scheduling strategy library;

the strategy scheduling module is used for scheduling the video files according to the scheduling strategy; or alternatively, the process may be performed,

extracting CDN edge nodes with the difference value of the downloading speed and the code rate information in CDN edge nodes containing the same file name suffix and the lowest cost within a preset threshold according to the file name suffix, and scheduling video files according to the extracted CDN edge node address information;

and the response module is used for returning a response to the client.

According to a third aspect of the present disclosure, an electronic device is provided. The electronic device includes: a memory and a processor, the memory having stored thereon a computer program, the processor implementing the method as described above when executing the program.

According to a fourth aspect of the present disclosure, there is provided a computer readable storage medium having stored thereon a computer program which when executed by a processor implements a method according to the first aspect of the present disclosure.

According to the video file scheduling method and device, through code rate information of video files, corresponding scheduling strategies are searched in a scheduling strategy library, and the video files are scheduled according to the scheduling strategies; if the corresponding scheduling strategy is not found, searching CDN edge nodes meeting the conditions according to the code rate information, and finally realizing scheduling of the video file according to the preset path and method. In this way, the indiscriminate source can be returned to the regional center node no longer when the video file is scheduled, the edge node can be fully utilized, and the CDN cost is saved.

It should be understood that what is described in this summary is not intended to limit the critical or essential features of the embodiments of the disclosure nor to limit the scope of the disclosure. Other features of the present disclosure will become apparent from the following description.

Drawings

The above and other features, advantages and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. For a better understanding of the present disclosure, and without limiting the disclosure thereto, the same or similar reference numerals denote the same or similar elements, wherein:

FIG. 1 illustrates a flow chart of a video file scheduling method according to an embodiment of the present disclosure;

FIG. 2 illustrates a block diagram of a video file scheduling apparatus according to an embodiment of the present disclosure;

fig. 3 illustrates a block diagram of an exemplary electronic device capable of implementing embodiments of the present disclosure.

Detailed Description

For the purposes of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are some embodiments of the present disclosure, but not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments in this disclosure without inventive faculty, are intended to be within the scope of this disclosure.

In addition, the term "and/or" herein is merely an association relationship describing an association object, and means that three relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist together, and B exists alone. In addition, the character "/" herein generally indicates that the front and rear associated objects are an "or" relationship.

Fig. 1 shows a flowchart of a video file scheduling method 100 according to an embodiment of the present disclosure. The method 100 may be applied to various system platforms, and the execution subject may be a computer terminal or a dispatch center server of various mobile devices, including:

step 110, receiving a play request sent by a client, and extracting code rate information and a file name suffix of a video file from the play request.

In some embodiments, when a user needs to acquire a data resource, a play request may be sent to a dispatch center server through a client server. When the dispatch center server receives a play request sent by a client, code rate information and a file name suffix of a video file are extracted from the play request. Wherein, the data resources can be data resources such as movies, television shows, music, short videos and the like. The code rate information of the video file refers to the number of data bits transmitted in unit time during data transmission; common video file name suffixes are: AVI format suffix name ". AVI". WMV ". Mpg or. MPEG". QuickTime format suffix name ". Mov". RealVideo format suffix name ". Rm or. Ram". Flash format suffix ". Swf or. Flv". MPEG-4 format suffix ". Mp4", etc.

And 120, searching whether a scheduling strategy corresponding to the video file with the corresponding code rate information exists in a scheduling strategy library.

In some embodiments, according to the code rate information obtained in step 110, a corresponding scheduling policy is found in the scheduling policy library.

And step 130, if yes, scheduling the video file according to the scheduling strategy.

In some embodiments, the video file is scheduled according to the corresponding address information in the scheduling policy obtained in step 120. It should be noted that, the corresponding address information is the optimal scheduling address information of the video file corresponding to the code rate information, which is reserved in the history scheduling process, and may be CDN edge node address information or address information of a regional center node. The video file is not indiscriminate from the regional center node address dispatch any more, CDN edge nodes can be fully utilized, and CDN cost is saved.

And 140, if not, extracting CDN edge nodes with the difference value between the downloading speed and the code rate information in CDN edge nodes containing the same file name suffix within a preset threshold and with the lowest cost according to the file name suffix, and scheduling video files according to the extracted CDN edge node address information.

The downloading speed is obtained by the following method:

In some embodiments, for any CDN edge node, the CDN edge node obtains file name suffix information and corresponding file download speed information from the request log, then classifies the download speed information according to the file name suffix, and then averages the download speed information, and reports the average download speed of each type of file to the dispatch center server, and the dispatch center server counts incremental data reported by the CDN edge node, calculates an average value, and updates the download speed. The download speed information is classified according to the file name suffix to improve the matching accuracy. Meanwhile, due to timeliness of log data reservation, the scheduling center server gathers the incremental data and then calculates the average value and updates the incremental data, so that repeated processing of the data is avoided, and processing efficiency is improved.

In some embodiments, if no corresponding scheduling policy is found according to step 120, that is, no matching scheduling address is found in the existing scheduling policy, then a matching CDN edge node is obtained according to the code rate information and the file name suffix information obtained in step 110, that is, a CDN edge node having a difference between the download speed and the code rate information within a preset threshold and having a lowest cost, so that the selected CDN edge node meets the playing condition and has a lowest cost, thereby being convenient for fully utilizing the CDN edge node and saving the CDN cost.

In some embodiments, if the video file is not scheduled according to the address information of the CDN edge node extracted in step 140, acquiring address information of a region center node corresponding to the extracted CDN edge node, and scheduling the video file according to the acquired address information of the region center node; if the video file is not scheduled according to the acquired address information of the regional center node, the video file is scheduled according to the default source return address. The default back source address is obtained by taking the address of the CDN edge node corresponding to the maximum weighting value after weighted summation according to the network condition from each CDN edge node to the corresponding area center node and the load condition of equipment in each area center node. And the path and the address which are finally called to the video file are stored under the corresponding code rate information in the scheduling policy library, so that the video file with the same code rate information in the subsequent user playing request can be conveniently and rapidly scheduled.

And step 150, returning a response to the client.

In some embodiments, the video file scheduled by step 130 and/or step 140 is sent to the client server, which then presents the video file to the user on a user page.

According to the embodiment of the disclosure, the following technical effects are achieved:

according to the video file scheduling method, through code rate information of video files, a corresponding scheduling strategy is searched in a scheduling strategy library, and the video files are scheduled according to the scheduling strategy; if the corresponding scheduling strategy is not found, searching CDN edge nodes meeting the conditions according to the code rate information, and finally realizing scheduling of the video file according to the preset path and method. In this way, the indiscriminate source can be returned to the regional center node no longer when the video file is scheduled, the edge node can be fully utilized, and the CDN cost is saved.

It should be noted that, for simplicity of description, the foregoing method embodiments are all described as a series of acts, but it should be understood by those skilled in the art that the present disclosure is not limited by the order of acts described, as some steps may be performed in other orders or concurrently in accordance with the present disclosure. Further, those skilled in the art will also appreciate that the embodiments described in the specification are all alternative embodiments, and that the acts and modules referred to are not necessarily required by the present disclosure.

The foregoing is a description of embodiments of the method, and the following further describes embodiments of the present disclosure through examples of apparatus.

Fig. 2 shows a block diagram of a video file scheduling apparatus 200 according to an embodiment of the disclosure.

The apparatus 200 comprises:

an information receiving module 210, configured to receive a play request sent by a client, and extract code rate information and a file name suffix of a video file from the play request;

the policy searching module 220 is configured to search whether a scheduling policy corresponding to the video file with corresponding code rate information exists in a scheduling policy library;

a policy scheduling module 230, configured to schedule a video file according to the scheduling policy; or alternatively, the process may be performed,

and the response module 240 is configured to return a response to the client.

It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the described modules may refer to corresponding procedures in the foregoing method embodiments, which are not described herein again.

According to embodiments of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.

Fig. 3 shows a schematic block diagram of an electronic device 300 that may be used to implement embodiments of the present disclosure. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the disclosure described and/or claimed herein.

The device 300 comprises a computing unit 301 that may perform various suitable actions and processes in accordance with a computer program stored in a Read Only Memory (ROM) 302 or loaded from a storage unit 308 into a Random Access Memory (RAM) 303. In the RAM 303, various programs and data required for the operation of the device 300 may also be stored. The computing unit 301, the ROM302, and the RAM 303 are connected to each other by a bus 304. An input/output (I/O) interface 305 is also connected to bus 304.

Various components in device 300 are connected to I/O interface 305, including: an input unit 306 such as a keyboard, a mouse, etc.; an output unit 307 such as various types of displays, speakers, and the like; a storage unit 308 such as a magnetic disk, an optical disk, or the like; and a communication unit 309 such as a network card, modem, wireless communication transceiver, etc. The communication unit 309 allows the device 300 to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.

The computing unit 301 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of computing unit 301 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 301 performs the respective methods and processes described above, for example, a video file scheduling method. For example, in some embodiments, a video file scheduling method may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as storage unit 308. In some embodiments, part or all of the computer program may be loaded and/or installed onto the device 300 via the ROM302 and/or the communication unit 309. When a computer program is loaded into RAM 303 and executed by computing unit 301, one or more steps of a video file scheduling method described above may be performed. Alternatively, in other embodiments, the computing unit 301 may be configured to perform a video file scheduling method in any other suitable way (e.g. by means of firmware).

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.

Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and pointing device (e.g., a mouse or trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.

The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server may be a cloud server, a server of a distributed system, or a server incorporating a blockchain.

It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps recited in the present disclosure may be performed in parallel, sequentially, or in a different order, provided that the desired results of the disclosed aspects are achieved, and are not limited herein.

The above detailed description should not be taken as limiting the scope of the present disclosure. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present disclosure are intended to be included within the scope of the present disclosure.

Claims

1. A video file scheduling method, comprising:

2. The method of claim 1, wherein the download speed is obtained by:

3. The method of claim 2 wherein the incremental data is obtained by the CDN edge node obtaining file name suffix information and corresponding file download speed information from a request log and averaging the download speed information with the same file name suffix as a set of data.

4. The method of claim 1, further comprising, after said scheduling a video file according to the extracted CDN edge node address information:

5. The method of claim 4 wherein the default back source address is obtained by taking the address of the CDN edge node corresponding to the maximum weighted value after weighted summation according to the network condition from each CDN edge node to the corresponding regional center node and the load condition of the devices in each regional center node.

6. The method of claim 4, further comprising, after said scheduling the video file according to the default back source address: and storing the path and the address which are finally called to the video file into the scheduling policy library.

7. A video file scheduling apparatus comprising:

the strategy scheduling module is used for scheduling the video files according to the scheduling strategies when the scheduling strategies corresponding to the video files with the corresponding code rate information exist in the scheduling strategy library; or when the scheduling policy corresponding to the video file with the corresponding code rate information does not exist in the scheduling policy library, extracting CDN edge nodes with the difference value of the downloading speed and the code rate information in CDN edge nodes containing the same file name suffix within a preset threshold and with the lowest cost according to the file name suffix, and scheduling the video file according to the extracted CDN edge node address information;

and the response module is used for returning a response to the client.

8. An electronic device, comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein, the liquid crystal display device comprises a liquid crystal display device,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-6.

9. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of any one of claims 1-6.