Routing method, system and apparatus in a converged network based on virtual routing plane

Abstract

The application discloses a routing method, system and device based on a virtual routing plane in a fusion network, the method comprising: for a data flow to be routed, determining a virtual routing plane corresponding to a priority of a service type of the data flow as a virtual routing plane N a bearing the data flow according to the service type of the data flow, when a bandwidth resource required by the data flow is greater than a residual bandwidth resource of N a , adjusting a virtual routing node in a virtual routing plane with a lower priority to N a to meet the bandwidth resource required by the data flow, performing routing calculation for the data flow in N a , and allocating a virtual routing node obtained by calculation to the data flow; and routing the data flow based on underlying physical nodes corresponding to the allocated virtual routing node. The application can support efficient transmission of multiple services and improve network resource utilization.

Description

Technical Field

[0001] This invention relates to the field of network technology, and in particular to a routing method, system, and apparatus based on a virtual routing plane in a converged network. Background Technology

[0002] With the vigorous development of power grid services, the types of power services are now diverse, and communication needs vary. A single network cannot meet the industrialized service quality requirements of different services. There is an urgent need to provide secure, reliable, and real-time communication services for the power grid by integrating various heterogeneous network resources. A power grid wide-coverage multi-wireless communication system convergence network based on 5G technology and integrating multiple wireless communication systems has been widely studied. The power 5G convergence network has become an important development direction by introducing multi-link converged communication terminals to achieve flexible extension and wide coverage of terminal service providers. The multi-link converged terminals connect to the core network via 5G base stations or wired connections, and then to the service system. Downstream, they utilize the existing communication methods of the service terminals to communicate with the service providers, improving the coverage of power services and comprehensively enhancing the reliability of power service communication.

[0003] Power grid wide-coverage networking based on 5G technology and integrating multiple wireless communication systems is a promising approach to achieving comprehensive coverage of communication networks in new power systems. This networking scheme adopts a two-layer architecture. The upper layer consists of a transmission network composed of 5G-MEC nodes, pushing network-end functions and application deployments down to the edge of the wireless access network for end-user devices. This makes application deployment more flexible, network capabilities stronger, and service processing closer to the terminal, thus better meeting the high-bandwidth, low-latency application requirements of the power system. The lower layer adopts an edge-converged access terminal mesh self-organizing network, receiving signals from various power wireless communication terminals such as 5G, WiFi, LoRa, and ZigBee, achieving wide coverage, integration of multiple wireless communication systems, and flexible service deployment. However, in terms of service access, power services are diverse, with varying communication requirements. When power service convergence terminals are scheduled across domains and layers, services that rely on 5G technology to provide high-bandwidth, low-latency, and highly reliable communication may be affected by changes in the accessed wireless communication systems. Therefore, it is necessary to provide a routing scheme in the converged network that can support efficient transmission of multiple services and improve network resource utilization. Summary of the Invention

[0004] In view of this, the purpose of this invention is to propose a routing method, system and apparatus based on a virtual routing plane in a converged network, which can support efficient transmission of multiple services and improve network resource utilization.

[0005] To achieve the above objectives, the present invention provides a routing method based on a virtual routing plane in a converged network, comprising:

[0006] For a data flow to be routed, a virtual routing plane with a priority corresponding to the service type of the data flow is determined based on the service type of the data flow, and this virtual routing plane N is used to carry the data flow. a ;

[0007] The bandwidth resources required for this data stream are greater than N. a When the remaining bandwidth resources are exhausted, virtual routing nodes in the virtual routing plane with lower priority will be adjusted to N. a In order to meet the bandwidth resources required for this data stream;

[0008] In N a The process involves performing route calculations for the data stream and assigning the calculated virtual route nodes to the data stream.

[0009] The data stream is routed based on the underlying physical node corresponding to the assigned virtual routing node.

[0010] Furthermore, the method also includes:

[0011] If the bandwidth resources required by this data stream are less than or equal to N a Given the remaining bandwidth resources, then:

[0012] Directly in N a The system performs routing calculations for the data stream and assigns the calculated virtual routing nodes to the data stream.

[0013] Preferably, the step of adjusting the virtual routing nodes in the virtual routing plane with lower priority to N is... a Specifically, it includes:

[0014] If the priority is lower than P a The total remaining bandwidth resources of the virtual routing plane can satisfy N a The bandwidth resources required to carry the data stream, and there are multiple ways to adjust virtual routing nodes in the virtual routing plane with lower priority to N. a Can satisfy N a The node adjustment scheme for the bandwidth resources required to carry the data stream is as follows:

[0015] For each node adjustment scheme, calculate the corresponding F value according to Equation 1;

[0016] Determine the maximum F value as the optimal objective value F. max This ensures optimal global bandwidth allocation.

[0017] According to F max The corresponding node adjustment scheme adjusts the virtual routing nodes in the virtual routing plane with lower priority to N. a ;

[0018] Among them, Pa For N a Priority.

[0019] Furthermore, the method also includes:

[0020] If the priority is lower than P a The total remaining bandwidth resources of the virtual routing plane cannot satisfy N a Given the bandwidth resources required to carry the data stream, then:

[0021] Reclaim all remaining bandwidth resources in the virtual routing plane;

[0022] If the recovered bandwidth resources can meet N a The bandwidth resources required to carry the data stream, and there are multiple ways to adjust virtual routing nodes in other virtual routing planes to N. a Can satisfy N a The node adjustment scheme for the bandwidth resources required to carry the data stream is as follows:

[0023] For each node adjustment scheme, calculate the corresponding F value according to Equation 1;

[0024] Determine the maximum F value as the optimal objective value F. max This ensures optimal global bandwidth allocation.

[0025] According to F max The corresponding node adjustment scheme adjusts the virtual routing nodes in the corresponding virtual routing plane to N. a .

[0026] Preferably, the above is in N a The middle part performs routing calculations for this data stream, specifically including:

[0027] Using Dijkstra's algorithm in N a The middle part performs routing calculations for this data stream.

[0028] Ideally, with V W The Dijkstra algorithm is used to calculate the route using the weights, where V W This is the sum of the transmission delays of data streams across all virtual routing planes.

[0029] The present invention also provides a routing device based on a virtual routing plane in a converged network, which is disposed in the network central controller and includes:

[0030] The routing plane determination module is used to determine, for a data flow to be routed, a virtual routing plane with a priority corresponding to the priority of that service type, as the virtual routing plane N carrying the data flow. a ;

[0031] The bandwidth resource adjustment module is used when the bandwidth resource required for this data stream is greater than N. a When the remaining bandwidth resources are exhausted, virtual routing nodes in the virtual routing plane with lower priority will be adjusted to N. a In order to meet the bandwidth resources required for this data stream;

[0032] The virtual routing node calculation module is used to calculate N a The process involves performing route calculations for the data stream and assigning the calculated virtual route nodes to the data stream.

[0033] The routing control module is used to route the data stream based on the underlying physical node corresponding to the assigned virtual routing node.

[0034] This invention also provides a routing system based on a virtual routing plane in a converged network, comprising: a converged terminal, a 5G slice controller, a 5G core network, and further comprising: a network central controller as described above; wherein,

[0035] The converged terminal is used to send data streams of different service types to the 5G core network through the 5G base station.

[0036] The network central controller is used to perform routing calculations for data flows of different service types based on the virtual routing plane; allocate the calculated virtual routing nodes to the data flows; and map the data flows of the services of the virtual routing nodes to the corresponding underlying physical nodes through the 5G slice controller to route the data flows, thereby completing the transmission of the data flows in the 5G core network.

[0037] The present invention also provides a computer device, the computer device including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the above-described routing method based on a virtual routing plane in a converged network.

[0038] The present invention also provides a computer-readable storage medium storing a computer program that can be executed by at least one processor to cause the at least one processor to perform the steps of the above-described routing method based on a virtual routing plane in a converged network.

[0039] In the technical solution of this invention, for a data flow to be routed, a virtual routing plane with a priority corresponding to the priority of the service type is determined according to the service type of the data flow, and this virtual routing plane N is used to carry the data flow. a The bandwidth resources required for this data stream are greater than N. a When the remaining bandwidth resources are exhausted, virtual routing nodes in the virtual routing plane with lower priority will be adjusted to N. aIn N, to meet the bandwidth resources required for this data stream; a The system performs routing calculations for the data stream and allocates the calculated virtual routing nodes to it. The underlying physical nodes corresponding to the allocated virtual routing nodes then route the data stream. Addressing the multi-service characteristics of converged network scenarios, this invention constructs an architecture with multiple virtual routing planes, enabling differentiated responses to different service requests. Furthermore, by dynamically adjusting the bandwidth resources of the virtual routing planes, it comprehensively considers the impact of node resource utilization, throughput, server deployment costs, latency, and other factors to achieve optimal adjustment of multi-service routing selection. This supports efficient multi-service transmission in converged networks and improves network resource utilization. Attached Figure Description

[0040] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0041] Figure 1 This invention provides an architectural diagram of a routing system based on a virtual routing plane in a converged network, as illustrated in an embodiment of the present invention.

[0042] Figure 2 This is a schematic diagram of the virtual routing plane mapping relationship provided in an embodiment of the present invention;

[0043] Figure 3 A flowchart of a routing method based on a virtual routing plane in a converged network provided by an embodiment of the present invention;

[0044] Figure 4 A flowchart illustrating a method for adjusting bandwidth resources in a virtual routing plane, as provided in an embodiment of the present invention;

[0045] Figure 5 An internal block diagram of a routing device based on a virtual routing plane in a converged network, provided in an embodiment of the present invention;

[0046] Figure 6 , 7 A schematic diagram of simulation results comparing the routing method provided in this embodiment of the invention with existing routing methods;

[0047] Figure 8 This is a schematic diagram of a computer device hardware structure provided in an embodiment of the present invention. Detailed Implementation

[0048] To make the objectives, technical solutions, and advantages of the present invention clearer, the present invention will be further described in detail below with reference to specific embodiments and accompanying drawings.

[0049] It should be noted that, unless otherwise defined, the technical or scientific terms used in the embodiments of this invention should have the ordinary meaning understood by one of ordinary skill in the art to which this disclosure pertains. The terms "first," "second," and similar terms used in this disclosure do not indicate any order, quantity, or importance, but are merely used to distinguish different components. Terms such as "comprising" or "including" mean that the element or object preceding the word encompasses the elements or objects listed following the word and their equivalents, without excluding other elements or objects. Terms such as "connected" or "linked" are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. Terms such as "upper," "lower," "left," and "right" are used only to indicate relative positional relationships; when the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0050] The inventors of this invention considered that SDN, a software-defined network, can completely separate network elements, the forwarding plane, and the control plane, enabling centralized network management, enhancing network flexibility, and thus better meeting users' customized needs. Therefore, the virtual routing plane technology of this invention applies SDN to converged terminal bearer networks and core networks, thereby enabling the customization of virtual routing planes for different services as needed.

[0051] Specifically, this invention proposes a virtual routing plane technology, which divides the underlying physical network into a series of independent logical networks, each forming a virtual routing plane. Each logical network serves a specific type of service scenario, meeting the service carrying requirements of that scenario. Based on this, this invention proposes a routing scheme based on the virtual routing plane in a converged network. Different subnets carry different types of services. The SDN controller allocates underlying bandwidth resources on demand and selects the optimal routing path for the transmission of multiple services of the same type, using the transmission latency between routing nodes as the weight. This reduces the end-to-end transmission latency between the sender and receiver, thereby supporting efficient transmission of multiple services, improving network resource utilization, and enhancing network transmission efficiency.

[0052] The technical solutions of the embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

[0053] like Figure 1 As shown, this invention proposes an architecture for a routing system based on a virtual routing plane in a converged network, which mainly includes: a network central controller, a converged terminal, a 5G slice controller, and a 5G core network.

[0054] In the converged network of the power scenario, there are usually multiple types of power services. Each type of service is supported by a corresponding service terminal or system. After the service terminal generates data streams of different service types, they are transmitted to the converged terminal through multiple wireless access methods.

[0055] The converged terminal transmits data streams of different service types to the 5G core network via the 5G base station: the converged terminal communicates with the 5G base station through the 5G air interface or directly accesses the gateway through the MEC device. After receiving various types of data streams transmitted by the converged terminal, the 5G base station performs TSN (Time-Sensitive Networking) data stream format conversion on the received data streams through the MEC device to generate TSN data streams; then, the generated TSN data streams are transmitted to the 5G core network through the gateway.

[0056] The network central controller is responsible for maintaining the topology of the entire network, mapping the underlying physical network to the virtual routing plane, and performing basic route calculations. In other words, the network central controller performs route calculations for data flows of different service types based on the virtual routing plane and assigns the calculated virtual routing nodes to the data flows.

[0057] The 5G slicing controller bridges service inputs from the virtual routing plane to the 5G network slice, ensuring that multiple virtual routing planes can establish a complete mapping relationship with the underlying physical resources, guaranteeing the successful access of various communication technologies in the converged terminal, and completing the differentiated bearing of services.

[0058] In other words, the network central controller bridges the data flow of the virtual routing node's service into the 5G network slice through the 5G slice controller, maps it to the corresponding underlying physical node to route the data flow, and completes the transmission of the data flow in the 5G core network.

[0059] The 5G core network infrastructure layer defines the infrastructure controller, which is responsible for configuring and managing virtual network resources.

[0060] Figure 1 The virtual routing plane carries data streams of different service types. The network central controller is responsible for maintaining the resource set of the virtual routing plane and dynamically adjusting the virtual routing plane according to service changes. It provides the optimal routing strategy for similar services, supports efficient transmission of multiple services, and improves network resource utilization.

[0061] Bandwidth resources are allocated on demand to meet the service quality requirements of different services, such as... Figure 2As shown, this invention constructs multiple virtual routing planes corresponding to different service types, carrying data flows of different service types. Different types of services are distinguished. Furthermore, based on this, the network central controller uses transmission latency as the weight and employs the Dijkstra algorithm to select the optimal information transmission route for service transmission. As the number of services increases and high-priority services are accessed, the routing plane set is dynamically adjusted, weights are recalculated, and transmission routes are updated, thereby reducing network losses and improving network performance.

