WO2023098702A1

WO2023098702A1 - Traffic balancing method, electronic device and computer readable storage medium

Info

Publication number: WO2023098702A1
Application number: PCT/CN2022/135301
Authority: WO
Inventors: 周美艳
Original assignee: 中兴通讯股份有限公司
Priority date: 2021-11-30
Filing date: 2022-11-30
Publication date: 2023-06-08
Also published as: CN116208556A

Abstract

The present application provides a traffic balancing method, an electronic device, and a computer readable storage medium. The traffic balancing method comprises: receiving a request of a target program; determining, according to an identifier of the target program, a first device to which the request is to be scheduled; and under the condition that the target program is a popular program, scheduling the request to a second device according to a residual bandwidth ratio of the first device.

Description

Traffic equalization method, electronic device, computer readable storage medium

Cross References to Related Applications

This application claims priority to Chinese Patent Application No. 202111446751.2 filed on November 30, 2021, the contents of which are hereby incorporated by reference in their entirety.

technical field

The present application relates to the field of communications, and in particular to a traffic equalization method, electronic equipment, and a computer-readable storage medium.

Background technique

With the widespread application of streaming media technology, streaming media programs have increased significantly, and users have continued to expand. More and more nodes and devices are required to bear the traffic of the entire site. Stability becomes a prominent issue.

At present, the general traffic balance scheduling strategy in the node is to cache the program data of the popular program in the edge node in advance, and when the edge node receives the request of the popular program, it will schedule the request of the popular program to the program data of the popular program The requests for non-popular programs are dispatched to other devices in the edge node, and the local cache device or the device with the smallest load in the node is used as much as possible. However, with the emergence of super popular programs such as boot videos, the current traffic balance scheduling strategy may cause node instability, and the excessive occupancy rate of popular programs will affect the scheduling of other programs on the device.

public content

In the first aspect, the embodiment of the present application provides a traffic balancing method, including: receiving a request for a target program; determining the first device to which the request is to be scheduled according to the identifier of the target program; and when the target program is In the case of popular programs, the request is dispatched to the second device according to the remaining bandwidth ratio of the first device.

In a second aspect, an embodiment of the present application provides an electronic device, including: at least one processor; and a memory, on which at least one computer program is stored, and when the at least one computer program is executed by the at least one processor, Implement the traffic balancing method described above.

In a third aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the foregoing traffic balancing method is implemented.

Description of drawings

FIG. 1 is a schematic diagram of the flow direction of the original code stream provided by the embodiment of the present application;

FIG. 2 is a flowchart of a flow balancing method provided in an embodiment of the present application;

FIG. 3 is a schematic diagram of the implementation of the traffic balancing method provided by the embodiment of the present application; and

FIG. 4 is a block diagram of a traffic equalization device provided by an embodiment of the present application.

Detailed ways

In order to enable those skilled in the art to better understand the technical solutions of the present application, the flow balancing method, electronic equipment, and computer-readable storage medium provided by the present application will be described in detail below with reference to the accompanying drawings.

Example embodiments will be described more fully hereinafter with reference to the accompanying drawings, but the example embodiments may be embodied in different forms and the application should not be construed as limited to the embodiments set forth herein. These embodiments are provided so that this application will be thorough and complete, and will fully enable those skilled in the art to fully understand the scope of this application.

In the case of no conflict, each embodiment of the present application and each feature in the embodiment can be combined with each other.

As used herein, the term "and/or" includes any and all combinations of at least one of the associated listed items.

The terminology used herein is for describing particular embodiments only, and does not limit the application. As used herein, the singular forms "a" and "the" also include plural forms unless the context clearly dictates otherwise. It will also be understood that when the terms "comprising" and/or "consisting of" are used in this specification, the presence of said features, integers, steps, operations, elements and/or components is specified but not excluded. Add at least one other feature, entity, step, operation, element, component and/or group thereof.

Unless otherwise defined, all terms (including technical terms and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having meanings consistent with their meanings in the context of the relevant art and the present application, and will not be interpreted as having idealized or excessive formal meanings unless This article expressly so limits.

FIG. 1 is a schematic diagram of the flow direction of the original code stream provided by the embodiment of the present application. As shown in Figure 1, the Internet TV (OTT, Over The Top) content provider provides OTT original code stream, and the original code stream can be, for example, a streaming media protocol (HLS, HTTP) based on Hypertext Transfer Protocol (HTTP, HyperText Transfer Protocol). Live Streaming) type of original code stream, Adaptive Streaming Media Protocol (DASH, Dynamic Adaptive Streaming over HTTP) type of original code stream, Multimedia System Service (MSS, Multimedia System Service) type of original code stream, etc. , this type of original code stream usually includes a description file and a media file; for example, the original code stream can also be an original code stream of a large file type, and this type of original code stream usually only has media files.

For example, the description file in the original code stream of the HLS type includes a main index and a sub-index. The main index can be, for example, index.m3u8, and the sub-index can be, for example, $rateid.m3u8.

The central node of the content delivery network (CDN, Content Delivery Network) injects all the OTT original code streams provided by the OTT content provider, and pushes the original code streams of popular programs to the edge nodes of the CDN, and the edge nodes inject the original code streams of popular programs The stream is cached in a device within the edge node.

The terminal sends a request to the edge node, and the edge node dispatches the request to a certain device in the edge node. If the original code stream of the requested program is cached in the dispatched device, the original code stream of the requested program will be sent by the dispatched device The stream is sent to the terminal to provide services for the terminal; if the original code stream of the requested program is not cached in the scheduled device, the source is returned to other devices of the edge node or the source is returned to the central node.

The process of scheduling the received requests by the edge nodes will be described in detail below.

FIG. 2 is a flowchart of a traffic balancing method provided by an embodiment of the present application.

In the first aspect, referring to FIG. 2 , the embodiment of the present application provides a traffic balancing method, which can be applied to a device with a scheduling function in an edge node, including steps 200 to 202 .

Step 200, receiving a request for a target program.

Step 201. Determine the first device to which the request is to be scheduled according to the identifier of the target program.

In some implementation manners, the first device to which the request is to be scheduled may be determined according to the hash value of the identifier of the target program.

Step 202, in the case that the target program is a popular program, dispatch the request to the second device according to the remaining bandwidth ratio of the first device.

In some implementations, a popular program is a program whose number of requests from users within a preset time period is greater than or equal to a first preset threshold.

In the traffic balancing method provided in this application, there are three specific implementation methods for scheduling requests to the second device according to the remaining bandwidth ratio of the first device. The following implementation methods are only examples and do not limit this application. scope of protection.

method one

In some implementations, the scheduling the request to the second device according to the remaining bandwidth ratio of the first device includes: in the case that the first device is determined to be a transferable device according to the remaining bandwidth ratio of the first device, scheduling the request To a device that can be transferred in other devices except the first device, the difference between the total remaining bandwidth ratio of the node and the remaining bandwidth ratio of the device that can be transferred out is greater than or equal to the second preset threshold, and the device that can be transferred in The difference between the remaining bandwidth ratio and the total remaining bandwidth ratio of nodes is greater than or equal to a third preset threshold. For example, the callable device here may be the edge device B as shown in FIG. 3 . In Figure 3, the programs requested by the N+1 to M requests are popular programs, then the N+1 to M requests are dispatched to the transferable device, that is, the edge device B instead of the edge device A In this way, the excessive traffic of edge device A is avoided, which will lead to the instability of the whole node.

In some embodiments, the remaining bandwidth ratio of the first device is the ratio of the remaining bandwidth of the first device to the total bandwidth of the first device, and the remaining bandwidth of the first device is the total bandwidth of the first device and the used bandwidth of the first device The difference between the bandwidth, the total remaining bandwidth ratio of the node is the ratio of the total remaining bandwidth of the node to the total bandwidth of the node, the total remaining bandwidth of the node is the difference between the total bandwidth of the node and the total used bandwidth of the node, The total bandwidth of a node is the sum of the total bandwidths of all devices in the node, and the total used bandwidth of a node is the sum of the used bandwidths of all devices in the node.

In the traffic balancing method provided in the present application, the request is dispatched to the device that can be transferred, that is, the second device is the device that can be transferred.

In the traffic balancing method provided by this application, after the request is dispatched to the transferable device, if the original code stream of the target program is buffered in the device to which the request is dispatched, the device to which the request is dispatched will transfer the original code stream of the target program The stream is sent to the terminal, that is, the device to which the request is dispatched provides services for the terminal; if the original code stream of the target program is not cached in the device to which the request is dispatched, the device to which the request is dispatched will return the request to the first device, if the original code stream of the target program is cached in the first device, the first device sends the original code stream of the target program to the terminal, that is, the first device provides services for the terminal; there is no cache in the first device In the case of the original code stream of the target program, the first device returns the request to the central node, and the central node sends the original code stream of the target program to the terminal, that is, the central node provides services for the terminal, and, since the target program is Popular programs, therefore, at least one of the first device and the device to which the request is scheduled caches the original code stream of the target program, so that at least one of the first device and the device to which the request is scheduled provides services for the terminal.

In some implementations, the dispatching the request to the transferable device includes: dispatching the request to the transferable device in a sequential order; or, polling the request according to the hash value of the transferable device Dispatch to callable devices.

In the traffic balancing method provided by this application, for scheduling requests to transferable devices in sequence, for example, assuming that there are 5 transferable devices in the edge node, the 5 devices are numbered as Device 1, Device 2, Device 3, Device 4, and Device 5, when dispatching a request to one of the five devices, dispatch to Device 1 first according to the number. If a request has been dispatched to Device 1 before, then this The second dispatch is to device 2, and so on. It can also be dispatched to device 1 first according to the number, and then dispatch the request to device 2 when device 1 is no longer a transferable device, and so on. Other scheduling methods may also be used, which is not limited in this application.

In the traffic balancing method provided in this application, the request is dispatched to the transferable device by polling according to the hash value of the transferable device. For example, it is assumed that the hash value of the transferable device is 1, 2, 3, the corresponding devices are respectively device 1, device 2, and device 3, then when the request is dispatched to one of the three devices, the three devices are polled, for example, first dispatched to Device 1, if a request has been dispatched to device 1 before, it will be dispatched to device 2 this time, and so on. It is also possible to dispatch to device 1 first, and then dispatch the request to device 2 when device 1 is no longer a transferable device, and so on. Other scheduling methods may also be used, which is not limited in this application.

way two

In some implementations, the scheduling the request to the second device according to the remaining bandwidth ratio of the first device further includes: determining that the first device is a callable device according to the remaining bandwidth ratio of the first device, and dividing the first device In the case that other devices other than the first device are not transferable devices, at least one of the second preset threshold and the third preset threshold is reduced, and the request is dispatched to other devices except the first device. any device. For example, here any one of the other devices except the first device may be the edge device C as shown in FIG. 3 . In Figure 3, the program requested by the M+1 to L requests is a popular program, then the M+1 to L requests are dispatched to any one of the other devices except the first device, that is, the edge In device C, instead of dispatching to edge device A, avoiding the excessive traffic of edge device A and causing the instability of the entire node.

In the traffic balancing method provided in this application, after the request is dispatched to any one of the other devices except the first device, the target program is cached in any one of the other devices except the first device In the case of the original bit stream of the target program, any one of the other devices except the first device sends the original bit stream of the target program to the terminal, that is, any one of the other devices except the first device sends the original bit stream of the target program to the terminal. The terminal provides the service; in the case that no original code stream of the target program is buffered in any device except the first device, any device except the first device will request back source to the first device, if the original code stream of the target program is buffered in the first device, the first device sends the original code stream of the target program to the terminal, that is, the first device provides services for the terminal; If the device does not have the original code stream of the target program cached, the first device returns the request to the central node, and the central node sends the original code stream of the target program to the terminal, that is, the central node provides services for the terminal, and, Since the target program is a popular program, at least one of the first device and any device other than the first device caches the original code stream of the target program, so that the first device and the first device other than the first device At least one of any one of the other devices subsequently provides services for the terminal.

