Path determination method, communication device, and storage medium
By obtaining the network topology of the audio and video system and determining the path that meets the concave parameters and key parameters, the problem that path planning in the existing technology is difficult to meet multiple parameter requirements at the same time, achieving more efficient path planning applicability and accuracy .
Patent Information
- Application Number
- PCT/CN2024/086335
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-05-29
- Filing Date
- 2024-04-07
- Publication Date
- 2024-12-05
AI Technical Summary
The existing real-time audio and video communication path planning technology is difficult to meet the business needs of multiple parameters at the same time, resulting in limitations in path planning in actual applications, and it is impossible to ensure that each parameter meets the business needs.
By obtaining the network topology of the audio and video system, a link that meets the concave parameter constraints is determined, a second network topology is generated, and a third network topology is generated based on the key parameters with the highest impact among the additive and multiplication parameters, and then multiplexing is determined The candidate paths are finally selected from which the target path selection constraints meet the path selection constraints.
It improves the applicability and accuracy of path planning, makes path planning suitable for a variety of business scenarios, and improves the practicality and accuracy of path planning.
Smart Images

Figure CN2024086335_05122024_PF_FP_ABST
Abstract
Description
Path determination method, communication device and storage medium
[0001] This disclosure claims priority to Chinese patent application No. 202310622100.7, filed on May 29, 2023, the entire contents of which are incorporated herein by reference. Technical Field
[0002] The present disclosure relates to the field of audio and video communications, and in particular to a path determination method, a communication device, and a storage medium. Background Art
[0003] With the popularization of mobile Internet and the commercialization of fifth-generation mobile communication technology (5G), users' demand for low-latency, highly reliable audio and video applications is growing. Among some technologies, Real-Time Communication (RTC), relying on its long-term technical accumulation in the video business field, quickly provides the industry with high concurrency, low latency, high-definition smoothness, security and reliability, full-scene, fully interactive, and real-time audio and video services. It is suitable for various application scenarios such as online education, cloud conferencing, social entertainment, etc. Path planning is the core technology of Real-Time Network (RTN). Path planning refers to planning the optimal transmission path between edge nodes by aggregating and calculating edge data.
[0004] Summary of the Invention
[0005] In one aspect, an embodiment of the present disclosure provides a path determination method. The path determination method includes:
[0006] Acquire a first network topology of the audio and video system, where attribute information of a link in the first network topology includes transmission parameters of the link, and the transmission parameters of the link include a concave parameter, an additive parameter, and a multiplicative parameter;
[0007] Determining links that satisfy the concavity parameter constraint condition from the first network topology, and generating a second network topology based on the links that satisfy the concavity parameter constraint condition;
[0008] generating a third network topology based on key parameters of the links in the second network topology; the key parameters being the parameters having the greatest impact on the target service type among the additive parameters and the multiplicative parameters; and the attribute information of the links in the third network topology including a quantized score determined by the key parameters;
[0009] determining a plurality of candidate paths based on the third network topology;
[0010] Determine a target path that meets the path selection constraints from multiple candidate paths.
[0011] In another aspect, an embodiment of the present disclosure provides a path determination device, which includes an acquisition module and a processing module.
[0012] An acquisition module, configured to acquire a first network topology of the audio and video system, wherein the attribute information of the link in the first network topology includes transmission parameters of the link, and the transmission parameters of the link include concave parameters, additive parameters, and multiplicative parameters;
[0013] a processing module, configured to determine links satisfying a concave parameter constraint condition from the first network topology, and generate a second network topology based on the links satisfying the concave parameter constraint condition;
[0014] The processing module is further configured to generate a third network topology based on key parameters of the links in the second network topology; wherein the key parameters are the parameters that have the greatest impact on the target service type among the additive parameters and the multiplicative parameters; and the attribute information of the links in the third network topology includes a quantized score determined by the key parameters;
[0015] The processing module is further configured to determine a plurality of candidate paths based on the third network topology; and determine a target path that satisfies the path selection constraint condition from the plurality of candidate paths.
[0016] In another aspect, an embodiment of the present disclosure provides a communication device, comprising: a processor and a memory, wherein the memory stores instructions executable by the processor; and when the processor is configured to execute the instructions, the communication device implements the method provided in the above aspect.
[0017] In yet another aspect, an embodiment of the present disclosure provides a computer-readable storage medium storing computer instructions, which, when executed on a computer, causes the computer to execute any of the above methods.
[0018] In another aspect, an embodiment of the present disclosure provides a computer program product comprising computer instructions. When the computer instructions are executed on a computer, the computer is caused to execute the method described in any one of the above aspects. BRIEF DESCRIPTION OF THE DRAWINGS
[0019] The accompanying drawings are used to provide a further understanding of the technical solution of the present disclosure and constitute a part of the specification. Together with the embodiments of the present disclosure, they are used to explain the technical solution of the present disclosure and do not constitute a limitation to the technical solution of the present disclosure.
[0020] FIG1 is a schematic diagram of an audio and video system architecture according to some embodiments.
[0021] FIG2 is a flow chart of a path determination method according to some embodiments.
[0022] FIG3 is a schematic diagram of a network topology according to some embodiments.
[0023] FIG4 is a schematic diagram of another network topology according to some embodiments.
[0024] FIG5 is a schematic diagram of a candidate path according to some embodiments.
[0025] FIG6 is a schematic diagram showing the composition of a path determination device according to some embodiments.
[0026] FIG7 is a schematic structural diagram of a path determination device according to some embodiments. DETAILED DESCRIPTION
[0027] The following will be combined with the accompanying drawings in the embodiments of the present disclosure to clearly and completely describe the technical solutions in the embodiments of the present disclosure. Obviously, the embodiments described are only part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments of the present disclosure, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of the present disclosure.
[0028] In the description of the present disclosure, unless otherwise specified, " / " means "or". For example, A / B can mean A or B. "And / or" in this article is merely a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can mean: only A, only B, and A and B. In addition, "at least one" means one or more, and "a plurality" means two or more. Expressions such as "first" and "second" do not limit the quantity and execution order, and expressions such as "first" and "second" do not necessarily limit them to be different.
[0029] It should be noted that in this disclosure, expressions such as "exemplarily" or "for example" are used to indicate examples, illustrations, or explanations. Any embodiment or design described in this disclosure as "exemplary" or "for example" should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of expressions such as "exemplarily" or "for example" is intended to present the relevant concepts in a detailed manner.
[0030] In some technologies, RTN path planning often uses a composite parameter to represent the characteristics of multiple parameters, constructing a function mapping model using these parameters as function variables, and using the function value as the path planning criterion. However, this path planning approach still has significant limitations.
[0031] In practice, real-time audio and video communication applications typically rely on RTN systems to achieve high-speed, high-quality data transmission. These applications may require multiple independent parameters (such as network latency, packet loss rate, and bandwidth). Therefore, the aforementioned path planning method cannot guarantee that every path parameter meets service requirements.
[0032] In view of this, an embodiment of the present disclosure provides a path determination method, which includes: obtaining a first network topology of an audio and video system, wherein the attribute information of the link in the first network topology includes the transmission parameters of the link, and the transmission parameters of the link include concave parameters, additive parameters, and multiplicative parameters; determining a link that meets the concave parameter constraint condition from the first network topology, and generating a second network topology based on the link that meets the concave parameter constraint condition; generating a third network topology based on the key parameters of the link in the second network topology, wherein the key parameter is the parameter with the highest degree of influence on the target business type among the additive parameter and the multiplicative parameter, and the attribute information of the link in the third network topology includes a quantized score determined by the key parameter; determining multiple candidate paths based on the third network topology; and determining a target path that meets the path selection constraint condition from the multiple candidate paths. In this way, path planning can be applied to a variety of business scenarios, improving the practicality and accuracy of path planning.
[0033] FIG1 shows an audio and video system architecture provided by an embodiment of the present disclosure. As shown in FIG1 , the audio and video system may include a control node 110 and an edge node 120 .
[0034] In some embodiments, the audio and video system may include an audio and video cloud network, which can be used to implement distributed deployment of edge computing infrastructure resources and to manage these resources in a unified manner. A deployment point with more resources and a concentrated location is called a central cloud, and a deployment point with fewer resources and a wide distribution is called an edge cloud (also called an edge cloud node). Since the edge cloud is more widely distributed, it is closer to the terminal device used by the user. That is, the edge cloud can be understood as a cloud computing platform close to the terminal device, and the central cloud can be understood as a cloud platform that manages multiple edge clouds in a unified manner.
[0035] The control node 110 is deployed in the aforementioned central cloud and is responsible for controlling and managing media nodes. It can receive and process node information and link quality information reported by media nodes. In some embodiments, the control node 110 may include functions responsible for controlling and scheduling edge nodes 120 in the audio and video system, as well as managing system data. In some embodiments, the control node 110 may include a network perception module, a simplification module, a quantization module, a calculation module, and a matching module.
[0036] Edge nodes 120 are deployed in the aforementioned edge cloud. Data transmission paths can consist of multiple edge nodes 120 and the links between them. Edge nodes 120 can be composed of multiple small nodes distributed over a wide area. Edge nodes 120 can be used to forward service data in the RTN network at high speed and quality.
[0037] In some embodiments, the audio and video system may further include a client 130 connected to the edge node 120. The client 130 may be any physical device or software application (e.g., a mobile application (Application, App), a software development kit (Software Development Kit, SDK)) that supports the generation, transmission, and display of audio and video data, or a terminal device (e.g., a mobile phone, tablet computer, desktop, laptop, handheld computer, notebook computer, ultra-mobile personal computer (UMPC), netbook, as well as cellular phone, personal digital assistant (PDA), augmented reality (AR) / virtual reality (VR) device, and other terminal devices)).
[0038] It is understandable that the system architecture shown in FIG1 does not constitute a limitation on the embodiments of the present disclosure. The system architecture shown in FIG1 may include more or fewer components than shown, or a combination of certain components, or a different arrangement of components.
[0039] The method provided by the present disclosure is described in detail below with reference to the accompanying drawings.
[0040] As shown in FIG2 , an embodiment of the present disclosure provides a path determination method, which includes the following steps.
[0041] S101: Obtain a first network topology of an audio and video system.
[0042] The attribute information of the link in the first network topology includes transmission parameters of the link, and the transmission parameters of the link include concave parameters, additive parameters, and multiplicative parameters.
[0043] In some embodiments, the concave parameter includes bandwidth, the additive parameter includes cost and / or delay, and the multiplicative parameter includes packet loss rate. In some embodiments, the additive parameter may also include parameters such as jitter and node hop count.
[0044] In some embodiments, for a path between any two nodes in the first network topology, the value of the concavity parameter of the path is equal to the minimum value of the concavity parameters of all links constituting the path.
[0045] For example, taking bandwidth as an example, define G = (V, E) to represent the first network topology, where V represents the set of nodes and E represents the set of links connecting the nodes. Define P (s, d) to be the set of transmission paths in the first network topology, where s ∈ V represents the source node and d ∈ V represents the destination node. The bandwidth of path p can be determined based on the following formula (1). width (p) = min {B (e)}, e ∈ p Formula (1)
[0046] In the above formula, width(p) is the bandwidth of the path p, B(e) is the bandwidth of the links constituting the path, e is a link in the first network topology, e∈E, p∈P.
[0047] In some embodiments, for a path between any two nodes in the first network topology, the value of the additive parameter of the path is obtained by adding the values of the additive parameters of all links constituting the path.
[0048] Exemplarily, the cost of path p may be determined based on the following formula (2).
[0049] In the above formula, cost(p) is the cost of the path p, C(e) is the cost of the links constituting the path, e is a link in the first network topology, e∈E, p∈P.
[0050] Exemplarily, the delay of path p can be determined based on the following formula (3).
[0051] In the above formula, delay(p) is the delay of the path p, D(e) is the delay of the links constituting the path, e is a link in the first network topology, e∈E, p∈P.
[0052] In some embodiments, for a path between any two nodes in the first network topology, the value of the multiplicative parameter of the path is obtained by multiplying the values of the multiplicative parameters of all links constituting the path.
[0053] Exemplarily, the packet loss rate of path p may be determined based on the following formula (4).
[0054] In the above formula, loss(p) is the packet loss rate of the path p, L(e) is the packet loss rate of the links constituting the path, e is a link in the first network topology, e∈E, p∈P.
[0055] In some embodiments, the control node of the audio and video system can perform data perception in real time at a preset frequency to obtain the real-time network topology of the audio and video system.
[0056] In some embodiments, the aforementioned network awareness can be implemented through scheduled tasks. The control node can analyze the relationships between edge nodes through a network awareness module, initiate network detection requests to each node in the edge cloud, and drive the edge nodes to perform network detection on connected nodes based on the preset frequency to obtain detection data such as packet loss rate, latency, jitter, and bandwidth usage of the links between the edge nodes.
[0057] In some embodiments, the control node may also obtain and record the inherent data of each node (eg, node IP address, node identification (ID entity document, ID), node hardware parameters (eg, CPU or memory, etc.), etc.).
[0058] In some embodiments, after the control node performs network perception to obtain data, it can perform exception processing on the received data, such as detecting whether the data is returned in a standard format, whether the data is out of bounds, etc. to determine whether the data is abnormal, and process the detected abnormal data.
[0059] In some embodiments, when the network topology of the audio and video system changes (e.g., nodes are added or deleted, connected edges are added or deleted, etc.), the control node can again perform network perception based on the real-time network topology. For example, the control node can initiate new network detection requests and data collection requests to each edge node to obtain new data, and update the first network topology based on the obtained new data.
[0060] S102: Determine links that satisfy concavity parameter constraints from the first network topology, and generate a second network topology based on the links that satisfy the concavity parameter constraints.
[0061] In some embodiments, when the concavity parameter includes bandwidth, the concavity parameter preset condition includes the bandwidth being less than a preset threshold. That is, based on the concavity parameter preset condition, the control node can delete links in the first network topology that do not meet the condition, thereby simplifying the network topology to obtain a second network topology. For example, using control node 110 in Figure 1 as an example, control node 110 can simplify the first network topology of the audio and video system using a simplification module to obtain a second network topology.
[0062] The preset threshold value can be a value in the form of a bandwidth value that is preset or determined in real time based on the actual network topology, or a ratio of the real-time bandwidth to the total available bandwidth of the link. If the bandwidth of a link is greater than or equal to the preset threshold value, it indicates that the link is about to be saturated and no more traffic can be allocated. Therefore, the control node can delete the link in the first network topology.
[0063] In some embodiments, the control node may generate a second network topology by performing a simplification operation on the first network topology based on the simplified model.
[0064] Exemplarily, the simplified model is preset with the concavity parameter constraint (e.g., bandwidth less than a preset threshold). The control node can input the bandwidth of the first network topology and the links between all nodes in the first network topology into the simplified model. The simplified model can dynamically delete the links with the concavity parameter constraint in the first network topology, thereby obtaining the second network topology.
[0065] For example, as shown in Figure 3, the nodes in the first network topology obtained through network perception by the control node include Node A, Node B, Node C, Node D, Node E, and Node F. The concavity parameter preset condition includes the bandwidth being less than 90% of the total available bandwidth of the link. If the real-time bandwidth of the link from Node B to Node E is 2.7 Gbps and the total available bandwidth of the link is 3 Gbps, reaching 90% of the total available bandwidth of the link, then, as shown in Figure 3, the control node can temporarily delete the link from the network topology diagram to obtain a second network topology.
[0066] In some embodiments, the control node may update the second network topology in real time based on network-aware data. If subsequent network-aware data indicates that the bandwidth of the deleted link satisfies the concavity parameter constraint, the control node may update the second network topology based on new network-aware data to dynamically restore the link in the updated second network topology.
[0067] S103: Generate a third network topology based on key parameters of links in the second network topology.
[0068] The key parameter is the parameter that has the greatest impact on the target service type among the additive parameter and the multiplicative parameter. The attribute information of the link in the third network topology includes a quantized score determined by the key parameter.
[0069] In some embodiments, the control node may determine key parameters of the target service type based on service requirements corresponding to the target service type to which the target service belongs.
[0070] Exemplarily, target services may include cloud computers, interactive whiteboards, video conferencing, video IoT, interactive live broadcasting, extended reality (XR), and other possible services.
[0071] In one example, if the target service is a cloud computer, interactive whiteboard or other service, which has a very low tolerance for delay and can tolerate a small amount of packet loss, the control node can determine that the target service type is a delay-priority demand service (that is, the key parameter of the target service type is delay). In another example, if the target service is compressed data file transmission or other services that prioritize packet loss rate over delay or other requirements. The control node can determine that the target service type is a packet loss rate-priority demand service, that is, the key parameter of the target service type is packet loss rate. In addition, the target service type in the embodiment of the present disclosure may also include other possible service types, which are not listed here one by one.
[0072] In some embodiments, the control node can obtain a quantitative score of the link based on the key parameters of the link, and use the structure of the second network topology as the structure of the third network topology, and use the quantitative score of the link as the attribute information of the link in the third network topology to generate a third network topology.
[0073] The quantitative score of a link is used to represent the reliability of the link in transmitting service data of the service type.
[0074] As an example, the quantization score can be negatively correlated with reliability. That is, the smaller the quantization score of a link, the higher the reliability of the link for transmitting service data of the service type. Conversely, the larger the quantization score of a link, the lower the reliability of the link for transmitting service data of the service type.
[0075] As another example, the quantization score can be positively correlated with the reliability. It should be understood that the relationship between the quantization score and the reliability depends mainly on the algorithm used to determine the quantization score. The following mainly describes in detail the negative correlation between the quantization score and the reliability.
[0076] In some embodiments, the control node can obtain a third network topology based on key parameters of the target service type and a quantization model. The quantization model can map the key parameters of the link into a numerical value based on a preset mathematical conversion relationship, and the numerical value represents the quantization score of the link. Taking the control node 110 in Figure 1 as an example, the quantization model of the control node 110 can be preset in the quantization model, and the control node 110 can determine the third network topology through the quantization module.
[0077] Exemplarily, the control node may input the second network topology and key parameters of links between all nodes of the second network topology into the quantitative model, thereby obtaining the third network topology.
[0078] Figure 4 shows a third network topology with latency, packet loss rate, and cost as key parameters. As shown in Figure 4, the third network topology includes nodes A, B, C, ..., and F. Taking the third network topology with latency as the key parameter as an example, the quantized score of link AB between nodes A and B is 6, the quantized score of link AC is 3, the quantized score of link BD is 5, the quantized score of link BC is 2, the quantized score of link CE is 4, the quantized score of link CD is 3, the quantized score of link DE is 2, the quantized score of link DF is 3, and the quantized score of link EF is 6.
[0079] In one implementation, the control node can preset and determine the quantized network topologies corresponding to multiple possible key parameters, and then select the quantized network topology corresponding to the target business type (i.e., the third network topology mentioned above) based on the business type to which the target business belongs.
[0080] In another implementation, the control node may first determine the target service type, and then determine the third network topology based on the service requirements corresponding to the target service type and the second network topology of the audio and video system.
[0081] It should be noted that the above technical solution can classify the parameters in the audio and video system through a path planning method based on key parameters, first simplifying the first network topology using concave parameters to obtain the second network topology. Then, based on the differences between different services and the key parameters that most affect the target service, a third network topology is determined, thereby determining the candidate path in the third network topology. In this way, the third network topology corresponding to different service types can be calculated based on different key parameters, without the need for parameter synthesis, that is, without the need to determine the function mapping model of the synthesis parameters, which can reduce the complexity of the calculation and improve the feasibility of path planning.
[0082] S104: Determine multiple candidate paths based on the third network topology.
[0083] In some embodiments, the control node may determine, based on a third network topology, multiple paths between a first node and a second node, and determine a path score for each of the multiple paths. The path score of each path is obtained based on a quantized score of all links comprising the path. The first node and the second node are any two nodes in the third network topology.
[0084] Similar to the quantitative link score, the path score of a path represents the reliability of that path for transmitting service data of that service type. Furthermore, the path score can be negatively correlated with reliability. Alternatively, the path score can be positively correlated with reliability. It should be understood that the relationship between the path score and reliability depends primarily on the algorithm used to determine the path score. The following detailed explanation focuses on the negative correlation between the path score and reliability.
[0085] Furthermore, the control node may determine the top N paths with the lowest path scores from the multiple paths as multiple candidate paths between the second node and the first node, where N is a positive integer greater than 1. For example, taking the control node 110 in FIG1 as an example, it may determine the multiple candidate paths through a calculation module.
[0086] In some embodiments, the multiple paths between the first node and the second node include a first path and a second path, where the first path is the shortest path from the first node to the second node. The second path is composed of the shortest path from the first node to a third node and the next shortest path from the third node to the second node, where the third node is any node in the first path other than the first node and the second node.
[0087] In the third network topology, the shortest path from the first node to the second node may be understood as a path with the smallest path score from the first node to the second node in the third network topology.
[0088] Exemplarily, the process of the control node determining multiple candidate paths may be implemented as the following steps.
[0089] S1. The control node determines a first node (source node) and a second node (destination node) in a third network topology.
[0090] For example, the control node can define G = (V, E) to represent the first network topology, where V represents the set of nodes. E represents the set of links connecting the nodes. The control node denotes the first node as s, s∈V, and the second node as d, d∈V. The i-th candidate path from node s to node d can be denote as p i (s,d), then the multipath set can be recorded as P n (s,d)={p1(s,d),p2(s,d),…,p n (s,d)}.
[0091] S2. The control node calculates the shortest path from the first node s to the second node d, that is, the path with the smallest path score in the third network topology. In addition, the control node may record the shortest path as p1(s, d).
[0092] S3. The control node determines all nodes except the second node on p1(s,d) as deviation nodes, and records them in the deviation node set as D={d1,d 2, …,d x}. There are x deviation nodes in the deviation node set.
[0093] S4, control node according to the deviation node d i (i=1,2,…,x), determine the deviation from node d i The shortest path to the second node d, that is, the path with the smallest quantization score, can be used as a candidate path.
[0094] S5, the control node is based on the first node in p1(s,d) to the deviation node d i The path, and the deviation node d determined in S4 i The shortest path to the second node is determined by the path between the first node and the second node, and is recorded in the second path set C(s,d).
[0095] S6, traverse D={d1,d2,…,d x After finding all the deviation nodes in}, the control node can determine the path with the smallest path score in C(s,d) and record this path as p2(s,d). Then, the control node can move from set C(s,d) to set P n (s, d). p2(s, d) is the second shortest path between the first node and the second node and can be used as a candidate path.
[0096] S7: The control node can update the deviation node set based on the determination method shown in S3 to S6, and determine a new candidate path until the deviation set P is n The number of paths in (s,d) reaches N.
[0097] For example, as shown in FIG5 , candidate paths from source node A to destination node F are determined in a third network topology with latency as a key parameter, if N is 4. Furthermore, based on the third network topology, the control node may determine a candidate path A→C→D→F with a path score of 9, a candidate path A→C→E→D→F with a path score of 12, a candidate path A→C→E→F with a path score of 13, and a candidate path A→C→B→D→F with a path score of 13.
[0098] In some embodiments, the control node may calculate candidate paths between any two nodes in the third network topology, and then determine multiple candidate paths between the source node and the destination node from among all candidate paths in the third network topology based on the source node and the destination node of the target service.
[0099] S105: Determine a target path that meets the path selection constraint conditions from multiple candidate paths.
[0100] In some embodiments, the control node may obtain transmission parameters of all links constituting the candidate path, and determine the transmission parameters of the candidate path based on the transmission parameters of all links constituting the candidate path.
[0101] In one example, for the concavity parameter, the value of the concavity parameter of the candidate path is equal to the minimum value of the concavity parameters of all links constituting the candidate path. For example, the bandwidth value of the candidate path can be determined based on the above formula (1).
[0102] In another example, for additive parameters, the value of the additive parameter of the candidate path is obtained by adding the values of the additive parameters of all links constituting the candidate path. For example, the cost of the candidate path can be determined based on the above formula (2), and the delay of the candidate path can be determined based on the above formula (3).
[0103] In another example, for the multiplicative parameter, the value of the multiplicative parameter of the candidate path is obtained by multiplying the values of the multiplicative parameters of all links constituting the path. For example, the packet loss rate of the candidate path can be determined based on the above formula (4).
[0104] In some embodiments, the control node may further express the transmission parameters of the candidate paths using parameter expressions.
[0105] For example, taking the third network topology with latency as the key parameter, the path information is "A→C→D→F". The latency of link A→C is 30ms, the packet loss rate is 1%, the jitter is 10ms, and the cost is 1. The latency of link C→D is 40ms, the packet loss rate is 1%, the jitter is 10ms, and the cost is 2. The latency of link D→F is 30ms, the packet loss rate is 1%, the jitter is 10ms, and the cost is 3. Then the latency of the path A→C→D→F is 100ms, the packet loss rate is 3%, the jitter is 4ms, and the cost is 6. Therefore, the parameter expression of the candidate path can be expressed as: "type=1,path='ACD-F',score=9,delay=100,jitter=30,lost=3,hop=4,cost=6". Type=1 indicates the service type, that is, the service type that prioritizes latency.
[0106] Therefore, the control node can determine a path that meets the path selection constraint condition from the multiple candidate paths based on the transmission parameters of the multiple candidate paths and determine it as the target path.
[0107] Path selection constraints are used to constrain the transmission parameters of the target path. It should be noted that path selection constraints are determined based on the parameter requirements of the target service. If the target service has constraints on multiple transmission parameters, path selection constraints are used to constrain multiple transmission parameters of the target path. Alternatively, if the target service has constraints on only one transmission parameter, path selection constraints are used to constrain the single transmission parameter of the target path.
[0108] In some embodiments, path selection constraints may include multiplicative and / or additive parameters in the path's transmission parameters. For example, latency, packet loss rate, jitter, node hop count, etc. Furthermore, path selection constraints may include concavity parameters in the path's transmission parameters. In some embodiments, path selection constraints may also include service information of the target service (e.g., service type, source node, and destination node information of the target service).
[0109] In some embodiments, the control node may also express the target service's path selection constraints using a multi-constraint logic expression. The transmission parameters in the path selection constraints indicated in the multi-constraint logic expression should be expressed in a manner consistent with the aforementioned parameter expressions (e.g., including source node (src), destination node (dest), delay (delay), packet loss rate (lost), jitter (jitter), node hop count (hop), etc.). Furthermore, the control node may combine the detailed constraints for each parameter in the path selection constraint with operators to form a multi-constraint logic expression.
[0110] If the path selection constraints include: source node A, destination node F, and service type cloud computing, and the transmission delay of the entire link is less than 350ms or jitter is less than 50ms, the packet loss rate is less than 5%, and the number of node hops is less than 5, the control node can determine the multi-constraint logic expression as: "src = 'A' and dest = 'F' and type = '1' and delay < 350 or jitter < 50 and lost < 5 and hop < 5".
[0111] Furthermore, the control node can match the multi-constraint logic expression representing the path selection constraints with the parameter expressions of each candidate path to determine the target path. Taking control node 110 in Figure 1 as an example, control node 110 can use a matching module to match the path selection constraints of the service with the transmission parameters of the candidate paths.
[0112] For example, if the parameter expressions of multiple candidate paths include: "type=1, path='ACD-F', delay=100, jitter=30, lost=3, hop=4, cost=6", "type=1, path='ACED-F', delay=200, jitter=30, lost=6, hop=5, cost=10", "type=1, path='ACE-F', delay=300, jitter=40, lost=4, hop=4, cost=15" and "type=1, path='ACBD-F', delay=400, jitter=40, lost=4, hop=5, cost=13". Based on the above multi-constraint logical expression, it can be determined that the parameter expressions that match the multi-constraint logical expression include "type=1,path='ACD-F',delay=100,jitter=30,lost=3,hop=4,cost=6" and "type=1,path='ACE-F',delay=300,jitter=40,lost=4,hop=4,cost=15", so that the path corresponding to the matching parameter expression can be determined as the target path.
[0113] Based on the above embodiment, this method can first simplify the network topology based on concavity parameters, and then determine a third network topology based on key parameters of different services to facilitate the determination of candidate paths. Furthermore, it can more accurately reflect the various parameters of each candidate path and, based on the parameters of the candidate paths, determine the path among the candidate paths that meets the various parameter requirements of the service. This allows for more accurate path planning. Furthermore, it can also make path planning applicable to a variety of service scenarios, improving the practicality of path planning.
[0114] The above mainly introduces the solution provided by the present disclosure from the perspective of the interaction between each node. It is understandable that each node, such as a device or equipment, includes a hardware structure and / or software module corresponding to the execution of each function in order to realize the above functions. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in a hardware or computer software driven hardware manner depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.
[0115] FIG6 is a schematic diagram of the composition of a path determination device according to some embodiments, which is applied to a first node. As shown in FIG6 , the path determination device 60 includes an acquisition module 601 and a processing module 602 .
[0116] In some embodiments, an acquisition module 601 is used to acquire a first network topology of an audio and video system, wherein the attribute information of a link in the first network topology includes the transmission parameters of the link, and the transmission parameters of the link include a concave parameter, an additive parameter, and a multiplicative parameter. A processing module 602 is used to determine a link that satisfies a concave parameter constraint from the first network topology, and to generate a second network topology based on the link that satisfies the concave parameter constraint. The processing module 602 is also used to generate a third network topology based on key parameters of the link in the second network topology; the key parameter is the parameter with the highest degree of influence on the target service type among the additive parameter and the multiplicative parameter; the attribute information of the link in the third network topology includes a quantized score determined by the key parameter. The processing module 602 is also used to determine multiple candidate paths based on the third network topology, and to determine a target path that satisfies the path selection constraint from the multiple candidate paths.
[0117] In some embodiments, the concave parameter includes bandwidth; the additive parameter includes cost and / or delay; and the multiplicative parameter includes packet loss rate.
[0118] In some embodiments, when the concavity parameter includes bandwidth, the concavity parameter preset condition includes that the bandwidth is less than a preset threshold.
[0119] In some embodiments, the processing module 602 is used to: obtain a quantitative score of the link based on the key parameters of the link, use the structure of the second network topology as the structure of the third network topology, and use the quantitative score of the link as the attribute information of the link in the third network topology to generate a third network topology.
[0120] In some embodiments, processing module 602 is configured to: determine, based on a third network topology, multiple paths between a first node and a second node, and determine a path score for each of the multiple paths; the path score of each path is obtained based on the quantized scores of all links constituting the path; the first node and the second node are any two nodes in the third network topology; and determine, from the multiple paths, top N paths with the lowest path scores as multiple candidate paths between the second node and the first node, where N is a positive integer greater than 1.
[0121] In some embodiments, the multiple paths between the first node and the second node include a first path and a second path, the first path is the shortest path from the first node to the second node; the second path is composed of the shortest path from the first node to the third node and the second shortest path from the third node to the second node, and the third node is any node in the first path except the first node and the second node.
[0122] In some embodiments, the acquisition module 601 is configured to acquire the transmission parameters of all links constituting a candidate path and determine the transmission parameters of the candidate path based on the transmission parameters of all links constituting the candidate path. The processing module 602 is configured to determine a target path that satisfies the path selection constraints from the plurality of candidate paths based on the transmission parameters of the plurality of candidate paths.
[0123] In some embodiments, for the concavity parameter, the value of the concavity parameter of the candidate path is equal to the minimum value of the concavity parameters of all links constituting the candidate path; for the additive parameter, the value of the additive parameter of the candidate path is obtained by adding the values of the additive parameters of all links constituting the candidate path; for the multiplicative parameter, the value of the multiplicative parameter of the candidate path is obtained by multiplying the values of the multiplicative parameters of all links constituting the candidate path.
[0124] It should be noted that the modules in Figure 6 may also be referred to as units, for example, the acquisition module may be referred to as an acquisition unit. In addition, in the embodiment shown in Figure 6, the names of the modules may not be those shown in the figure, for example, the acquisition module may also be referred to as a communication module.
[0125] If the various units in Figure 6 are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present disclosure is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute all or part of the steps of the various embodiments of the present disclosure. The storage medium for storing computer software products includes: various media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.
[0126] In the case of implementing the functions of the above-mentioned integrated modules in hardware, the present disclosure also provides a schematic diagram of the structure of a path determination device. As shown in Figure 7, the path determination device 70 includes: a processor 702, a communication interface 703, and a bus 704. In some embodiments, the data transmission device 70 may also include a memory 701.
[0127] Processor 702 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the present disclosure. Processor 702 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Processor 702 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the present disclosure. Processor 702 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.
[0128] The communication interface 703 is used to connect to other devices via a communication network, such as Ethernet, wireless access network, wireless local area network (WLAN), etc.
[0129] The memory 701 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.
[0130] As an implementation, the memory 701 may exist independently of the processor 702. The memory 701 may be connected to the processor 702 via a bus 704 and used to store instructions or program codes. When the processor 702 calls and executes the instructions or program codes stored in the memory 701, the information processing method determination method provided in the embodiments of the present disclosure can be implemented.
[0131] In another implementation, the memory 701 may also be integrated with the processor 702 .
[0132] Bus 704 can be an Extended Industry Standard Architecture (EISA) bus, etc. Bus 704 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, FIG7 shows only one thick line, but this does not mean that there is only one bus or only one type of bus.
[0133] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be distributed and completed by different functional modules as needed, that is, the internal structure of the equipment or device is divided into different functional modules to complete all or part of the functions described above.
[0134] The present disclosure also provides a computer-readable storage medium. All or part of the processes in the above-mentioned method embodiments can be completed by computer instructions to instruct the relevant hardware, and the program can be stored in the above-mentioned computer-readable storage medium. When the program is executed, it may include the processes of the above-mentioned method embodiments. The computer-readable storage medium can be the memory of any of the above-mentioned embodiments. The above-mentioned computer-readable storage medium can also be an external storage device of the above-mentioned device or apparatus, such as a plug-in hard disk, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, a flash card (flash card), etc. equipped on the above-mentioned device or apparatus. Further, the above-mentioned computer-readable storage medium can also include both the internal storage unit of the above-mentioned device or apparatus and an external storage device. The above-mentioned computer-readable storage medium is used to store the above-mentioned computer program and other programs and data required by the above-mentioned device or apparatus. The above-mentioned computer-readable storage medium can also be used to temporarily store data that has been output or is to be output. The readable storage medium includes a non-transitory computer-readable storage medium.
[0135] The embodiments of the present disclosure further provide a computer program product, which includes a computer program. When the computer program product is run on a computer, the computer is enabled to execute any one of the information processing mode determination methods provided in the above embodiments.
[0136] Although the present disclosure is described herein in conjunction with various embodiments, in the process of implementing the disclosure for which protection is sought, those skilled in the art may understand and implement other variations of the disclosed embodiments by reviewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "one" or "an" does not exclude multiple components. A single processor or other unit may implement several functions listed in the claims. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.
[0137] Although the present disclosure has been described with reference to detailed features and embodiments thereof, it will be apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present disclosure. Accordingly, this specification and the drawings are merely illustrative of the present disclosure as defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of the present disclosure. Obviously, those skilled in the art may make various modifications and variations to the present disclosure without departing from the spirit and scope of the present disclosure. Thus, the present disclosure is intended to encompass such modifications and variations as would fall within the scope of the claims of the present disclosure and their equivalents.
[0138] The above is only a specific embodiment of the present disclosure, but the scope of protection of the present disclosure is not limited thereto. Any changes or replacements within the technical scope disclosed in the present disclosure should be included in the scope of protection of the present disclosure. Therefore, the scope of protection of the present disclosure should be based on the scope of protection of the claims.
Claims
1. A path determination method, comprising: Acquire a first network topology of the audio and video system, wherein the attribute information of a link in the first network topology includes a transmission parameter of the link, and the transmission parameter of the link includes a concave parameter, an additive parameter, and a multiplicative parameter; Determine a link satisfying a concave parameter constraint condition from the first network topology, and generate a second network topology using the link satisfying the concave parameter constraint condition; generating a third network topology based on key parameters of the links in the second network topology; the key parameters being the parameters that have the highest degree of influence on the target service type among the additive parameters and the multiplicative parameters; and the attribute information of the links in the third network topology including a quantized score determined by the key parameters; Based on the third network topology, determining a plurality of candidate paths; A target path that satisfies the path selection constraint condition is determined from the multiple candidate paths.
2. The method according to claim 1, wherein: The concave parameter includes bandwidth; the additive parameter includes cost and / or delay; and the multiplicative parameter includes packet loss rate.
3. The method according to claim 1, wherein: In the case that the concavity parameter includes a bandwidth, the concavity parameter preset condition includes that the bandwidth is less than a preset threshold.
4. The method according to claim 1, wherein: The generating a third network topology based on the key parameters of the links in the second network topology includes: Based on the key parameters of the link, a quantitative score of the link is obtained; The third network topology is generated by using the structure of the second network topology as the structure of the third network topology and using the quantized scores of the links as the attribute information of the links in the third network topology.
5. The method according to claim 1, wherein: The determining of a plurality of candidate paths based on the third network topology includes: Based on the third network topology, multiple paths between a first node and a second node are determined, and path scores of each of the multiple paths are determined; the path scores of the multiple paths are obtained based on quantized scores of all links constituting the multiple paths; the first node and the second node are any two nodes in the third network topology; Determine top N paths with the smallest scores from the multiple paths as multiple candidate paths between the second node and the first node, where N is a positive integer greater than 1.
6. The method according to claim 5, wherein: The multiple paths between the first node and the second node include a first path and a second path, the first path is the shortest path from the first node to the second node; the second path is composed of the shortest path from the first node to a third node and the second shortest path from the third node to the second node, and the third node is any node in the first path except the first node and the second node.
7. The method according to claim 1, wherein: The step of determining a target path satisfying the path selection constraint condition from the multiple candidate paths includes: Acquire transmission parameters of all links constituting the candidate path, and determine the transmission parameters of the candidate path based on the transmission parameters of all links constituting the candidate path; Based on the transmission parameters of each of the multiple candidate paths, a target path that satisfies the path selection constraint condition is determined from the multiple candidate paths.
8. The method according to claim 7, wherein: For the concavity parameter, the value of the concavity parameter of the candidate path is equal to the minimum value of the concavity parameters of all links constituting the candidate path; For additive parameters, the value of the additive parameter of the candidate path is determined according to the values of the additive parameters of all links constituting the candidate path. Perform addition to obtain; For the multiplicative parameter, the value of the multiplicative parameter of the candidate path is obtained by multiplying the values of the multiplicative parameters of all links constituting the candidate path.
9. A communication device, comprising: Memory and processor; Memory and processor coupling; The memory is used to store instructions executable by the processor; When the processor executes the instructions, the method according to any one of claims 1 to 8 is performed.
10. A computer-readable storage medium, wherein: The computer-readable storage medium stores computer instructions, and when the computer instructions are executed on a communication device, the communication device is caused to execute the method according to any one of claims 1 to 8.
Citation Information
Patent Citations
Path determination method, communication device and storage medium
CN119052884A
Data stream transmission method and device based on software defined network
CN111083050A
Satellite network constraint multipath routing setting method, electronic equipment and storage medium
CN112261690A
Network topology optimization
US20170346691A1
Path calculation method, route calculation device, electronic device, and computer storage medium
WO2023078150A1
Cited By
Communication enhancement method and device based on 5G RedCap, equipment and storage medium
CN119450642A
Communication enhancement method, device, equipment and storage medium based on 5G RedCap
CN119450642B
Energy efficiency optimization system, method, equipment and medium for industrial high-energy-consumption system
CN122632794A
