CN117118901A - Routing method, system and device based on virtual routing plane in converged network - Google Patents
Routing method, system and device based on virtual routing plane in converged network Download PDFInfo
- Publication number
- CN117118901A CN117118901A CN202310895360.1A CN202310895360A CN117118901A CN 117118901 A CN117118901 A CN 117118901A CN 202310895360 A CN202310895360 A CN 202310895360A CN 117118901 A CN117118901 A CN 117118901A
- Authority
- CN
- China
- Prior art keywords
- virtual routing
- routing
- virtual
- plane
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 230000005540 biological transmission Effects 0.000 claims abstract description 45
- 238000004364 calculation method Methods 0.000 claims abstract description 33
- 230000004927 fusion Effects 0.000 claims description 16
- 238000004422 calculation algorithm Methods 0.000 claims description 12
- 238000013507 mapping Methods 0.000 claims description 8
- 238000005457 optimization Methods 0.000 claims description 8
- 238000004590 computer program Methods 0.000 claims description 7
- 230000001934 delay Effects 0.000 claims description 3
- 238000004064 recycling Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 description 19
- 230000001965 increasing effect Effects 0.000 description 10
- 238000005516 engineering process Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 9
- 238000010586 diagram Methods 0.000 description 8
- 238000012545 processing Methods 0.000 description 5
- 230000008859 change Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000006855 networking Effects 0.000 description 3
- 238000004088 simulation Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 230000001419 dependent effect Effects 0.000 description 2
- 230000010365 information processing Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- QVFWZNCVPCJQOP-UHFFFAOYSA-N chloralodol Chemical compound CC(O)(C)CC(C)OC(O)C(Cl)(Cl)Cl QVFWZNCVPCJQOP-UHFFFAOYSA-N 0.000 description 1
- 230000000052 comparative effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/58—Association of routers
- H04L45/586—Association of routers of virtual routers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/76—Routing in software-defined topologies, e.g. routing between virtual machines
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
- H04L47/2433—Allocation of priorities to traffic types
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/78—Architectures of resource allocation
- H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers
- H04L47/787—Bandwidth trade among domains
Abstract
The application discloses a routing method, a system and a device based on a virtual routing plane in a converged network, wherein the method comprises the following steps: for a data stream to be routed, determining a virtual routing plane with priority corresponding to the priority of the service type according to the service type of the data stream as a virtual routing plane N for bearing the data stream a The method comprises the steps of carrying out a first treatment on the surface of the Where the bandwidth resources required for the data stream are greater than N a When the residual bandwidth resource of the virtual routing plane with lower priority is adjusted to N a To meet the bandwidth resources required by the data stream; at N a The routing calculation is carried out for the data flow, and the virtual obtained by calculation is distributed for the data flowA node to be routed; and routing the data flow based on the bottom physical node corresponding to the distributed virtual routing node. The application can support the multi-service high-efficiency transmission and improve the utilization rate of network resources.
Description
Technical Field
The present application relates to the field of network technologies, and in particular, to a routing method, system, and apparatus based on a virtual routing plane in a converged network.
Background
With the great development of power grid services, the current power services are various in variety and different in communication demand, and a single network cannot meet the industrial demands of different services on service quality, so that a need exists to provide safe, reliable and real-time communication service for a power grid by fusing various heterogeneous network resources. An electric power wide-coverage multi-wireless communication system fusion network which takes a 5G technology as a main body and fuses a plurality of wireless communication systems is widely studied. The electric power 5G fusion network is used for realizing flexible extension and wide coverage of the terminal service terminal by introducing the multilink fusion communication terminal, so that the multilink fusion terminal is accessed to the core network through 5G, 5G base stations or wires and other modes, and then is accessed to the service system. And the original communication means at the service terminal is utilized downwards to communicate with the service terminal, so that the power service coverage capability is improved, and the power service communication reliability is comprehensively improved.
The 5G technology is taken as a main body, and the electric power wide-coverage networking fused by the multi-wireless communication system is a networking mode with great prospect for realizing the whole coverage of a novel electric power system communication network. The networking scheme adopts a two-layer architecture, the upper layer is a transmission network formed by 5G-MEC nodes, and network end functions and application deployment are sunk to the edge of a wireless access network of terminal user equipment, so that the application deployment is more flexible, the network capacity is stronger, the service processing is closer to the terminal, and the application requirements of a power system on high bandwidth and low delay are better met. The lower layer adopts an edge fusion access terminal Mesh ad hoc network to downwards receive signals sent by various power wireless communication terminals such as 5G, wiFi, loRa, zigBee and the like, so that wide coverage, multi-wireless communication system fusion and flexible service deployment are realized. However, in terms of service access, the power service has various kinds of communication requirements, and when the power service convergence terminal performs cross-domain and cross-layer scheduling, the service of providing large bandwidth, low delay and high reliability communication is partially dependent on the 5G technology, and the service is affected by the change of the accessed wireless communication system. Therefore, it is necessary to provide a routing scheme in the converged network, which can support efficient transmission of multiple services and improve the utilization rate of network resources.
Disclosure of Invention
Therefore, the present application aims to provide a routing method, a system and a device based on a virtual routing plane in a converged network, which can support multi-service efficient transmission and improve the utilization rate of network resources.
Based on the above object, the present application provides a routing method based on a virtual routing plane in a converged network, which includes:
for the data flow to be routed, determining the priority and the data flow according to the service type of the data flowVirtual routing plane corresponding to priority of service type as virtual routing plane N for carrying the data flow a ；
Where the bandwidth resources required for the data stream are greater than N a When the residual bandwidth resource of the virtual routing plane with lower priority is adjusted to N a To meet the bandwidth resources required by the data stream;
at N a Performing route calculation for the data flow, and distributing virtual route nodes obtained by calculation for the data flow;
and routing the data flow based on the bottom physical node corresponding to the distributed virtual routing node.
Further, the method further comprises:
if the bandwidth resource required by the data stream is less than or equal to N a Is then:
directly at N a And performing route calculation on the data flow, and distributing the calculated virtual routing nodes for the data flow.
Preferably, the virtual routing nodes in the virtual routing plane with lower priority are adjusted to N a The method specifically comprises the following steps:
if the priority is lower than P a The sum of the remaining bandwidth resources of the virtual routing plane of (a) can satisfy N a The bandwidth resources required to carry the data flows and there are a variety of ways to adjust the virtual routing nodes in the lower priority virtual routing plane to N a Can satisfy N a And a node adjustment scheme for carrying the bandwidth resources required by the data stream, wherein the node adjustment scheme comprises the following steps:
for each node adjustment scheme, calculating a corresponding F value according to formula 1;
determining the maximum F value as the optimal target value F max The bandwidth global allocation optimization is guaranteed;
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 ；
Wherein P is a Is N a Is a priority of (3).
Further, the method further comprises:
if the priority is lower than P a The sum of the remaining bandwidth resources of the virtual routing plane of (a) cannot satisfy N a Bandwidth resources required for carrying the data stream, then:
recycling the residual bandwidth resources of all the virtual routing planes;
if the recovered bandwidth resource can meet N a Bandwidth resources required to carry the data flows and there are a variety of adjustments to the virtual routing nodes in other virtual routing planes to N a Can satisfy N a And a node adjustment scheme for carrying the bandwidth resources required by the data stream, wherein the node adjustment scheme comprises the following steps:
for each node adjustment scheme, calculating a corresponding F value according to formula 1;
determining the maximum F value as the optimal target value F max The bandwidth global allocation optimization is guaranteed;
according to F max Corresponding node adjustment scheme for adjusting virtual routing nodes in corresponding virtual routing planes to N a 。
Preferably, the said N a The method specifically comprises the following steps of:
using the Di Jie Style algorithm at N a Is used for performing routing calculation for the data flow.
Preferably in V W Routing computation for weights using Dijiestra algorithm, where V W Is the sum of the transmission delays of the data streams in all virtual routing planes.
The application also provides a routing device based on the virtual routing plane in the converged network, which is arranged in the network center controller and comprises:
a routing plane determining module for determining, for a data stream to be routed, a virtual routing plane with priority corresponding to the priority of the traffic type according to the traffic type of the data stream, as a virtual routing plane N carrying the data stream a ；
A bandwidth resource adjusting module for adjusting the bandwidth resource required by the data stream to be greater than N a When remaining bandwidth resources of (1)Adjusting virtual routing nodes in a virtual routing plane with lower priority to N a To meet the bandwidth resources required by the data stream;
a virtual routing node calculation module for calculating the virtual routing node in N a Performing route calculation for the data flow, and distributing virtual route nodes obtained by calculation for the data flow;
and the routing control module is used for routing the data flow based on the bottom physical node corresponding to the distributed virtual routing node.
The application also provides a routing system based on the virtual routing plane in the converged network, which comprises: fusion terminal, 5G section controller, 5G core network still includes: a hub controller as described above; wherein,
the fusion terminal is used for transmitting data streams of different service types to a 5G core network through a 5G base station;
the network center controller is used for carrying out route calculation on the data flows of different service types based on the virtual route plane; distributing the calculated virtual routing nodes for the data stream; and mapping the data flow of the service of the virtual routing node to the corresponding bottom physical node through the 5G slice controller to route the data flow, thereby completing the transmission of the data flow in the 5G core network.
The application also provides a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor executing the computer program for implementing the steps of the virtual routing plane based routing method in the converged network.
The present application also provides a computer readable storage medium having stored thereon a computer program executable by at least one processor to cause the at least one processor to perform the steps of the virtual routing plane based routing method in a converged network as described above.
In the technical scheme of the application, for the data flow to be routed, the priority and the priority are determined according to the service type of the data flowThe virtual routing plane corresponding to the priority of the service type is used as the virtual routing plane N for bearing the data flow a The method comprises the steps of carrying out a first treatment on the surface of the Where the bandwidth resources required for the data stream are greater than N a When the residual bandwidth resource of the virtual routing plane with lower priority is adjusted to N a To meet the bandwidth resources required by the data stream; at N a Performing route calculation for the data flow, and distributing virtual route nodes obtained by calculation for the data flow; and routing the data flow based on the bottom physical node corresponding to the distributed virtual routing node. Aiming at the characteristics of multi-service bearing under the converged network scene, the application constructs the architecture of a plurality of virtual routing plane networks, and can realize differentiated response to different service requests; the method is characterized in that the optimization adjustment of multi-service routing is realized by adjusting dynamic bandwidth resources of a virtual routing plane and comprehensively considering the influences of node resource utilization rate, throughput, server deployment cost, time delay and the like; therefore, the multi-service high-efficiency transmission of the converged network can be supported, and the network resource utilization rate is improved.
Drawings
In order to more clearly illustrate the embodiments of the application or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic architecture diagram of a routing system based on a virtual routing plane in a converged network according to an embodiment of the present application;
fig. 2 is a schematic diagram of a mapping relationship of a virtual routing plane according to an embodiment of the present application;
fig. 3 is a flowchart of a routing method based on a virtual routing plane in a converged network according to an embodiment of the present application;
fig. 4 is a flowchart of a method for bandwidth resource adjustment of a virtual routing plane according to an embodiment of the present application;
fig. 5 is an internal block diagram of a routing device based on a virtual routing plane in a converged network according to an embodiment of the present application;
fig. 6 and 7 are schematic diagrams of simulation results of comparative experiments of the routing method and the existing routing method according to the embodiment of the present application;
fig. 8 is a schematic diagram of a hardware structure of a computer device according to an embodiment of the present application.
Detailed Description
The present application will be further described in detail below with reference to specific embodiments and with reference to the accompanying drawings, in order to make the objects, technical solutions and advantages of the present application more apparent.
It should be noted that unless otherwise defined, technical or scientific terms used in the embodiments of the present application should be given the ordinary meaning as understood by one of ordinary skill in the art to which the present disclosure pertains. The terms "first," "second," and the like, as used in this disclosure, do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that elements or items preceding the word are included in the element or item listed after the word and equivalents thereof, but does not exclude other elements or items. The terms "connected" or "connected," and the like, are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", etc. are used merely to indicate relative positional relationships, which may also be changed when the absolute position of the object to be described is changed.
The inventor of the application considers that SDN is a software defined network, and can completely separate network element equipment, a forwarding plane and a control plane, thereby realizing network centralized management, enhancing network flexibility and better meeting the customization requirement of users. Therefore, the virtual routing plane technology of the application just applies SDN to the converged terminal bearing network and the core network, thereby customizing the virtual routing plane for different services according to the needs.
Specifically, the application provides a virtual routing plane technology, which can divide the bottom physical network part into a series of mutually independent logic networks to respectively form a series of virtual routing planes, and each logic network serves a class of service scenes to meet the service bearing requirements. On the basis, the application provides a routing scheme based on a virtual routing plane in a converged network, different subnets bear different types of services, an SDN controller distributes bottom bandwidth resources according to needs, and selects an optimal routing transmission path for the transmission of the same kind of multi-service by taking the transmission delay between routing nodes as a weight, so that the end-to-end transmission delay of a sender and a receiver is reduced, the multi-service efficient transmission can be supported, the network resource utilization rate is improved, and the network transmission efficiency is improved.
The following describes the technical scheme of the embodiment of the present application in detail with reference to the accompanying drawings.
As shown in fig. 1, the present application proposes an architecture of a routing system based on a virtual routing plane in a converged network, which mainly includes: the system comprises a network center controller, a fusion terminal, a 5G slice controller and a 5G core network.
The fusion network of the power scene generally comprises a plurality of types of power services, each type of service is supported by a corresponding service terminal or system, and the service terminals generate data streams of different service types and then transmit the data streams to the fusion terminal in a plurality of wireless access modes;
the fusion terminal sends data streams of different service types to a 5G core network for transmission through a 5G base station: the fusion terminal adopts a 5G air interface to communicate with a 5G base station or directly access a gateway through MEC equipment. After receiving various types of data streams transmitted by the fusion terminal, the 5G base station performs TSN (time sensitive network) data stream format conversion on the received data streams through MEC equipment to generate TSN data streams; and then the generated TSN data stream is sent to a 5G core network for transmission;
the network center controller is responsible for topology maintenance of the whole network, mapping of the bottom physical network and the virtual routing plane and basic routing calculation; that is, the hub controller performs route calculation for data flows of different service types based on the virtual routing plane; distributing the calculated virtual routing nodes for the data stream;
the 5G slice controller bridges the service input from the virtual routing planes into the 5G network slice, ensures that a plurality of virtual routing planes can establish complete mapping relation with the bottom physical resource, ensures successful access of each communication technology in the converged terminal, and completes differentiated bearing of the service.
That is, the network center controller bridges the data stream input of the service of the virtual routing node to the 5G network slice through the 5G slice controller, maps to the corresponding bottom physical node to route the data stream, and completes the transmission of the data stream in the 5G core network.
The infrastructure layer of the 5G core network defines an infrastructure controller responsible for configuring and managing virtual network resources.
In fig. 1, the virtual routing plane carries data flows of different service types, and the network center controller is responsible for maintaining a resource set of the virtual routing plane, dynamically adjusting the virtual routing plane according to service changes, providing an optimal routing strategy for similar services, supporting efficient transmission of multiple services, and improving the utilization rate of network resources.
According to the service quality requirements of different services, bandwidth resources are allocated according to the requirements, as shown in fig. 2, the application constructs a plurality of virtual routing planes which respectively correspond to different service types and bear data flows of the different service types; different kinds of services are distinguished, and on the basis, the network center controller selects the optimal service transmission for the information transmission route by taking the transmission delay as a weight and adopting a Dijskra algorithm. When the number of the services is increased and the high-priority service is accessed, the routing plane set is dynamically adjusted, the weight is recalculated, and the transmission route is updated, so that the network loss is reduced and the network performance is improved.
Specifically, the application constructs a virtual routing plane for distinguishing service types, for example, the electric power internet of things service is mainly divided into two types of data acquisition and discontinuous limited control, the service characteristics determine that the internet of things data has strong burstiness, the user distribution is random, and the real-time requirement is high. Therefore, the application divides the service priority according to the service data volume and real-time requirement, simplifies the service type, as shown in table 1:
TABLE 1
| Service | Time delay requirement | Broadband requirements | Priority level |
| Control class service | <1ms | 50kbps | P r ＝1 |
| Measurement business | <1s | <10kbps | P r ＝5 |
| Security monitoring service | <1s | <10kbps | P r ＝2 |
| Environment information collection service | <1s | <50kbps | P r ＝6 |
| Multimedia services | <50ms | 3Mbps | P r ＝3 |
| Data transmission service | <20ms | <1Mbps | P r ＝4 |
The transmission of the service data stream requires consideration of the time delay P of the service requirement delay Bandwidth P bw Service priority P r By P w Representing a traffic transmission demand vector: p (P) w ＝(P delay ，P bw ，P r )；
For different service demands, different numbers of bottom physical resources need to be scheduled, and for flexible mobilization and collocation of the bottom resources, the application creates a virtual routing plane facing the service, and the data flow of each type of service is carried by a corresponding virtual routing plane.
First, the underlying physical network is divided into a series of mutually independent logical networks, which contain several virtual routing nodes. For virtual routing node p v ∈N v Bottom layer physical node q s ∈N s The method comprises the following steps: m is M N (p v )＝q s ；
Wherein M is N Is a node mapping function representing a virtual routing node p v With the underlying physical node q s Mapping relation between the two. The network center controller randomly selects a plurality of virtual routing nodes to form a virtual link, and the virtual link is v ∈E v The method comprises the following steps: m is M L (l v )＝(p 1 ，p 2 ，...，p k ) K.gtoreq.2, and bandwidth limitation condition B (p i )≤B(q i )；
Wherein p is i Representing the ith virtual pathBy nodes, q i Represents p i Corresponding bottom layer physical nodes; m is M L The virtual links are composed of a plurality of virtual routing nodes satisfying the condition as a link composition function.
Further, the hub controller fits a plurality of virtual links to form a virtual routing plane N b ＝(l 1 ，l 2 ，...，l k ) K is more than or equal to 2; for virtual routing plane N b The total bandwidth is the sum of the bandwidths of all links, and the following conditions are satisfied:
different virtual routing planes can form different service function chains under the call of the network center controller, bear different services, and are used for the servicesThe corresponding routing plane carries the service, and the following conditions are satisfied: />
Virtual routing plane setIncluding all virtual routing planes: />The bandwidth resource set includes the bandwidth of each virtual routing plane: />Wherein, |P w The i represents the sum of the traffic types of the data flows.
The virtual routing plane adjustment of the application is essentially the optimization problem of resource bandwidth, and when the quantity of high priority service in the bottom physical network is increased and bandwidth resource allocation is unbalanced, the bandwidth resource needs to be dynamically adjusted, thereby achieving the effects of reducing service delay and improving throughput.
For virtual routingPlane N a Of which the binary group (P a ，B a ) In P a Represents N a Priority of traffic type of data stream carried, i.e. N a Is a priority of (3); b (B) a Represents N a Is allocated to the bandwidth resources of the mobile station. When N is a Traversing service priority ratio N when bandwidth resource is insufficient a Low virtual routing planes and the free resources of these virtual routing planes are reclaimed by the hub controller.
Because the mapping relation exists between the bottom layer physical nodes and the virtual routing nodes of the virtual routing plane, the reclaiming method is to reduce the virtual routing nodes in the original virtual routing plane and simultaneously send N to a Virtual routing nodes are added, and a virtual routing plane set is cooperatively adjusted. The constraint conditions include:
constraint relation of priority: p (P) a ＞P i ；
Constraint relation of bandwidth: n (N) a The bandwidth increment b that can be obtained a The total amount of low virtual priority routing plane bandwidth reduction is not exceeded: b (B) a +b a ≤∑(B i -b i )；
b M ＝(b 1 ，b 2 ，...，b k )，k＝|P w I indicates that each virtual routing plane needs increased bandwidth, and the virtual routing plane with free bandwidth increases by 0.
In order to improve the resource utilization rate, the application takes the sum F value of products of various service weights and the transmission data quantity of the service per second as the objective function value of dynamic adjustment of the virtual routing plane set, as shown in the formula 1; the service weight is determined by the service priority, expressed as follows:wherein the priority is p r The weight of the traffic of (2) is +.>
Wherein,indicating priority as P i The number of traffic data flows carried by the virtual routing plane; />Indicating priority as P i Bandwidth of virtual routing plane of +.>Indicating priority as P i Is a weight of the traffic of (1); p w The i represents the sum of the traffic types of the data flows.
Based on the routing system based on the virtual routing plane in the converged network, the embodiment of the application provides a routing method based on the virtual routing plane in the converged network applied to a network center controller, and the flow is shown in fig. 3, and the method comprises the following steps:
step S301: for the current data flow to be routed, the network center controller determines a virtual routing plane N for bearing the data flow a ；
In this step, the hub controller determines, for a current data flow to be routed, a virtual routing plane having a priority corresponding to a priority of a traffic type according to the traffic type of the data flow, as a virtual routing plane N carrying the data flow a 。
Step S302: the network center controller judges whether the bandwidth resource required by the data flow is larger than the virtual routing plane N a Is a residual bandwidth resource of (1); if yes, executing step S303 to adjust bandwidth resources of the virtual routing plane; otherwise, directly executing step S304 in the virtual routing plane N a The routing calculation is carried out for the data flow;
step S303: the network center controller adjusts bandwidth resources of the virtual routing plane;
in the step, the network center controller adjusts the virtual routing nodes in the virtual routing plane with lower priority to the virtual routing plane bearing the data flow so as to meet the bandwidth resources required by the data flow;
in particular, the hub controller will carry the virtual routing plane N of the data flow a As a virtual routing plane to be added with bandwidth resources, a specific method flow for adjusting the bandwidth resources of the virtual routing plane is shown in fig. 4, and includes the following sub-steps:
substep S401: network center controller calculation priority lower than P a The sum of the remaining bandwidth resources of the virtual routing plane;
substep S402: the network center controller judges that the priority is lower than P a Whether the sum of the remaining bandwidth resources of the virtual routing plane of (a) can satisfy N a Carrying bandwidth resources required by the data stream; if so, then sub-step S403 is performed to adjust the virtual routing nodes in the lower priority virtual routing plane to N a In (a) and (b); otherwise, performing sub-step S404 to reclaim bandwidth resources for all virtual routing planes;
substep S403: adjusting virtual routing nodes in a lower priority virtual routing plane to N a In (a) and (b);
in this substep, as a preferred embodiment, if there are multiple virtual routing nodes in the virtual routing plane with lower priority to N a Can satisfy N a A node adjustment scheme for carrying bandwidth resources required by the data stream, wherein for each node adjustment scheme, a corresponding F value is calculated according to the formula 1; determining the maximum F value as the optimal target value F max The bandwidth global allocation optimization is guaranteed; 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 。
Substep S404: bandwidth resources are reclaimed for all virtual routing planes.
In the substep, recycling the residual bandwidth resources of all the virtual routing planes; if the recovered bandwidth resource can meet N a Bandwidth resource required for carrying the data streamSource, and there are a variety of tuning virtual routing nodes in other virtual routing planes to N a Can satisfy N a A node adjustment scheme for carrying bandwidth resources required by the data stream, wherein for each node adjustment scheme, a corresponding F value is calculated according to the formula 1; determining the maximum F value as the optimal target value F max The bandwidth global allocation optimization is guaranteed; according to F max Corresponding node adjustment scheme for adjusting virtual routing nodes in corresponding virtual routing planes to N a 。
Step S304: network center controller is on virtual routing plane N a The routing calculation is carried out for the data flow;
in this step, the hub controller may use the dijkstra algorithm on the virtual routing plane N a The routing calculation is carried out for the data flow; preferably in V W Routing computation for weights using Dijiestra algorithm, where V W Is the sum of the transmission delays of the data streams in all virtual routing planes.
Specifically, with the transmission delay between the virtual routing nodes as a weight, an optimal transmission route is selected for each type of service. Assuming that the source end of a certain type of service is alpha and the destination end is beta, the transmission delay of the service can be expressed as:wherein n is the number of virtual routing nodes through which alpha to beta pass; θ α，β ≤P delay Representing that the service transmission delay of the guaranteed virtual routing plane must be less than or equal to the delay requirement of the service carried by the virtual routing plane.
Wherein d is i，i+1 The delay between virtual routing nodes i, i+1 in the service transmission process is expressed as:k is the number of data packets of the service transmitted in unit time of the virtual link between the nodes i, i+1; wherein the method comprises the steps ofData quantity transmitted by data packets of the service in unit time of virtual link between nodes i, i+1, B l For the bandwidth of the virtual link where the virtual routing node i, i+1 is located, the present application assumes that the link data transmission rate is equal to the link bandwidth.
In order to optimize the transmission delay of the globally optimized routing plane set, an objective function is obtained as shown in equation 2:
wherein |P w I represents the sum of the traffic types of the data flows,representing the overall propagation delay of the data flow in all virtual routing planes.
Step S305: the network center controller routes the data flow through the 5G slice controller based on the bottom physical node corresponding to the distributed virtual routing node.
Based on the routing method based on the virtual routing plane in the converged network, the embodiment of the application provides a routing device based on the virtual routing plane in the converged network arranged in the network center controller, and the internal structure is shown in fig. 5, and the routing device comprises: a routing plane determining module 501, a bandwidth resource adjusting module 502, a virtual routing node calculating module 503 and a routing control module 504;
the routing plane determining module 501 is configured to determine, for a data flow to be routed, a virtual routing plane with a priority corresponding to a priority of a traffic type according to the traffic type of the data flow, as a virtual routing plane N carrying the data flow a ；
The bandwidth resource adjustment module 502 is configured to, when the bandwidth resource required by the data stream is greater than N a When the residual bandwidth resource of the virtual routing plane with lower priority is adjusted to N a To meet the bandwidth resources required by the data stream;
the virtual routing node calculation module 503 is configured toAt N a Performing route calculation for the data flow, and distributing virtual route nodes obtained by calculation for the data flow;
the routing control module 504 is configured to route the data flow based on the underlying physical node corresponding to the allocated virtual routing node.
The specific implementation method of the functions of each module in the routing device based on the virtual routing plane in the converged network provided by the embodiment of the present application can be the above-mentioned method of each step in the flow shown in fig. 3, and will not be described herein.
In the application, the node topology relation of the bottom physical link is simulated by using MATLAB topology simulation software under the Windows system, and for the intermediate forwarding nodes, the simulation system adopts some forwarding nodes to replace the routing function because the simulation of forwarding routes is not provided in the MATLAB. The application is used for constructing a virtual routing plane structure model and generating a topology structure model in a traditional construction mode by utilizing the topology structure of 20 nodes with fixed number set by MATLAB, and comparing the two generated topologies.
And transmitting a data packet with a fixed size from a data source end, wherein 1024bytes are initially set for a single data packet, the total data volume is controlled within 10Mb, and a target end receives the data and records the throughput of each path node. As can be seen from fig. 6, in the process of continuously increasing the data transmission amount, the throughput of the node in the conventional algorithm shows a tendency of rapidly increasing and then slowly increasing, and uneven throughput distribution of the node easily causes data accumulation in part of the nodes, so that data transmission of other nodes is affected. In the routing scheme (PSO-SA algorithm) based on the virtual routing plane, the service links are flexibly and freely selected, the throughput rate change condition of the nodes is slowly and uniformly increased along with the increase of the data volume, the data volume in the nodes is uniformly distributed, and the data transmission distribution balance among the nodes is realized.
Part of the edge nodes in the virtual routing plane not only receive data, but also serve as a function of cloud forwarding services. In link deployment selection of a large number of services, not only throughput efficiency of own nodes but also satisfaction after link switching are considered. We use link pressure to represent link satisfaction, which represents the maximum number of data packets that can be sent simultaneously over the link; the path average link pressure is then the average of the global link pressure sums. After the link deployment is completed, node link connection differentiation is generated when the bottom topology is mapped to the logic network, the actual transmission of the bottom physical link is limited by the information processing capacity of the logic link, when the data transmission nodes of the application layer are continuously increased and the traffic is continuously increased, the link pressure in the physical topology network is obviously increased, and service link selection is needed to be carried out again according to a link selection algorithm. The routing method (PSO-SA algorithm) based on the virtual routing plane utilizes the link transmission delay and the available bandwidth information on the bottom layer, so that the link congestion is effectively avoided in the physical topology layer, and the pressure of the connecting link mapped into the application layer logic network structure is relatively small. As shown in fig. 7, when the number of nodes is fixed, the average link pressure of the transmission path in the virtual routing plane structure of the present application is significantly reduced. The routing method based on the virtual routing plane can effectively relieve the link pressure, reduce the link congestion and improve the advantage of the network topology construction model on the whole.
In the technical scheme of the application, for a data stream to be routed, a virtual routing plane with priority corresponding to the priority of the service type is determined according to the service type of the data stream and used as a virtual routing plane N for bearing the data stream a The method comprises the steps of carrying out a first treatment on the surface of the Where the bandwidth resources required for the data stream are greater than N a When the residual bandwidth resource of the virtual routing plane with lower priority is adjusted to N a To meet the bandwidth resources required by the data stream; at N a Performing route calculation for the data flow, and distributing virtual route nodes obtained by calculation for the data flow; and routing the data flow based on the bottom physical node corresponding to the distributed virtual routing node. Aiming at the characteristics of multi-service bearing under the converged network scene, the application constructs the architecture of a plurality of virtual routing plane networks, and can realize differentiated response to different service requests; and comprehensively considering node resource utilization through dynamic bandwidth resource adjustment of the virtual routing planeThe influences of rate, throughput, server deployment cost, time delay and the like are used for realizing the optimal adjustment of multi-service routing; therefore, the multi-service high-efficiency transmission of the converged network can be supported, and the network resource utilization rate is improved.
Fig. 8 schematically illustrates a hardware architecture diagram of a computer device 1300 that fuses virtual routing plane-based routing methods in a network according to an embodiment of the present application. In this embodiment, the computer apparatus 1300 is an apparatus capable of automatically performing numerical calculation and/or information processing in accordance with an instruction set or stored in advance. For example, it may be a smart phone, a tablet computer, a notebook computer, a desktop computer, a rack server, a blade server, a tower server, or a rack server (including a stand-alone server or a server cluster composed of a plurality of servers), etc. As shown in fig. 8, computer device 1300 includes at least, but is not limited to: memory 1310, processor 1320, and network interface 1330 may be communicatively linked to each other by a system bus. Wherein:
memory 1310 includes at least one type of computer-readable storage medium including flash memory, hard disk, multimedia card, card memory (e.g., SD or DX memory, etc.), 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 a 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, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash Card (Flash Card) or the like. Of course, memory 1310 may also include both internal memory modules of computer device 1300 and external memory devices. In this embodiment, the memory 1310 is typically used to store an operating system installed on the computer device 1300 and various application software, such as program codes of a routing method based on a virtual routing plane in a converged network. Furthermore, the memory 1310 may also be used to temporarily store various types of data that have been output or are to be output.
Processor 1320 may be a central processing unit (Central Processing Unit, simply CPU), controller, microcontroller, microprocessor, or other data processing chip in some embodiments. The processor 1320 is generally configured to control overall operation of the computer device 1300, such as performing control and processing related to data interaction or communication with the computer device 1300, and the like. In this embodiment, processor 1320 is used to execute program code or process data stored in memory 1310.
The network interface 1330 may include a wireless network interface or a wired network interface, the network interface 1330 typically being used to establish communication links between the computer device 1300 and other computer devices. For example, the network interface 1330 is used to connect the computer device 1300 to an external terminal through a network, establish a data transmission channel and a communication link between the computer device 1300 and the external terminal, and the like. The network may be a wireless or wired network such as an Intranet (Intranet), the Internet (Internet), a global system for mobile communications (Global System ofMobile communication, abbreviated as GSM), wideband code division multiple access (Wideband Code Division Multiple Access, abbreviated as WCDMA), a 4G network, a 5G network, bluetooth (Bluetooth), wi-Fi, etc.
It should be noted that FIG. 8 only shows a computer device having components 1310-1330, but it should be understood that not all of the illustrated components are required to be implemented, and that more or fewer components may be implemented instead.
In this embodiment, the routing method based on the virtual routing plane in the converged network stored in the memory 1310 may also be divided into one or more program modules, and executed by one or more processors (the processor 1320 in this embodiment) to implement an embodiment of the present application.
The computer readable media of the present embodiments, including both permanent and non-permanent, removable and non-removable media, may be used to implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer 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 technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device.
Those of ordinary skill in the art will appreciate that: the discussion of any of the embodiments above is merely exemplary and is not intended to suggest that the scope of the disclosure, including the claims, is limited to these examples; the technical features of the above embodiments or in the different embodiments may also be combined within the idea of the application, the steps may be implemented in any order and there are many other variations of the different aspects of the application as described above, which are not provided in detail for the sake of brevity.
Additionally, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown within the provided figures, in order to simplify the illustration and discussion, and so as not to obscure the application. Furthermore, the devices may be shown in block diagram form in order to avoid obscuring the application, and also in view of the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform within which the present application is to be implemented (i.e., such specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the application, it should be apparent to one skilled in the art that the application can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative in nature and not as restrictive.
While the application has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of those embodiments will be apparent to those skilled in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may use the embodiments discussed.
The embodiments of the application are intended to embrace all such alternatives, modifications and variances which fall within the broad scope of the appended claims. Therefore, any omission, modification, equivalent replacement, improvement, etc. of the present application should be included in the scope of the present application.
Claims (10)
1. A virtual routing plane-based routing method in a converged network, comprising:
for a data stream to be routed, determining a virtual routing plane with priority corresponding to the priority of the service type according to the service type of the data stream as a virtual routing plane N for bearing the data stream a ；
Where the bandwidth resources required for the data stream are greater than N a When the residual bandwidth resource of the virtual routing plane with lower priority is adjusted to N a To meet the bandwidth resources required by the data stream;
at N a Performing route calculation for the data flow, and distributing virtual route nodes obtained by calculation for the data flow;
and routing the data flow based on the bottom physical node corresponding to the distributed virtual routing node.
2. The method as recited in claim 1, further comprising:
if the bandwidth resource required by the data stream is less than or equal to N a Is then:
directly at N a And performing route calculation on the data flow, and distributing the calculated virtual routing nodes for the data flow.
3. The method according to claim 1The method is characterized in that the virtual routing nodes in the virtual routing plane with lower priority are adjusted to N a The method specifically comprises the following steps:
if the priority is lower than P a The sum of the remaining bandwidth resources of the virtual routing plane of (a) can satisfy N a The bandwidth resources required to carry the data flows and there are a variety of ways to adjust the virtual routing nodes in the lower priority virtual routing plane to N a Can satisfy N a And a node adjustment scheme for carrying the bandwidth resources required by the data stream, wherein the node adjustment scheme comprises the following steps:
for each node adjustment scheme, calculating a corresponding F value according to formula 1;
determining the maximum F value as the optimal target value F max The bandwidth global allocation optimization is guaranteed;
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 ；
Wherein P is a Is N a Is represented by formula 1 as follows:
wherein,indicating priority as P i The number of traffic data flows carried by the virtual routing plane; />Indicating priority as P i Bandwidth of virtual routing plane of +.>Indicating priority as P i Is a weight of the traffic of (1); p w The i represents the sum of the traffic types of the data flows.
4. A method according to claim 3, further comprising:
if the priority is lower than P a The sum of the remaining bandwidth resources of the virtual routing plane of (a) cannot satisfy N a Bandwidth resources required for carrying the data stream, then:
recycling the residual bandwidth resources of all the virtual routing planes;
if the recovered bandwidth resource can meet N a Bandwidth resources required to carry the data flows and there are a variety of adjustments to the virtual routing nodes in other virtual routing planes to N a Can satisfy N a And a node adjustment scheme for carrying the bandwidth resources required by the data stream, wherein the node adjustment scheme comprises the following steps:
for each node adjustment scheme, calculating a corresponding F value according to formula 1;
determining the maximum F value as the optimal target value F max The bandwidth global allocation optimization is guaranteed;
according to F max Corresponding node adjustment scheme for adjusting virtual routing nodes in corresponding virtual routing planes to N a 。
5. The method of claim 1, wherein said at N a The method specifically comprises the following steps of:
using the Di Jie Style algorithm at N a Is used for performing routing calculation for the data flow.
6. The method of claim 5, wherein the using the dijkstra algorithm is at N a The routing calculation is performed for the data flow, specifically:
in V form W Routing computation for weights using Dijiestra algorithm, where V W Is the sum of the transmission delays of the data streams in all virtual routing planes.
7. A routing device based on a virtual routing plane in a converged network, which is arranged in a network center controller, and is characterized by comprising:
a routing plane determining module for determining, for a data stream to be routed, a virtual routing plane with priority corresponding to the priority of the traffic type according to the traffic type of the data stream, as a virtual routing plane N carrying the data stream a ；
A bandwidth resource adjusting module for adjusting the bandwidth resource required by the data stream to be greater than N a When the residual bandwidth resource of the virtual routing plane with lower priority is adjusted to N a To meet the bandwidth resources required by the data stream;
a virtual routing node calculation module for calculating the virtual routing node in N a Performing route calculation for the data flow, and distributing virtual route nodes obtained by calculation for the data flow;
and the routing control module is used for routing the data flow based on the bottom physical node corresponding to the distributed virtual routing node.
8. A virtual routing plane based routing system in a converged network, comprising: fusion terminal, 5G section controller, 5G core network, its characterized in that still includes: the hub controller of claim 7; wherein,
the fusion terminal is used for transmitting data streams of different service types to a 5G core network through a 5G base station;
the network center controller is used for carrying out route calculation on the data flows of different service types based on the virtual route plane; distributing the calculated virtual routing nodes for the data stream; and mapping the data flow of the service of the virtual routing node to the corresponding bottom physical node through the 5G slice controller to route the data flow, thereby completing the transmission of the data flow in the 5G core network.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor is adapted to implement the steps of the virtual routing plane based routing method in a converged network according to any one of claims 1 to 6 when the computer program is executed.
10. A computer readable storage medium, wherein a computer program is stored in the computer readable storage medium, the computer program being executable by at least one processor to cause the at least one processor to perform the steps of the virtual routing plane based routing method in a converged network according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310895360.1A CN117118901A (en) | 2023-07-20 | 2023-07-20 | Routing method, system and device based on virtual routing plane in converged network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310895360.1A CN117118901A (en) | 2023-07-20 | 2023-07-20 | Routing method, system and device based on virtual routing plane in converged network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117118901A true CN117118901A (en) | 2023-11-24 |
Family
ID=88799271
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310895360.1A Pending CN117118901A (en) | 2023-07-20 | 2023-07-20 | Routing method, system and device based on virtual routing plane in converged network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117118901A (en) |
-
2023
- 2023-07-20 CN CN202310895360.1A patent/CN117118901A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111132077B (en) | Multi-access edge computing task unloading method based on D2D in Internet of vehicles environment | |
| Liu et al. | Load-balancing routing algorithm based on segment routing for traffic return in LEO satellite networks | |
| TWI308436B (en) | Channel allocation method for dynamically allocating channels of a plurality of radio interfaces at a plurality of access points included in a mesh network, and access point | |
| CN109257091B (en) | Global load balancing satellite-ground cooperative network networking device and method | |
| US7756198B2 (en) | System and method for assigning channels in a wireless network | |
| Mavromoustakis et al. | An energy-aware scheme for efficient spectrum utilization in a 5G mobile cognitive radio network architecture | |
| US10356185B2 (en) | Optimal dynamic cloud network control | |
| CN113784373B (en) | Combined optimization method and system for time delay and frequency spectrum occupation in cloud edge cooperative network | |
| US8638669B2 (en) | Path control system, path control device, path control method, and program | |
| US10075364B2 (en) | Method and apparatus for self-tuned adaptive routing | |
| Park et al. | Network intelligence based on network state information for connected vehicles utilizing fog computing | |
| CN111601327B (en) | Service quality optimization method and device, readable medium and electronic equipment | |
| CN105490939B (en) | Method, system and computer medium for routing in a mobile wireless network | |
| Garai et al. | Communication as a service for cloud VANETs | |
| CN114268548A (en) | Network slice resource arranging and mapping method based on 5G | |
| CN114745791B (en) | Power service slice arrangement and resource allocation method and device | |
| Mastorakis et al. | Maximizing energy conservation in a centralized cognitive radio network architecture | |
| CN104412647A (en) | Systems and methods for clustering optimization to help resolve boundary problems in communication systems | |
| CN106105282B (en) | The system and method for carrying out traffic engineering using link buffer zone state | |
| CN112867088B (en) | Dynamic adjustment method and system for cloud-edge-end communication architecture | |
| CN113691956A (en) | Vehicle networking mobility management method based on SDN and MEC | |
| CN117118901A (en) | Routing method, system and device based on virtual routing plane in converged network | |
| CN116419406A (en) | Distributed photovoltaic grid-connected network resource allocation method, system, device and medium | |
| CN101997720B (en) | The method of trans-regional monitoring flow program request and video management server | |
| CN112637066B (en) | Network slicing and path selection optimization method and system for power internet of things |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |