CN112637066B - Network slicing and path selection optimization method and system for power internet of things - Google Patents

Network slicing and path selection optimization method and system for power internet of things Download PDF

Info

Publication number
CN112637066B
CN112637066B CN202011481778.0A CN202011481778A CN112637066B CN 112637066 B CN112637066 B CN 112637066B CN 202011481778 A CN202011481778 A CN 202011481778A CN 112637066 B CN112637066 B CN 112637066B
Authority
CN
China
Prior art keywords
sdn
switch
transmission
controller
things
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.)
Active
Application number
CN202011481778.0A
Other languages
Chinese (zh)
Other versions
CN112637066A (en
Inventor
邹玉龙
夏天
吴通华
郭海燕
姚刚
王玲
陈国洲
江源
刘天明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NARI Group Corp
Nanjing University of Posts and Telecommunications
Nari Technology Co Ltd
Original Assignee
NARI Group Corp
Nanjing University of Posts and Telecommunications
Nari Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by NARI Group Corp, Nanjing University of Posts and Telecommunications, Nari Technology Co Ltd filed Critical NARI Group Corp
Priority to CN202011481778.0A priority Critical patent/CN112637066B/en
Publication of CN112637066A publication Critical patent/CN112637066A/en
Application granted granted Critical
Publication of CN112637066B publication Critical patent/CN112637066B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/12—Shortest path evaluation
    • H04L45/121—Shortest path evaluation by minimising delays
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0893—Assignment of logical groups to network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/142—Network analysis or design using statistical or mathematical methods
    • 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/12—Shortest path evaluation
    • H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention discloses a network slicing and path selection optimization method and system for an electric power Internet of things, which are suitable for data transmission between a sending terminal and a receiving terminal under a 5G network slicing scene. The data of the sending terminal reaches the receiving terminal through the forwarding of the exchangers in the base stations. And (3) allocating bandwidth resources according to the service requirements of the power Internet of things, and constructing a service-oriented network slice. On the basis, the SDN controller selects an optimal information transmission path by taking the transmission time delay between base stations as a weight and adopting a Dijskra algorithm. The invention aims to reduce the transmission delay, and reduces the end-to-end transmission delay of a sender and a receiver through network slicing and path selection optimization.

Description

Network slicing and path selection optimization method and system for power internet of things
Technical Field
The invention relates to a network slicing and path selection optimization method and system for an electric power Internet of things, and belongs to the technical field of wireless communication.
Background
The network slicing technique is particularly important in a network architecture as a core technique of 5G communication. The 5G end-to-end network slice can flexibly allocate network resources, network the network according to the needs, A plurality of logic subnets with different characteristics and isolated from each other are virtualized based on the 5G network, so that various application scenarios can be met. SDN (Software Definition Network) is an important application in a 5G communication Network, and is a novel architecture composed of an application layer, a control layer (composed of logic centralized and programmable controllers, which grasp global Network information), and an infrastructure layer (which provides forwarding of data, fast processing, and matching of data packets). Such an architecture can not only support resilient management of the communication network, dynamic data transmission at high bandwidth can also be achieved.
The SDN decouples and separates a control plane and a data plane of the network, abstracts data plane network resources, and supports direct programming control of the network through a uniform interface. The first characteristic of the SDN is that the network is open and programmable, i.e., a user can program on a controller, and can implement configuration, control and management of the network without changing the physical architecture of the network, thereby accelerating the process of network service deployment. The second characteristic is that the control plane and the data plane are separated, and under the SDN, the data forwarding plane and the control plane can independently complete the evolution of a system structure, and only a uniform open interface is needed to be followed for communication. The third characteristic is the logically centralized control, namely, the centralized and unified management is provided for the distributed network state. The characteristics greatly improve the programming capability of the network, so that the network is more flexible, open and easy to expand, and the requirements of customizing and dynamically deploying 5G network slices as required are met.
The network slice divides the network into a plurality of end-to-end parallel virtual networks, thereby dealing with various application scenarios. For each network slice, exclusive resources such as network bandwidth, service quality, safety and the like can be fully ensured. Meanwhile, each network slice can also provide a dedicated network control function and performance guarantee for different application scenarios, that is, the function of each network slice can be reconfigured according to service requirements. Therefore, how to select a communication path for a network after network slicing is a problem that needs to be solved by those skilled in the art.
Disclosure of Invention
The purpose is as follows: in order to overcome the defects in the prior art, the invention provides a network slicing and path selection optimization method and system for an electric power Internet of things.
The technical scheme is as follows: in order to solve the technical problems, the technical scheme adopted by the invention is as follows:
a network slicing and path selection optimization method for an electric power Internet of things comprises the following steps:
will be distant from the transmitting terminal S a Nearest SDN switch W 1 As a sender switch, record sender terminal S a Nearest SDN switch W 1 To each remaining SDN switch W 2 ,W 3 ,…,W N Average one-way transmission delay of
Figure BDA0002836878100000021
As initial weight of each switch
Figure BDA0002836878100000022
Form an initial set of weights
Figure BDA0002836878100000023
Set SDN switches as
Figure BDA0002836878100000024
Initial set of selected switches
Figure BDA0002836878100000025
Set of unselected switches as
Figure BDA0002836878100000026
From a set of values Γ 0 SDN switch W corresponding to medium selection minimum value n1 As a transit exchange; compute a sender switch W 1 Warp W n1 The average one-way transmission time delay of the transmission information to other SDN switches is compared with the initial weight value, the weight value of each switch is updated, and the updated weight value is
Figure BDA0002836878100000027
The update criteria are as follows:
Figure BDA0002836878100000028
wherein m is from [1,N ∈ [ ]]，n 1 ∈[1,N]Form an updated weight set
Figure BDA0002836878100000031
Updating the selected switch set to
Figure BDA0002836878100000032
The unselected exchanger is collected as
Figure BDA0002836878100000033
Circulating the above iteration process, and in the (l + 1) th iteration process, collecting from the value set Γ l In which the weight is selected to be the smallest
Figure BDA0002836878100000034
And belong to a set of unselected switches
Figure BDA0002836878100000035
Switch of
Figure BDA0002836878100000036
In the same way, the sending terminal switch W is switched 1 Warp beam
Figure BDA0002836878100000037
Average one-way transmission delay and recorded weight for transmitting information to other exchangers
Figure BDA0002836878100000038
Comparing, updating the weight of each exchanger according to the following criteria, wherein the updated weight is
Figure BDA0002836878100000039
Figure BDA00028368781000000310
Form updated weight set
Figure BDA00028368781000000311
Updating the selected switch set to
Figure BDA00028368781000000312
The unselected exchanger is collected as
Figure BDA00028368781000000313
When the unselected exchanger set is an empty set, the iteration is terminated to obtain the final weight value
Figure BDA00028368781000000314
Zxfoom
Figure BDA00028368781000000315
And the SDN switch traversed in the calculation process obtains an optimal transmission path from the sending terminal to the receiving terminal.
As a preferred scheme, the average one-way transmission delay calculation formula is as follows:
Figure BDA00028368781000000316
wherein the content of the first and second substances,
Figure BDA00028368781000000317
for any two SDN switches W in the N SDN switches i ，W j Average unidirectional transmission delay therebetween; t is t i From controller C to W for P1 instruction i From W i Is transmitted to W j Then from W j Total time of forward transmission to controller C; t is t j From controller C to W for P1 instruction j From W j Is transmitted to W i Then from W i Total reverse transmission time to controller C; t is t echoi For SDN switch W i Transmission time with controller C, t echoj As SDN switch W j And controller C.
Preferably, t is i The calculation formula is as follows:
Figure BDA0002836878100000041
wherein
Figure BDA0002836878100000042
And
Figure BDA0002836878100000043
respectively represent the transmission of P1 instruction from C to W i From W i Is transmitted to W j And from W j Time to transfer to C.
Preferably, t is j The calculation formula is as follows:
Figure BDA0002836878100000044
wherein
Figure BDA0002836878100000045
And
Figure BDA0002836878100000046
respectively represent the transmission of P1 instruction from C to W j From W j Is transmitted to W i And from W j Time to transfer to C.
Preferably, t is echoi The calculation formula is as follows:
Figure BDA0002836878100000047
preferably, t is echoj The calculation formula is as follows:
Figure BDA0002836878100000048
preferably, the controller C adopts an SDN controller, the SDN controller allocates lower-layer spectrum resources, divides a part of a transmission frequency band into a dedicated frequency band for a specific service, and only the specific service performs data transmission in the dedicated frequency band.
Information transmission between a sending terminal and a receiving terminal is realized by a plurality of 5G micro base stations and SDN controller services, bandwidth resources are allocated according to the service requirements of the power Internet of things, and a service-oriented network slice is constructed.
Has the advantages that: according to the method and the system for optimizing the network slice and the path selection for the power internet of things, bandwidth resources are distributed according to the service requirements of the power internet of things, and the service-oriented network slice is constructed. On the basis, the SDN controller selects an optimal information transmission path by taking the transmission time delay between base stations as a weight and adopting a Dijskra algorithm. Through the combination of a network slicing technology and a Dijskra algorithm, an optimal transmission path from a sending terminal to a receiving terminal is selected, and the transmission time delay from the sending terminal to the receiving terminal is reduced.
Drawings
Fig. 1 is a schematic architecture diagram of a power internet of things oriented network slicing and path selection optimization system designed by the present invention.
Fig. 2 is a schematic flow diagram of a network slicing and path selection optimization method for an electric power internet of things designed by the present invention.
Fig. 3 is a schematic diagram illustrating comparison between transmission delays for path selection and random path selection by using a Dijskra algorithm in a network slice environment and for different network bandwidths.
Detailed Description
The invention is described below with reference to the specific examples the invention is further described.
As shown in fig. 1, a power internet of things-oriented Network slicing and path selection optimization system includes a sending terminal, a receiving terminal, a CPE, a 5G micro base station and an SDN controller, where the 5G micro base station is configured with a Software Defined Network (SDN) switch. A CPE (Customer Premise Equipment) is a device that converts a high-speed 4G or 5G signal into a WiFi signal, and can support multiple mobile terminals to access the internet at the same time, so as to access transmission information into a wireless network. Information transmission between a sending terminal and a receiving terminal is realized by a plurality of 5G micro base stations and SDN controller services. And aiming at the service requirements, bandwidth resources are distributed, and a service-oriented network slice is constructed. On the basis, the SDN controller takes the transmission delay between the base stations as a weight value, and selecting an optimal information transmission path by adopting a Dijstra algorithm.
As shown in fig. 2, the invention designs a power internet of things-oriented network slicing and path selection optimization method, and information transmission between a sending terminal and a receiving terminal is realized by a plurality of 5G micro base stations and SDN controller services.
The SDN switch serves as a data forwarding platform and carries forwarding of service data. The SDN controller serves as a control platform and is responsible for dividing slices, selecting data forwarding paths in the slices and allocating resources. And the SDN controller dynamically schedules, compiles and abstracts lower-layer resources according to the service types, customizes the network for each client according to the needs, and forms network slices.
The specific embodiment of the invention is applied to an end-to-end data transmission service facing the power internet of things, and related data is transmitted between two terminal devices.
The system comprises two terminal devices, a 5G device for encapsulating transmission data into a 5G transmission structure, and 6 base stations used for data transmission between the terminal devices.
The network slice is an end-to-end a private logical network. The network slice runs on a common physical or virtual network. The network slices are isolated from each other, has independent control and management and can be customized according to requirements.
Dividing network slices for the current transmission service and constructing a private network, thereby executing the step A: the method comprises the steps of forwarding service data flow by adopting an SDN switch, selecting a route by adopting an SDN controller, constructing a wireless network architecture with separated bearing and control, allocating special spectrum resources according to service requirements, and constructing network slices.
And step A, arranging an SDN switch in the base station as a data forwarding platform of the network, and constructing a wireless network architecture with separated bearing and control by using an SDN controller as a control platform of the network. Specifically, the SDN controller uniformly schedules wireless resources of a lower-layer SDN switch to perform optimal path planning; after a transmission data packet of a sending terminal reaches a base station, data forwarding is sequentially completed in an SDN switch of the corresponding base station according to allocated resources and a planned path, and finally the transmission data packet reaches a receiving terminal.
In consideration of the diversity of transmission data types, in order to meet the transmission requirements of each service, the SDN controller dynamically schedules, compiles and abstracts lower-layer resources according to the service types, divides service-oriented network slices, and realizes the logic isolation among different service network slices. Specifically, for a specific service, lower-layer spectrum resources are allocated through an SDN controller, a part of a transmission frequency band is divided into a dedicated frequency band of the specific service, and the dedicated service is only used for data transmission in the frequency band, so that occupation and interference of other services on the dedicated bandwidth resources are avoided, and logical isolation between different services is realized.
On the divided network slice, the transmission time between each base station needs to be calculated, so step B is performed: under the coordination of the SDN controller, packet in messages are sent between the SDN switches and the SDN controller, and transmission delay between the SDN switches of each base station is calculated.
Step B, when sending terminal S a And a receiving terminal S b When the transmission service is needed, S a Transmitting transmission data to and from a terminal S via a CPE a Nearest SDN switch W 1 The base station, under the forwarding of a plurality of base stations, to the switch W nearest to the receiving terminal n . Switch W 1 After receiving the data transmission instruction, a data transmission request packet in (P1) instruction is sent to the SDN controller C. The SDN controller C sends a flooding instruction to the switch, forwarding the instruction to all ports except the sending port.
And after the switch receives the flooding instruction from the SDN controller, returning the information of each port of the switch and the MAC address of the switch to the SDN controller. And after receiving the information of the switches, the SDN controller C records the information of the switches and completes topology discovery among the switches.
After the topology discovery is completed, the switches resend the P1 instruction for measuring the transmission delay among the switches. The controller analyzes the time stamp from the P1 instruction and receives the time t receive And the time t of sending out a packet send And subtracting to obtain the transmission time of the data packet. By a switch W i And W j For example, a P1 instruction is transmitted from controller C to W i From W i Is transmitted to W j Then from W j Total time t of forward transmission to C i Can be expressed as
Figure BDA0002836878100000071
Wherein
Figure BDA0002836878100000072
And
Figure BDA0002836878100000073
respectively representing P1 instruction transmitted from C to W i From W i Is transmitted to W j And from W j Time to transfer to C. Similarly, P1 instruction is transmitted from controller C to W j From W j Is transmitted to W i Then from W i Total time t of reverse transmission to C j Can be expressed as
Figure BDA0002836878100000074
Wherein
Figure BDA0002836878100000075
And
Figure BDA0002836878100000076
respectively representing P1 instruction transmitted from C to W j From W j Is transmitted to W i And from W j Time to transfer to C.
Confirming the timestamp t carried by the instructions Echo Reply and Echo Request according to a pair of states between the controller and the switch reply ，t request Computing switch W i And W j Respectively transmitting time t with the controller echoi 、t echoj ：
Figure BDA0002836878100000081
Figure BDA0002836878100000082
Combining formulas (1) and (2) can calculate two switches W i ，W j Average one-way transmission delay therebetween
Figure BDA0002836878100000083
Is composed of
Figure BDA0002836878100000084
Based on (5), each SDN switch W between the sending terminal and the receiving terminal can be calculated 1 ,W 2 ,…,W N Average one-way transmission time between each pair of switches in (1).
Before each data packet is sent, the steps are executed, the transmission time between each pair of switches is recorded, and the transmission time is taken as a weight value and is brought into a Dijstra algorithm.
When data transmission is performed, the number of data packets is more than one, and the data packets are transmitted continuously. Thus, for the slice, the topology of the base station, and the state of each switch, need to be checked for implementation.
The state of the topology and the transmission time between the base stations are updated according to the topology structure in which data is detected every 1 ms. Before transmitting the data packet, selecting the optimal transmission path according to the latest transmission time weight.
The traditional path selection is to perform random routing between switches covered by a service range. Such path selection not only causes broadcast storm, but also the selected path is the final purpose of service completion, and the delay factor is considered to be deficient.
Therefore, the Dijskra algorithm is used as the basis for path selection, and the optimal transmission path is selected by taking the transmission delay as a weight. And C, executing the step C: and the SDN controller plans an optimal transmission path by adopting a Dijskra algorithm by taking the transmission time delay among the base station SDN switches as a weight.
And C, selecting the optimal transmission path between the sending terminal and the receiving terminal by using the calculated one-way transmission time delay as a weight through a Dijstra algorithm.
(1) Initialization: will be distant from the transmitting terminal S a Nearest switch W 1 As a transmitting-end switch, record transmitting terminal S a Nearest switch W 1 To each of the remaining switches W 2 ,W 3 ,…,W N Average one-way transmission delay of
Figure BDA0002836878100000091
Thereby makingFor initial weight of each switch
Figure BDA0002836878100000092
Form an initial set of weights
Figure BDA0002836878100000093
Record the switch set as
Figure BDA0002836878100000094
Initial set of elected switches
Figure BDA0002836878100000095
Set of unselected switches as
Figure BDA0002836878100000096
(2) And (3) iterative updating: from a set of values Γ 0 The switch corresponding to the minimum value is selected
Figure BDA0002836878100000097
As transit exchanges, i.e.
Figure BDA0002836878100000098
Computation transmitting terminal switch W 1 Warp beam
Figure BDA0002836878100000099
And (4) transmitting the average one-way transmission time delay of the information to other exchangers, comparing the average one-way transmission time delay with the initial weight value, and updating the weight value of each exchanger. The update criteria are as follows:
Figure BDA00028368781000000910
forming an updated set of weights
Figure BDA00028368781000000911
Updating the selected switch set to
Figure BDA00028368781000000912
The unselected exchanger is collected as
Figure BDA00028368781000000913
Circulating the above iteration process, and in the (l + 1) th iteration process, collecting from the value set Γ l In which the weight is selected to be the smallest
Figure BDA00028368781000000914
And belong to a set of unselected switches
Figure BDA00028368781000000915
Switch of
Figure BDA00028368781000000916
Comparing the transmitting terminal exchanges W in the same way 1 Warp beam
Figure BDA00028368781000000917
Average one-way transmission delay and recorded weight for transmitting information to other exchangers
Figure BDA00028368781000000918
The switch weights are updated according to the following criteria.
Figure BDA00028368781000000919
Forming an updated set of weights
Figure BDA00028368781000000920
Updating the selected switch set to
Figure BDA00028368781000000921
The unselected exchanger is collected as
Figure BDA00028368781000000922
And when the unselected switch set is an empty set, the iteration is terminated. To obtainTo the final weight
Figure BDA00028368781000000923
According to
Figure BDA00028368781000000924
The calculation process of (a) yields an optimal transmission path from the transmitting terminal to the receiving terminal.
An example of implementing the invention on a mininet simulation platform using Python language on a computer is given below. The SDN controller uses Ryu controller. The bandwidth of the switches within the network slice is set in the simulation to be 3m,5m, and 10M, respectively. The size of the transmitted packets includes 32bytes,64bytes,128bytes,256bytes, and 512bytes. One packet of corresponding size is sent every 833 mus. Compared with the traditional selection, the Dijstra algorithm is used for path selection in the same network, and the transmission delay is compared with the traditional selection.
Fig. 3 is a schematic diagram illustrating a comparison between transmission delays for path selection and conventional selection by using a Dijskra algorithm in a network slice environment and for different network bandwidths. It can be seen that the transmission time using Dijskra algorithm as path selection is lower than the transmission delay of conventional path selection.
The above description is only of the preferred embodiments of the present invention, and it should be noted that: it will be apparent to those skilled in the art that various modifications and adaptations can be made without departing from the principles of the invention and these are intended to be within the scope of the invention.

Claims (8)

1. A network slicing and path selection optimization method for an electric power Internet of things is characterized by comprising the following steps: the method comprises the following steps:
will be distant from the transmitting terminal S a Recent Software Defined Network (SDN) switches W 1 As a transmitting-end switch, record transmitting terminal S a Nearest SDN switch W 1 To each remaining SDN switch W 2 ,W 3 ,…,W N Average one-way transmission delay of
Figure FDA0003901549910000011
As initial weight of each switch
Figure FDA0003901549910000012
Form an initial set of weights
Figure FDA0003901549910000013
Let SDN switch set be Λ = { W = { (W) } 1 ,W 2 ,…,W N H, initial set of selected switches Λ 0 ＝{W 1 }, set of unselected switches as
Figure FDA0003901549910000014
From a set of values Γ 0 SDN switch corresponding to medium selection minimum value
Figure FDA0003901549910000015
As a transit exchange; compute a sender switch W 1 Warp beam
Figure FDA0003901549910000016
The average one-way transmission time delay of the transmission information to other SDN switches is compared with the initial weight value, the weight value of each switch is updated, and the updated weight value is
Figure FDA0003901549910000017
The update criteria are as follows:
Figure FDA0003901549910000018
wherein m is equal to [1N, N ] 1 ∈[1,N]Form an updated weight set
Figure FDA0003901549910000019
Updating the selected switch set to
Figure FDA00039015499100000110
Set of unselected switches as
Figure FDA00039015499100000111
Circulating an iterative process of updating the weight value of each switch, and in the (l + 1) th iterative process, collecting the weight value from a set of gamma values l The selected weight value is minimum and belongs to the unselected exchanger set
Figure FDA00039015499100000112
Switch of
Figure FDA00039015499100000113
Weight set gamma l The minimum value of the intermediate weight is
Figure FDA00039015499100000114
In the same way, the sending terminal exchanger W is switched 1 Warp beam
Figure FDA00039015499100000115
Average one-way transmission delay and recorded weight for transmitting information to other exchangers
Figure DA00039015499157717613
Comparing, updating the weight of each exchanger according to the following criteria, wherein the updated weight is
Figure FDA00039015499100000117
Figure FDA00039015499100000118
Forming an updated set of weights
Figure FDA0003901549910000021
Updating the selected switch set to
Figure FDA0003901549910000022
The unselected exchanger is collected as
Figure FDA0003901549910000023
When the unselected exchanger set is an empty set, the iteration is terminated to obtain the final weight value
Figure FDA0003901549910000024
According to
Figure FDA0003901549910000025
And the SDN switch traversed in the calculation process obtains an optimal transmission path from the sending terminal to the receiving terminal.
2. The power internet of things oriented network slicing and path selection optimization method of claim 1, characterized by comprising the following steps: the average one-way transmission delay calculation formula is as follows:
Figure FDA0003901549910000026
wherein the content of the first and second substances,
Figure FDA0003901549910000027
for any two SDN switches W in N SDN switches i ，W j Average one-way transmission delay between; t is t i From controller C to W for P1 instruction i From W i Is transmitted to W j Then from W j Total time of forward transmission to controller C; t is t j For P1 instruction from controller C to W j From W j Is transmitted to W i Then from W i Total reverse transmission time to controller C; t is t echoi For SDN switch W i Transmission time with controller C, t echoj For SDN trafficChange machine W j And the controller C.
3. The power internet of things oriented network slicing and path selection optimization method of claim 2, characterized in that: said t is i The calculation formula is as follows:
Figure FDA0003901549910000028
wherein
Figure FDA0003901549910000029
And
Figure FDA00039015499100000210
respectively representing P1 instruction transmitted from C to W i From W i Is transmitted to W j And from W j Time to transfer to C.
4. The power internet of things oriented network slicing and path selection optimization method according to claim 2, characterized in that: said t is j The calculation formula is as follows:
Figure FDA00039015499100000211
wherein
Figure FDA0003901549910000031
And
Figure FDA0003901549910000032
respectively representing P1 instruction transmitted from C to W j From W j Is transmitted to W i And from W j Time to transfer to C.
5. The power Internet of things oriented network slicing and routing method according to claim 3The optimization method is characterized by comprising the following steps: said t is echoi The calculation formula is as follows:
Figure FDA0003901549910000033
6. the power Internet of things-oriented network slicing and path selection optimization method according to claim 4, characterized in that: said t is echoj The calculation formula is as follows:
Figure FDA0003901549910000034
7. the power internet of things oriented network slicing and path selection optimization method according to any one of claims 2 to 6, characterized in that: the controller adopts an SDN controller, the SDN controller allocates lower-layer spectrum resources, one part of a transmission frequency band is divided into special frequency bands of specific services, and the special frequency bands are only used for the specific services to carry out data transmission.
8. A power internet of things oriented network slicing and routing optimization system for performing the method of any one of claims 1-7, characterized by: information transmission between a sending terminal and a receiving terminal is realized by a plurality of 5G micro base stations and Software Defined Network (SDN) controller services, bandwidth resources are allocated according to the service requirements of the power Internet of things, and a service-oriented network slice is constructed.
CN202011481778.0A 2020-12-15 2020-12-15 Network slicing and path selection optimization method and system for power internet of things Active CN112637066B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011481778.0A CN112637066B (en) 2020-12-15 2020-12-15 Network slicing and path selection optimization method and system for power internet of things

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011481778.0A CN112637066B (en) 2020-12-15 2020-12-15 Network slicing and path selection optimization method and system for power internet of things

Publications (2)

Publication Number Publication Date
CN112637066A CN112637066A (en) 2021-04-09
CN112637066B true CN112637066B (en) 2023-01-24

Family

ID=75313552

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011481778.0A Active CN112637066B (en) 2020-12-15 2020-12-15 Network slicing and path selection optimization method and system for power internet of things

Country Status (1)

Country Link
CN (1) CN112637066B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113055887B (en) * 2021-05-18 2022-09-27 全球能源互联网研究院有限公司 Network channel safety protection system for electric power 5G application

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017000719A1 (en) * 2015-06-30 2017-01-05 中兴通讯股份有限公司 Congestion control method and device based on queue delay

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9699116B2 (en) * 2015-01-26 2017-07-04 Telefonaktiebolaget L M Ericsson (Publ) SDN based interdomain and intradomain traffic engineering
US10091093B2 (en) * 2016-06-30 2018-10-02 Futurewei Technologies, Inc. Multi-controller control traffic balancing in software defined networks
US20200267051A1 (en) * 2017-10-06 2020-08-20 Telefonaktiebolaget Lm Ericsson (Publ) Remotely controlling network slices in a network
CN108206790B (en) * 2018-01-11 2021-03-16 重庆邮电大学 SDN joint routing selection and resource allocation method based on network slice
CN109818865B (en) * 2019-03-11 2020-09-18 江苏君英天达人工智能研究院有限公司 SDN enhanced path boxing device and method

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017000719A1 (en) * 2015-06-30 2017-01-05 中兴通讯股份有限公司 Congestion control method and device based on queue delay

Also Published As

Publication number Publication date
CN112637066A (en) 2021-04-09

Similar Documents

Publication Publication Date Title
CN109413724B (en) MEC-based task unloading and resource allocation scheme
US8942757B2 (en) Device and method for base stations dynamic clustering in mobile communication
US8412206B2 (en) Communication system having network access structure
CN102160445B (en) Architecture to support network-wide multiple-in-multiple-out wireless communication over downlink
CN104737609A (en) System and method for radio access virtualization
CN106789744B (en) High throughput resource scheduling method with time delay perception based on fusion network virtualization
Ebrahimzadeh et al. Cooperative computation offloading in FiWi enhanced 4G HetNets using self-organizing MEC
CN114363984B (en) Cloud edge collaborative optical carrier network spectrum resource allocation method and system
Dawaliby et al. Network slicing optimization in large scale lora wide area networks
CN114124792A (en) Multi-path concurrent transmission dynamic decision method and device for hybrid dual-mode heterogeneous power distribution field area network
CN104412647B (en) The method for being used to help solve the cluster optimization of the border issue in communication system
Nakayama et al. Adaptive C-RAN architecture with moving nodes toward beyond the 5G era
CN112637066B (en) Network slicing and path selection optimization method and system for power internet of things
CN112867088B (en) Dynamic adjustment method and system for cloud-edge-end communication architecture
Ruoxi et al. Industrial 5G private network: architectures, resource management, challenges, and future directions
WO2020156397A1 (en) Spectrum management device, electronic device, radio communication method, and storage medium
WO2022038760A1 (en) Device, method, and program for predicting communication quality
CN116155366B (en) High-flux satellite system route addressing method based on software defined network
Stan et al. 5G radio resource allocation for communication and computation offloading
CN112690014A (en) Cellular telecommunications network
KR20230024229A (en) Control of multi-user multiple input multiple output connections
Shan et al. Relieving hotspots in data center networks with wireless neighborways
Fan et al. MASCOT: Mobility-Aware Service Function Chain Routing in Mobile Edge Computing
Meer et al. Mobility Management for Cellular-Connected UAVs: Model Based Versus Learning Based Approaches for Service Availability
Zhang et al. Analysis of Mobile Communication Network Architecture Based on SDN

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
GR01 Patent grant
GR01 Patent grant