way three

In some implementations, the scheduling the request to the second device according to the remaining bandwidth ratio of the first device further includes: when the first device is determined to be a transferable device according to the remaining bandwidth ratio of the first device, sending the request to Dispatch to first device. In the case that the original code stream of the target program is cached in the first device, the first device sends the original code stream of the target program to the terminal, that is, the first device provides services for the terminal; there is no target program in the first device In the case of the original code stream of the program, the first device sends the request back to the central node, and the central node sends the original code stream of the target program to the terminal, that is, the central node provides services for the terminal, and, since the target program is a popular program , therefore, the first device caches the original code stream of the target program, so that the first device can subsequently provide services for the terminal.

In some embodiments, for any situation in which the request is dispatched to the second device, that is, when the target program is a popular program and the second device is not the first device, the second device caches the target program original stream.

In some implementations, the traffic balancing method further includes: when the target program changes from a popular program to an unpopular program, deleting the original code stream of the target program cached in other devices except the first device.

In some implementations, when the target program is a popular program, it is possible to cache the target program, the device information of the scheduling device, and the information indicating whether the original code stream of the target program is cached in the scheduling device during each scheduling. The corresponding relationship is called the first corresponding relationship here. Then, when deleting the original code stream of the target program cached in other devices except the first device, it can be determined according to the first correspondence which scheduling device has the original code stream of the target program cached and deleted.

In some implementations, the traffic balancing method further includes: after scheduling the request to the second device according to the remaining bandwidth ratio of the first device, sending the identifier of the target program, the user information sending the request, and the device information of the second device The corresponding relationship between them is saved as an entry in the popular program user scheduling table. Here it is called the second correspondence.

In some implementations, the traffic balancing method further includes: before scheduling the request to the second device according to the remaining bandwidth ratio of the first device, searching for the device information of the scheduling device corresponding to the user information sending the request in the popular program user scheduling table ;Each entry in the hot program user schedule table contains the correspondence between the hot program identifier, user information, and device information of the scheduling device; the scheduling device corresponding to the user information that sends the request cannot be found in the popular program user schedule table In the case of the device information, continue to execute the step of scheduling the request to the second device according to the remaining bandwidth ratio of the first device.

In some implementations, the traffic balancing method further includes: when the device information of the scheduling device corresponding to the user information sending the request is found in the popular program user scheduling table, scheduling the request to the device corresponding to the found device information .

In some implementation manners, the user information may be any information characterizing the user, for example, user name, terminal information used by the user, and so on. This application does not limit user information.

In some implementation manners, the device information of the scheduling device refers to the device information of the device to which the request is scheduled, and specifically may refer to any information of the device, as long as it can be distinguished from other devices.

In some implementations, the traffic balancing method further includes: when the target program is not a popular program, scheduling the request to the first device. In the case that the original code stream of the target program is cached in the first device, the first device sends the original code stream of the target program to the terminal, that is, the first device provides services for the terminal; there is no target program in the first device In the case of the original code stream of the program, the first device returns the request to the central node, and the central node sends the original code stream of the target program to the terminal, that is, the central node provides services for the terminal. For example, the first device here may be an edge device A as shown in FIG. 3 , and if the target program is not a popular program, the request will be directly dispatched to the edge device A. In FIG. 3 , the terminal that initiates the first to L requests may be one terminal or multiple terminals, which is not limited here. The programs requested by the 1st to N requests are not popular programs, and the 1st to N requests are directly dispatched to the edge device A.

In the traffic balancing method provided by this application, when the requested target program is a popular program, instead of scheduling the request to the first device according to the hash value of the target Request scheduling to the second device, so that the scheduling of popular programs will not cause excessive traffic of a single device in the node, resulting in instability of the entire node, and will not cause excessive occupancy of popular programs and affect the scheduling of other programs on the device .

In some embodiments, the requests of the same user are dispatched to the same device as much as possible to ensure the stability of serving the same user.