[0062] Specifically, this invention constructs a virtual routing plane that distinguishes between service types. For example, power IoT services are mainly divided into two categories: data acquisition and discontinuous limited control. The characteristics of these services determine that IoT data is highly bursty, user distribution is relatively random, and real-time requirements are high. Therefore, this invention prioritizes services based on data volume and real-time requirements, simplifying service types, as shown in Table 1:

[0063] Table 1

[0064] Control-related business <1ms 50kbps <![CDATA[P r =1]]> Measurement services <1s <10kbps <![CDATA[P r =5]]> Security monitoring services <1s <10kbps <![CDATA[P r =2]]> Environmental information collection services <1s <50kbps <![CDATA[P r =6]]> Multimedia services <50ms 3Mbps <![CDATA[P r =3]]> Data transmission services <20ms <1Mbps <![CDATA[P r =4]]>

[0065] The transmission of business data streams needs to take into account the latency P required by the business requirements. delay Bandwidth P bw and business priority P r , using P w Represents the service transmission demand vector: P w =(P delay P bw P r );

[0066] Different business needs require the scheduling of different amounts of underlying physical resources. In order to flexibly allocate and match the underlying resources, this invention creates a business-oriented virtual routing plane, with each type of business data flow carried by a corresponding virtual routing plane.

[0067] First, the underlying physical network is divided into a series of independent logical networks, each containing several virtual routing nodes. For virtual routing node p... v ∈N v The underlying physical node q s ∈N s Satisfying: M N (p v )=q s ;

[0068] Among them, M N It is a node mapping function, representing the virtual routing node p. v With the underlying physical node q sThe mapping relationship between them. The network central controller randomly selects several virtual routing nodes to form a virtual link. For virtual link l v ∈E v Satisfying: M L (l v ) = (p1, p2, ..., p k ), k≥2, and bandwidth constraint B(p) i )≤B(q i );

[0069] Where, p i Let q represent the i-th virtual routing node. i p i The corresponding underlying physical node; M L This is a link composition function; a virtual link consists of multiple virtual routing nodes that meet certain conditions.

[0070] Subsequently, the network central controller fits multiple virtual links to form a virtual routing plane N. b = (l1, l2, ..., l k ), k≥2; for virtual routing plane N b Its total bandwidth is the sum of the bandwidths of all links, satisfying:

[0071] Different virtual routing planes, under the invocation of the network central controller, will form different service function chains, carrying different services. There will be a corresponding routing plane to carry this service, satisfying the following:

[0072] Virtual Router Plane Set Includes all virtual routing planes: The bandwidth resource set includes the bandwidth of each virtual routing plane: Among them, |P w | represents the sum of business types of data flow.

[0073] The virtual routing plane adjustment of this invention is essentially a resource bandwidth optimization problem. When the number of high-priority services in the underlying physical network increases and the bandwidth resource allocation becomes unbalanced, it is necessary to dynamically adjust the bandwidth resources to reduce service latency and increase throughput.

[0074] For virtual routing plane N a Its binary pair (P) a B a In ), P a N represents a The priority of the service type of the data stream it carries, i.e., N a Priority; B a N representsa Bandwidth resources. When N a When bandwidth resources are insufficient, the priority of traversing services is higher than N. a Low-level virtual routing planes reclaim idle resources from these virtual routing planes through the network central controller.

[0075] Because there is a mapping relationship between the underlying physical nodes and the virtual routing nodes in the virtual routing plane, the method of recycling is to reduce the number of virtual routing nodes in the original virtual routing plane, while simultaneously sending N... a Add virtual routing nodes to coordinate the adjustment of the virtual routing plane set. Constraints include:

[0076] Priority constraints: P a >P i ;

[0077] Bandwidth constraints: N a The bandwidth increment that can be obtained b a The total reduction in bandwidth for the low-priority routing plane should not exceed B. a +b a ≤∑(B i -b i );

[0078] b M = (b1, b2, ..., b k ), k=|P w | indicates the additional bandwidth required for each virtual routing plane; virtual routing planes with available bandwidth require an additional 0.

[0079] To improve resource utilization, this invention uses the sum of the products of various service weights and the amount of data transmitted per second as the objective function value for dynamically adjusting the virtual routing plane set, as shown in Equation 1; the service weights are determined by the service priorities, as described below: Where the priority is p r The weight of the business is

[0080]

[0081] in, This indicates a priority of P. i The number of service data streams carried by the virtual routing plane; This indicates a priority of P. i The bandwidth of the virtual routing plane, Indicates priority P i The weight of the business; |P w | represents the sum of business types of data flow.

[0082] Based on the aforementioned routing system based on a virtual routing plane in a converged network, this embodiment of the invention provides a routing method based on a virtual routing plane applied in a network central controller within a converged network. The process is as follows: Figure 3 As shown, it includes the following steps:

[0083] Step S301: For the current data flow to be routed, the network central controller determines the virtual routing plane N that carries the data flow. a ;

[0084] In this step, the network central controller, for the data flow to be routed, determines the virtual routing plane with a priority corresponding to the priority of the service type, based on the service type of the data flow, and uses this virtual routing plane N to carry the data flow. a .

[0085] Step S302: The network central controller determines whether the bandwidth resources required by the data flow are greater than the virtual routing plane N. a If the remaining bandwidth resources are available, then proceed to step S303 to adjust the bandwidth resources of the virtual routing plane; otherwise, directly proceed to step S304 to adjust the bandwidth resources of the virtual routing plane N. a The middle part performs routing calculations for this data stream;

[0086] Step S303: The network central controller adjusts the bandwidth resources of the virtual routing plane;

[0087] In this step, the network central controller will adjust the virtual routing nodes in the virtual routing plane with lower priority to the virtual routing plane that carries the data flow, so as to meet the bandwidth resources required by the data flow.

[0088] Specifically, the network central controller will use the virtual routing plane N that carries this data stream. a The specific methods and procedures for adjusting the bandwidth resources of a virtual routing plane, which is to be increased in bandwidth resources, are as follows: Figure 4 As shown, it includes the following sub-steps:

[0089] Sub-step S401: The network central controller calculates a priority lower than P. a The total remaining bandwidth resources of the virtual routing plane;

[0090] Sub-step S402: The network central controller determines that the priority is lower than P. a Can the total remaining bandwidth resources of the virtual routing plane satisfy N? a The bandwidth resources required to carry the data stream; if so, then execute sub-step S403 to adjust the virtual routing nodes in the virtual routing plane with lower priority to N. aOtherwise, execute sub-step S404 to reclaim bandwidth resources for all virtual routing planes;

[0091] Sub-step S403: Adjust the virtual routing nodes in the virtual routing plane with lower priority to N. a middle;

[0092] In this sub-step, as a preferred implementation, if there are multiple ways to adjust virtual routing nodes in the virtual routing plane with lower priority to N... a It can satisfy N a For each node adjustment scheme requiring bandwidth resources to carry the data stream, the corresponding F value is calculated according to Equation 1 above; the maximum F value is determined to be the optimal target value F. max This ensures optimal global bandwidth allocation; based on F max The corresponding node adjustment scheme adjusts the virtual routing nodes in the virtual routing plane with lower priority to N. a .

[0093] Sub-step S404: Reclaim bandwidth resources for all virtual routing planes.

[0094] In this sub-step, all remaining bandwidth resources of the virtual routing plane are reclaimed; if the reclaimed bandwidth resources can satisfy N a The bandwidth resources required to carry the data stream, and there are multiple ways to adjust virtual routing nodes in other virtual routing planes to N. a It can satisfy N a For each node adjustment scheme requiring bandwidth resources to carry the data stream, the corresponding F value is calculated according to Equation 1 above; the maximum F value is determined to be the optimal target value F. max This ensures optimal global bandwidth allocation; based on F max The corresponding node adjustment scheme adjusts the virtual routing nodes in the corresponding virtual routing plane to N. a .

[0095] Step S304: The network central controller in the virtual routing plane N a The middle part performs routing calculations for this data stream;

[0096] In this step, the network central controller can utilize Dijkstra's algorithm in the virtual routing plane N. a The middle part performs routing calculations for this data stream; preferably, V... W The Dijkstra algorithm is used to calculate the route using the weights, where V W This is the sum of the transmission delays of data streams across all virtual routing planes.

[0097] Specifically, the optimal transmission route is selected for each type of service using the transmission delay between virtual routing nodes as the weight. Assuming the source of a certain type of service is α and the destination is β, the transmission delay of that service can be expressed as: Where n is the number of virtual routing nodes traversed from α to β; θ α，β ≤P delay This means that the service transmission latency of the virtual routing plane must be less than or equal to the latency requirement of the service it carries.

[0098] Where d i，i+1 The delay between virtual routing nodes i and i+1 during service transmission is represented as: k is the number of data packets of the service transmitted per unit time in the virtual link between nodes i and i+1; where B represents the amount of data transmitted per unit time for the service's data packets via the virtual link between nodes i and i+1. l Let i be the bandwidth of the virtual link where virtual routing node i and i+1 are located. This invention assumes that the link data transmission rate is equal to the link bandwidth.

