CN115086300A

CN115086300A - Video file scheduling method and device

Info

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

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 playing request sent by a client, and extracting code rate information and a file name suffix of a video file from the playing request; searching a scheduling strategy library for whether a scheduling strategy corresponding to the video file with corresponding code rate information exists or not; if so, scheduling the video file according to the scheduling strategy, and returning a response to the client; if not, according to the file name suffix, extracting the CDN edge node with the lowest cost and the difference value between the download speed and the code rate information in the CDN edge node containing the same file name suffix within a preset threshold, scheduling the video file according to the extracted CDN edge node address information, and returning a response to the client. In this way, the video file can be dispatched without being indiscriminately back to the regional center node, the edge nodes can be fully utilized, and the cost of the CDN is saved.

Description

Video file scheduling method and device

Technical Field

The present disclosure relates to the field of computer technologies, and in particular, to a method and an apparatus for scheduling video files.

Background

A CDN (Content Delivery Network) is a layer of intelligent virtual Network on top of the existing internet, which is formed by placing node servers throughout the Network. The CDN can redirect a request of a user to a service node closest to the user according to network traffic, connection of each node, a load condition, a distance to the user, response time, and other comprehensive information in real time, and aims to select a node relatively close to the user to send content required by the user to the user, alleviate a congested condition of the network, and improve response speed.

In a traditional CDN, a hierarchical storage manner is adopted, where an edge node stores part of video files, a regional center (or a secondary node) stores most of the video files, and a central node (a source station) usually stores all movies for a lower node to use back to the source. As the demand of users for video services develops towards high definition, mass and long tail, according to the traditional hierarchical storage mode, since all return sources pass through the area center node, the storage required by the area center node is large enough, and since the CDN storage file generally adopts an LRU policy (a page replacement algorithm for memory management, which is called LRU for data blocks (memory blocks) in the memory but not used, and an operating system moves the data out of the memory according to which data belongs to the LRU and frees up space to load additional data), after the storage is full, the file of the area center node is frequently swapped out, and the swapped out file penetrates through to the source station, which increases the cost of the source station. The video file is indiscriminately sourced back to the regional hub node, which is typically a BGP (exterior gateway protocol) or multi-wire data center at a higher cost than the edge nodes. For video files, the video files are generally large, and the playing experience cannot be influenced by millisecond delay, so that it is not necessary to use regional center nodes with good network quality or high cost for all the video files to serve.

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 playing request sent by a client, and extracting code rate information and a file name suffix of a video file from the playing request;

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

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

if not, according to the file name suffix, extracting the CDN edge node with the lowest cost and the difference value between the download speed and the code rate information in the CDN edge node containing the same file name suffix within a preset threshold, scheduling the video file 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.

Furthermore, the incremental data is obtained by the CDN edge node obtaining file name suffix information and corresponding file downloading speed information from a request log, and taking the downloading speed information with the same file name suffix as a group of data to obtain an average value.

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 a regional center node corresponding to the extracted CDN edge node, and scheduling the video file according to the acquired address information of the regional center node;

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

Further, the default back-to-source address is obtained by weighting and summing the network condition from each CDN edge node to the corresponding regional center node and the load condition of the device in each regional center node, and then taking the address of the CDN edge node corresponding to the maximum weighted value.

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

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

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

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

the strategy scheduling module is used for scheduling the video file according to the scheduling strategy; or,

extracting CDN edge nodes with the lowest cost and the difference value of the downloading speed and the code rate information in CDN edge nodes containing the same file name suffixes within a preset threshold value according to the file name suffixes, 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 having a computer program stored thereon and a 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, performs the method according to the first aspect of the present disclosure.

According to the video file scheduling method and device, the corresponding scheduling strategy is searched in the scheduling strategy library through the code rate information of the video file, and the video file is scheduled according to the scheduling strategy; if the corresponding scheduling strategy is not found, searching the CDN edge node which meets the conditions according to the code rate information, and finally realizing the scheduling of the video file according to a preset path and a preset method. In this way, the video file can be dispatched without being returned to the regional center node indiscriminately, the edge node can be fully utilized, and the CDN cost is saved.

It should be understood that the statements herein reciting aspects are not intended to limit the critical or essential features of the embodiments of the present disclosure, nor are they intended to limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.

Drawings

The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. The accompanying drawings are included to provide a further understanding of the present disclosure, and are not intended to limit the disclosure thereto, and the same or similar reference numerals will be used to indicate the same or similar elements, where:

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

fig. 2 shows 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

To make the objects, technical solutions and advantages of the embodiments of the present disclosure more clear, the technical solutions of the embodiments of the present disclosure will be described clearly and completely with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are some, but not all embodiments of the present disclosure. All other embodiments, which can be derived by a person skilled in the art from the embodiments disclosed herein without making any creative effort, shall fall within the protection scope of the present disclosure.

In addition, the term "and/or" herein is only one kind of association relationship describing an associated object, and means that there may be three kinds of relationships, for example, a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.

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

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