In the second aspect, the embodiment of the present application provides an electronic device, including: at least one processor; and a memory, on which at least one computer program is stored, and when the at least one computer program is executed by at least one processor, the above-mentioned traffic balance is realized method.

Processor is a device with data processing capability, which includes but not limited to central processing unit (CPU), etc.; memory is a device with data storage capability, which includes but not limited to random access memory (RAM, more specifically SDRAM, DDR etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory (FLASH).

In some implementations, the processor and the memory are connected to each other through a bus, and further connected to other components of the computing device.

In a fourth aspect, referring to FIG. 4 , the embodiment of the present application provides a traffic balancing device, including: a receiving module 401 , a first scheduling module 402 and a second scheduling module 403 .

The receiving module 401 is configured to receive a request for a target program.

The first scheduling module 402 is configured to determine the first device to which the request is to be scheduled according to the identifier of the target program.

The second scheduling module 403 is configured to schedule the request to the second device according to the remaining bandwidth ratio of the first device when the target program is a popular program.

In some implementations, the second scheduling module 403 is further configured to: if the target program is a popular program and the second device is not the first device, cache the The original code stream of the target program.

In some implementations, the second scheduling module 403 is further configured to: when the target program changes from a popular program to an unpopular program, delete the target program cached in other devices except the first device The original stream of the program.

In some implementations, the second scheduling module 403 is further configured to: save the correspondence between the identifier of the target program, the user information sending the request, and the device information of the second device as an entry in the Popular programs in the user schedule.

In some implementations, the second scheduling module 403 is further configured to: search the popular program user scheduling table for the device information of the scheduling device corresponding to the user information sending the request; each entry in the popular program user scheduling table Contains the correspondence between the identification of popular programs, user information, and equipment information of scheduling equipment; if the equipment information of the scheduling equipment corresponding to the user information sending the request cannot be found in the popular program user scheduling table, Continue to execute the step of scheduling the request to the second device according to the remaining bandwidth ratio of the first device.

In some implementations, the second scheduling module 403 is further configured to: if the device information of the scheduling device corresponding to the user information sending the request is found in the popular program user scheduling table, schedule the request Find the device corresponding to the found device information.

In some implementations, the second scheduling module 403 is configured to implement the scheduling of the request to the second device according to the remaining bandwidth ratio of the first device in the following manner: according to the remaining bandwidth ratio of the first device When it is determined that the first device is a call-out device, schedule the request to a call-in device among other devices except the first device, and the total remaining bandwidth ratio of nodes and the call-out The difference between the remaining bandwidth ratios of the devices is greater than or equal to a second preset threshold, and the difference between the remaining bandwidth ratios of the transferable devices and the total remaining bandwidth ratios of nodes is greater than or equal to a third preset threshold.

In some implementations, the second scheduling module 403 is configured to implement the scheduling of the request to the callable device in the following manner: dispatch the request to the callable device in sequence; In the method of polling the hash value of the transferred device, the request is dispatched to the device that can be transferred.

In some implementations, the second scheduling module 403 is further configured to: determine that the first device is a callable device according to the remaining bandwidth ratio of the first device, and other devices except the first device In the case that none of them can be transferred into the device, at least one of the second preset threshold and the third preset threshold is adjusted to a small value, and the request is dispatched to other devices except the first device. any of the devices.

In some implementations, the second scheduling module 403 is further configured to: schedule the request to the second device when it is determined according to the remaining bandwidth ratio of the first device that the first device is a transferable device. a device.

The specific implementation process of the above traffic equalization device is the same as the specific implementation process of the aforementioned traffic equalization method, and will not be repeated here.

Those of ordinary skill in the art can understand that all or some of the steps in the methods disclosed above, the functional modules/units in the system, and the device can be implemented as software, firmware, hardware, and an appropriate combination thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be composed of several physical components. Components cooperate to execute. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). As known to those of ordinary skill in the art, the term computer storage media includes both volatile and nonvolatile media implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules, or other data. permanent, removable and non-removable media. Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cartridges, tape, magnetic disk storage or other magnetic storage, or may be used Any other medium that stores desired information and can be accessed by a computer. In addition, as is well known to those of ordinary skill in the art, communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media .