[0099] To optimize the transmission delay of the global optimization routing plane set, the objective function is shown in Equation 2:

[0100]

[0101] Where |P w | Represents the sum of business types of data flow. This represents the overall transmission latency of data flows across all virtual routing planes.

[0102] Step S305: The network central controller routes the data stream based on the underlying physical node corresponding to the allocated virtual routing node through the 5G slice controller.

[0103] Based on the aforementioned routing method using a virtual routing plane in a converged network, this embodiment of the invention provides a routing device using a virtual routing plane in a converged network configured in a network central controller, with the internal structure as follows: Figure 5 As shown, it includes: a route plane determination module 501, a bandwidth resource adjustment module 502, a virtual route node calculation module 503, and a route control module 504;

[0104] The routing plane determination module 501 is used to determine, for a data flow to be routed, a virtual routing plane with a priority corresponding to the priority of the service type, based on the service type of the data flow, and use this virtual routing plane N to carry the data flow. a ;

[0105] The bandwidth resource adjustment module 502 is used when the bandwidth resource required for the data stream is greater than N.a When the remaining bandwidth resources are exhausted, virtual routing nodes in the virtual routing plane with lower priority will be adjusted to N. a In order to meet the bandwidth resources required for this data stream;

[0106] The virtual routing node calculation module 503 is used in N a The process involves performing route calculations for the data stream and assigning the calculated virtual route nodes to the data stream.

[0107] The routing control module 504 is used to route the data stream based on the underlying physical node corresponding to the assigned virtual routing node.

[0108] The specific implementation methods of the functions of each module in the routing device based on the virtual routing plane in the converged network provided in this embodiment of the invention can be described in the parameters above. Figure 3 The steps and methods of the process shown are not repeated here.

[0109] This invention uses MATLAB topology simulation software under a Windows system to simulate the node topology of the underlying physical link. For intermediate forwarding nodes, since MATLAB does not provide simulation of forwarding routes, the simulation system uses some forwarding nodes to replace routing functions. Using a topology structure of 20 fixed nodes set by MATLAB, this invention constructs a virtual routing plane structure model and generates a topology model using traditional construction methods, and the two generated topologies are compared.

[0110] Fixed-size data packets are sent from the data source, with each packet initially set to 1024 bytes, and the total data volume controlled within 10Mb. The target end receives the data and records the throughput of each path node. Figure 6 It is known that, as the amount of data sent increases, the node throughput in traditional algorithms initially increases sharply and then slows down. Uneven distribution of node throughput can easily lead to data accumulation in some nodes, affecting data transmission in other nodes. In the virtual routing plane-based routing scheme (PSO-SA algorithm) of this invention, the service link selection is flexible and free. The node throughput increases slowly and evenly with the increase of data volume, and the data volume distribution in the nodes is uniform, achieving a balanced distribution of data transmission among the nodes.

[0111] Some edge nodes in the virtual routing plane not only receive data but also act as cloud forwarding services. In selecting links for a large number of services, it's crucial to consider not only the throughput efficiency of the individual nodes but also the satisfaction level after link switching. We use link pressure to represent link satisfaction, where link pressure represents the maximum number of fixed-size data packets that can be sent simultaneously on a link; path-average link pressure is the average of the total global link pressure. After link deployment, the mapping of the underlying topology to the logical network results in differences in node link connections. The information processing capacity of the logical links limits the actual transmission of the underlying physical links. As the number of data sending nodes and the communication volume increase at the application layer, the link pressure in the physical topology network significantly increases, necessitating a re-selection of service links based on the link selection algorithm. This invention's routing method based on the virtual routing plane (PSO-SA algorithm) utilizes link transmission latency and available bandwidth information at the underlying level, effectively avoiding link congestion at the physical topology level, resulting in relatively low link pressure in the application layer logical network structure. Figure 7 As shown, when the number of nodes is constant, the average link pressure of the transmission path in the virtual routing plane structure of this invention is significantly reduced. This further demonstrates that the routing method based on the virtual routing plane of this invention can effectively alleviate link pressure, reduce link congestion, and improve the overall advantages of the network topology construction model.

[0112] In the technical solution of this invention, for a data flow to be routed, a virtual routing plane with a priority corresponding to the priority of the service type is determined according to the service type of the data flow, and this virtual routing plane N is used to carry the data flow. a The bandwidth resources required for this data stream are greater than N. a When the remaining bandwidth resources are exhausted, virtual routing nodes in the virtual routing plane with lower priority will be adjusted to N. a In N, to meet the bandwidth resources required for this data stream; a The system performs routing calculations for the data stream and allocates the calculated virtual routing nodes to it. The underlying physical nodes corresponding to the allocated virtual routing nodes then route the data stream. Addressing the multi-service characteristics of converged network scenarios, this invention constructs an architecture with multiple virtual routing planes, enabling differentiated responses to different service requests. Furthermore, by dynamically adjusting the bandwidth resources of the virtual routing planes, it comprehensively considers the impact of node resource utilization, throughput, server deployment costs, latency, and other factors to achieve optimal adjustment of multi-service routing selection. This supports efficient multi-service transmission in converged networks and improves network resource utilization.