In some embodiments, when the user needs to obtain the data resource, a play request may be sent to the dispatch center server through the client server. When the dispatching center server receives a playing request sent by the client, code rate information and a file name suffix of the video file are extracted from the playing request. The data resource may be a data resource of a movie, a tv show, music, a short video, etc. Wherein, the code rate information of the video file refers to the data bit number transmitted in unit time during data transmission; the common video filename is suffixed with: AVI format suffix ". AVI", WMV format suffix ". WMV", MPEG format suffix ". mpg or. MPEG", QuickTime format suffix ". mov", RealVideo format suffix ". rm or. ram", Flash format suffix ". swf or. flv", Mpeg-4 format suffix ". mp 4", etc.

And step 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 scheduling address information of the video file that is retained in the historical scheduling process and corresponds to the code rate information, and may be CDN edge node address information or address information of a regional center node. The video file is not dispatched from the regional central node address indiscriminately any more, CDN edge nodes can be fully utilized, and CDN cost is saved.

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

Wherein the download speed is obtained by the following method:

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 taking the download speed information with the same file name suffix as a group of data to obtain an average value.

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

In some embodiments, if a corresponding scheduling policy is not found according to step 120, that is, there is no matching scheduling address in the existing scheduling policy, a matching CDN edge node is obtained according to analysis of the code rate information and the file name suffix information obtained in step 110, that is, a CDN edge node whose difference between the download speed and the code rate information is within a preset threshold and whose cost is lowest, so that the selected CDN edge node meets the play condition and has the lowest cost, which is 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 CDN edge node address information extracted in step 140, obtaining address information of a regional center node corresponding to the extracted CDN edge node, and scheduling the video file according to the obtained address information of the regional center node; and if the video file is not scheduled according to the acquired address information of the regional center node, scheduling the video file according to the default return source address. And the default back-source address is obtained by weighting and summing the network condition from each CDN edge node to the corresponding regional center node and the load condition of equipment in each regional center node and then taking the address of the CDN edge node corresponding to the maximum weighted value. And storing the path and address of the finally called video file into the corresponding code rate information in the scheduling strategy library, thereby facilitating the rapid scheduling of the video file with the same code rate information in the subsequent user playing request.

Step 150, returning a response to the client.

In some embodiments, the video file scheduled in step 130 and/or step 140 is sent to a 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 a video file, a corresponding scheduling strategy is searched in a scheduling strategy library, and the video file is scheduled according to the scheduling strategy; if the corresponding scheduling strategy is not found, searching for a CDN edge node meeting the conditions according to the code rate information, and finally realizing the scheduling of the video file according to a preset path and a preset method. In this way, the video file can be dispatched without being returned to the regional center node indiscriminately, the edge node can be fully utilized, and the CDN cost is saved.

It is noted that while for simplicity of explanation, the foregoing method embodiments have been described as a series of acts or combination of acts, it will be appreciated by those skilled in the art that the present disclosure is not limited by the order of acts, as some steps may, in accordance with the present disclosure, occur in other orders and concurrently. Further, those skilled in the art should also appreciate that the embodiments described in the specification are exemplary embodiments and that acts and modules referred to are not necessarily required by the disclosure.

The above is a description of embodiments of the method, and the embodiments of the apparatus are further described below.

Fig. 2 shows a block diagram of a video file scheduling apparatus 200 according to an embodiment of the present 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 filename suffix of a video file from the play request;

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

a policy scheduling module 230, configured to schedule the video file according to the scheduling policy; or,

a response module 240, configured to return a response to the client.

It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working process of the described module may refer to the corresponding process in the foregoing method embodiment, and is not described herein again.

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

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 phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the disclosure described and/or claimed herein.

The device 300 comprises a computing unit 301 which may perform various suitable actions and processes in accordance with a computer program stored in a Read Only Memory (ROM)302 or a computer program 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 can also be stored. The calculation unit 301, the ROM302, and the RAM 303 are connected to each other via 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, or the like; an output unit 307 such as various types of displays, speakers, and the like; a storage unit 308 such as a magnetic disk, 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 the computing unit 301 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various dedicated Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, and so forth. The computing unit 301 performs the various methods and processes described above, such as 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 in 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 device 300 via ROM302 and/or communication unit 309. When the computer program is loaded into the RAM 303 and executed by the computing unit 301, one or more steps of a video file scheduling method as described above may be performed. Alternatively, in other embodiments, the computing unit 301 may be configured to perform a video file scheduling method by any other suitable means (e.g., by means of firmware).

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), system on a 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 that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.

Program code for implementing the methods of the present disclosure may be written in any combination of one or more programming languages. These program codes 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 codes, when executed by the processor or controller, cause the functions/operations specified in the flowchart and/or block diagram to be performed. 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. A 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 a pointing device (e.g., a mouse or a 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 can 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, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end 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 back-end, 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 clients and servers. A client and server are generally 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 with a combined blockchain.

It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present disclosure may be executed in parallel or sequentially or in different orders, and are not limited herein as long as the desired results of the technical solutions disclosed in the present disclosure can be achieved.

The above detailed description should not be construed as limiting the scope of the disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present disclosure should be included in the scope of protection 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 group of data.

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

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

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

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

7. A video file scheduling apparatus, comprising:

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 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 having stored thereon computer instructions for causing the computer to perform the method of any one of claims 1-6.