Example embodiments have been disclosed herein, and while specific terms have been employed, they are used and should be construed in a generic descriptive sense only and not for purposes of limitation. In some instances, it will be apparent to those skilled in the art that features, characteristics, and/or elements described in connection with a particular embodiment may be used alone or in combination with features, characteristics described in connection with other embodiments, unless expressly stated otherwise. and/or elements in combination. Accordingly, it will be understood by those of ordinary skill in the art that various changes in form and details may be made without departing from the scope of the present application as set forth in the appended claims.

Claims

A traffic balancing method, comprising:

receiving a request for a target program;

determining the first device to which the request is to be dispatched according to the identifier of the target program; and

In the case that the target program is a popular program, the request is dispatched to the second device according to the remaining bandwidth ratio of the first device.
The traffic balancing method according to claim 1, wherein, when the target program is a popular program and the second device is not the first device, buffering the target program in the second device original code stream.
The traffic balancing method according to claim 1, further comprising: when the target program changes from a popular program to an unpopular program, deleting the target program cached in other devices except the first device original code stream.
The traffic balancing method according to claim 1, further comprising:

After the request is dispatched to the second device according to the remaining bandwidth ratio of the first device, the corresponding relationship between the identifier of the target program, the user information sending the request, and the device information of the second device is used as a The entry is saved in the popular program user schedule table.
The traffic balancing method according to claim 1, further comprising:

Before scheduling the request to the second device according to the remaining bandwidth ratio of the first device, look up the device information of the scheduling device corresponding to the user information sending the request in the popular program user scheduling table; wherein, the popular program user scheduling Each entry of the table contains the correspondence between the identification of popular programs, user information and equipment information of the scheduling equipment;

In the case that the device information of the scheduling device corresponding to the user information sending the request cannot be found in the popular program user scheduling table, continue to perform the scheduling of the request according to the remaining bandwidth ratio of the first device. second device.
The traffic balancing method according to claim 5, further comprising:

If the device information of the scheduling device corresponding to the user information sending the request is found in the popular program user scheduling table, the request is scheduled to the device corresponding to the found device information.
The traffic balancing method according to any one of claims 1 to 6, wherein said scheduling the request to the second device according to the remaining bandwidth ratio of the first device comprises:

If it is determined according to the remaining bandwidth ratio of the first device that the first device is a transferable device, schedule the request to a transferable device among other devices except the first device, and the node always The difference between the remaining bandwidth ratio and the remaining bandwidth ratio of the transferable device is greater than or equal to a second preset threshold, and the difference between the remaining bandwidth ratio of the transferable device and the total remaining bandwidth ratio of the node is greater than or equal to the third preset threshold.
The traffic balancing method according to claim 7, wherein the callable device for scheduling requests to other devices except the first device includes:

dispatching the requests to the callable device in sequential order;

Alternatively, the request is dispatched to the callable device in a manner of polling according to the hash value of the callable device.
The traffic balancing method according to claim 7, wherein said scheduling the request to the second device according to the remaining bandwidth ratio of the first device further comprises:

If it is determined according to the remaining bandwidth ratio of the first device that the first device is a device that can be called out, and all other devices except the first device are not devices that can be called in, the second At least one of the preset threshold and the third preset threshold is turned down, and the request is dispatched to any one of the other devices except the first device.
The traffic balancing method according to claim 7, wherein said scheduling the request to the second device according to the remaining bandwidth ratio of the first device further comprises:

If it is determined according to the remaining bandwidth ratio of the first device that the first device is a device that can be transferred in, the request is scheduled to the first device.
An electronic device comprising:

at least one processor; and

A memory, where at least one computer program is stored, and when the at least one computer program is executed by the at least one processor, the traffic balancing method described in any one of claims 1 to 10 is realized.
A computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the traffic balancing method according to any one of claims 1 to 10 is implemented.