[0113] Figure 8This illustration schematically depicts the hardware architecture of a computer device 1300 employing a virtual routing plane-based routing method in a converged network according to an embodiment of this application. In this embodiment, the computer device 1300 is a device capable of automatically performing numerical calculations and / or information processing according to pre-set or stored instructions. For example, it may be a smartphone, tablet computer, laptop computer, desktop computer, rack server, blade server, tower server, or cabinet server (including standalone servers or server clusters composed of multiple servers), etc. Figure 8 As shown, the computer device 1300 includes, but is not limited to, at least: a memory 1310, a processor 1320, and a network interface 1330 that can communicate with each other via a system bus. Wherein:

[0114] The memory 1310 includes at least one type of computer-readable storage medium, including flash memory, hard disk, multimedia card, card-type memory (e.g., SD or DX memory), random access memory (RAM), static random access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, magnetic disk, optical disk, etc. In some embodiments, the memory 1310 may be an internal storage module of the computer device 1300, such as the hard disk or memory of the computer device 1300. In other embodiments, the memory 1310 may also be an external storage device of the computer device 1300, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc. Of course, the memory 1310 may also include both the internal storage module and the external storage device of the computer device 1300. In this embodiment, the memory 1310 is typically used to store the operating system and various application software installed on the computer device 1300, such as program code for routing methods based on a virtual routing plane in a converged network. In addition, the memory 1310 can also be used to temporarily store various types of data that have been output or will be output.

[0115] In some embodiments, processor 1320 may be a central processing unit (CPU), controller, microcontroller, microprocessor, or other data processing chip. Processor 1320 is typically used to control the overall operation of computer device 1300, such as performing control and processing related to data interaction or communication with computer device 1300. In this embodiment, processor 1320 is used to run program code stored in memory 1310 or process data.

[0116] Network interface 1330 may include a wireless network interface or a wired network interface, which is typically used to establish a communication link between computer device 1300 and other computer devices. For example, network interface 1330 is used to connect computer device 1300 to an external terminal via a network, establishing a data transmission channel and communication link between computer device 1300 and the external terminal. The network may be an intranet, the Internet, Global System for Mobile Communications (GSM), Wideband Code Division Multiple Access (WCDMA), 4G network, 5G network, Bluetooth, Wi-Fi, or other wireless or wired networks.

[0117] It should be pointed out that, Figure 8 Only a computer device with components 1310-1330 is shown; however, it should be understood that it is not required to implement all of the components shown, and more or fewer components may be implemented instead.

[0118] In this embodiment, the routing method based on the virtual routing plane in the converged network stored in the memory 1310 can be further divided into one or more program modules and executed by one or more processors (processor 1320 in this embodiment) to complete the embodiment of this application.

[0119] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0120] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of this disclosure (including the claims) is limited to these examples; within the framework of this invention, the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations of the different aspects of the invention as described above, which are not provided in the details for the sake of brevity.

[0121] Additionally, to simplify the description and discussion, and to avoid obscuring the invention, the well-known power / ground connections to integrated circuit (IC) chips and other components may or may not be shown in the provided drawings. Furthermore, the apparatus may be shown in block diagram form to avoid obscuring the invention, and this also takes into account the fact that the details of implementation of these block diagram apparatuses are highly dependent on the platform on which the invention will be implemented (i.e., these details should be fully understood by those skilled in the art). While specific details (e.g., circuits) are set forth to describe exemplary embodiments of the invention, it will be apparent to those skilled in the art that the invention may be practiced without these specific details or with variations thereof. Therefore, these descriptions should be considered illustrative rather than restrictive.

[0122] Although the invention has been described in conjunction with specific embodiments thereof, many substitutions, modifications, and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may be used with the embodiments discussed.

[0123] The embodiments of this invention are intended to cover all such substitutions, modifications, and variations falling within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this invention should be included within the scope of protection of this invention.

Claims

1. A routing method based on a virtual routing plane in a converged network, characterized in that, include: For a data flow to be routed, a virtual routing plane with a priority corresponding to the service type of the data flow is determined based on the service type of the data flow, and this plane is used as the virtual routing plane to carry the data flow. The virtual routing plane is constructed based on the fitting of multiple virtual links. The total bandwidth of the virtual routing plane is the sum of the bandwidths of each link. There is a mapping relationship between the underlying physical network and the virtual routing plane. The bandwidth resources required for this data stream are greater than When the remaining bandwidth resources are exhausted, virtual routing nodes in the virtual routing plane with lower priority will be adjusted to... In order to meet the bandwidth resources required for this data stream; exist The system performs routing calculations for the data stream and assigns the calculated virtual routing nodes to the data stream. The data stream is routed based on the underlying physical node corresponding to the assigned virtual routing node.

2. The method according to claim 1, characterized in that, Also includes: If the bandwidth resources required by the data stream are less than or equal to Given the remaining bandwidth resources, then: directly in The system performs routing calculations for the data stream and assigns the calculated virtual routing nodes to the data stream.

3. The method according to claim 1, characterized in that, The step of adjusting virtual routing nodes in the lower-priority virtual routing plane to Specifically, it includes: If priority is lower The total remaining bandwidth resources of the virtual routing plane can meet the requirements. The bandwidth resources required to carry the data stream, and there are multiple ways to adjust virtual routing nodes in the virtual routing plane with lower priority to... Can meet The node adjustment scheme for carrying the bandwidth resources required for the data stream is as follows: For each node adjustment scheme, the corresponding calculation is performed according to Equation 1. F value; Determine the maximum F The value is the optimal target value. This ensures optimal global bandwidth allocation. according to The corresponding node adjustment scheme involves adjusting virtual routing nodes in the virtual routing plane with lower priority to higher priority. ; in, for The priority, as expressed in Equation 1, is as follows: (Equation 1) in, Indicates priority as The number of service data streams carried by the virtual routing plane; Indicates priority as The bandwidth of the virtual routing plane, Indicates priority as The weight of the business; This represents the sum of business types that represent data flows.

4. The method according to claim 3, characterized in that, Also includes: If priority is lower The total remaining bandwidth resources of the virtual routing plane cannot meet the requirements. Given the bandwidth resources required to carry the data stream, then: Reclaim all remaining bandwidth resources in the virtual routing plane; If the recovered bandwidth resources can meet the requirements The bandwidth resources required to carry the data stream, and there are multiple ways to adjust virtual routing nodes in other virtual routing planes to... Can meet The node adjustment scheme for carrying the bandwidth resources required for the data stream is as follows: For each node adjustment scheme, the corresponding calculation is performed according to Equation 1. F value; Determine the maximum F The value is the optimal target value. This ensures optimal global bandwidth allocation. according to The corresponding node adjustment scheme will adjust the virtual routing nodes in the corresponding virtual routing plane to... .

5. The method according to claim 1, characterized in that, The above The middle part performs routing calculations for this data stream, specifically including: Using Dijkstra's algorithm The middle part performs routing calculations for this data stream.

6. The method according to claim 5, characterized in that, The use of Dijkstra's algorithm in The routing calculation for this data stream is performed as follows: by The Dijkstra algorithm is used to calculate the route using the weights, where, This is the sum of the transmission delays of data streams across all virtual routing planes.

7. A routing device based on a virtual routing plane in a converged network, installed in the network central controller, characterized in that, include: The routing plane determination module is used to determine, for a data flow to be routed, a virtual routing plane with a priority corresponding to the service type of the data flow, and use this virtual routing plane as the virtual routing plane to carry the data flow. The virtual routing plane is constructed based on the fitting of multiple virtual links. The total bandwidth of the virtual routing plane is the sum of the bandwidths of each link. There is a mapping relationship between the underlying physical network and the virtual routing plane. The bandwidth resource adjustment module is used to adjust the bandwidth resources required by the data stream when they exceed the limit. When the remaining bandwidth resources are exhausted, virtual routing nodes in the virtual routing plane with lower priority will be adjusted to... In order to meet the bandwidth resources required for this data stream; The virtual routing node calculation module is used to... The system performs routing calculations for the data stream and assigns the calculated virtual routing nodes to the data stream. The routing control module is used to route the data stream based on the underlying physical node corresponding to the assigned virtual routing node.

8. A routing system based on a virtual routing plane in a converged network, comprising: The converged terminal, 5G slicing controller, and 5G core network are characterized by further comprising: a network central controller as described in claim 7; wherein... The converged terminal is used to send data streams of different service types to the 5G core network through the 5G base station. The network central controller is used to perform routing calculations for data flows of different service types based on the virtual routing plane; allocate the calculated virtual routing nodes to the data flows; and map the data flows of the services of the virtual routing nodes to the corresponding underlying physical nodes through the 5G slice controller to route the data flows, thereby completing the transmission of the data flows in the 5G core network.

9. A computer device, the computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the routing method based on a virtual routing plane in the converged network according to any one of claims 1 to 6.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that can be executed by at least one processor to cause the at least one processor to perform the steps of the routing method based on a virtual routing plane in a converged network as described in any one of claims 1 to 6.

Images