CN112637066A - 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
CN112637066A
CN112637066A CN202011481778.0A CN202011481778A CN112637066A CN 112637066 A CN112637066 A CN 112637066A CN 202011481778 A CN202011481778 A CN 202011481778A CN 112637066 A CN112637066 A CN 112637066A
Authority
CN
China
Prior art keywords
switch
sdn
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.)
Granted
Application number
CN202011481778.0A
Other languages
Chinese (zh)
Other versions
CN112637066B (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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Algebra (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Physics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Pure & Applied Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a power Internet of things-oriented network slicing and path selection optimization method and system, 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 the optimal information transmission path by using the transmission time delay between the base stations as a weight value 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 connection is carried out as required, and a plurality of logic sub-networks which have different characteristics and are mutually isolated are virtualized on the basis of the 5G network, so that various application scenes can be responded. 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). The architecture can support flexible management of the communication network and can realize dynamic data transmission under high bandwidth.
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 coping with various application scenarios. For each network slice, dedicated resources such as network bandwidth, service quality, security and the like can be fully guaranteed. 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 SaNearest SDN switch W1As a transmitting-end switch, record transmitting terminal SaNearest SDN switch W1To each remaining SDN switch W2,W3,…,WNAverage 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 Γ0SDN switch W corresponding to medium selection minimum valuen1As a transit exchange; compute a sender switch W1Warp Wn1The 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 ∈ [1, N ∈ >]，n1∈[1,N]Form an updated weight set
Figure BDA0002836878100000031
Updating the selected switch set to
Figure BDA0002836878100000032
Unselected exchangeThe machine set is
Figure BDA0002836878100000033
Circulating the above iteration process, and in the (l + 1) th iteration process, collecting from the value set ΓlIn 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 switched1Warp 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
Set of unselected switches as
Figure BDA00028368781000000313
When the unselected exchanger set is an empty set, the iteration is terminated to obtain the final weight value
Figure BDA00028368781000000314
According to
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 N SDN switchesi，WjAverage one-way transmission delay between; t is tiFrom controller C to W for P1 instructioniFrom WiIs transmitted to WjThen from WjTotal time of forward transmission to controller C; t is tjFrom controller C to W for P1 instructionjFrom WjIs transmitted to WiThen from WiTotal reverse transmission time to controller C; t is techoiFor SDN switch WiTransmission time with controller C, techojFor SDN switch WjAnd controller C.
Preferably, t isiThe calculation formula is as follows:
Figure BDA0002836878100000041
wherein
Figure BDA0002836878100000042
And
Figure BDA0002836878100000043
respectively, indicating that the P1 instruction is transmitted from C to WiFrom WiIs transmitted to WjAnd from WjTime to transfer to C.
Preferably, t isjThe calculation formula is as follows:
Figure BDA0002836878100000044
wherein
Figure BDA0002836878100000045
And
Figure BDA0002836878100000046
respectively, indicating that the P1 instruction is transmitted from C to WjFrom WjIs transmitted to WiAnd from WjTime to transfer to C.
Preferably, t isechoiThe calculation formula is as follows:
Figure BDA0002836878100000047
preferably, t isechojThe 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 the optimal information transmission path by using the transmission time delay between the base stations as a weight value and adopting a Dijskra algorithm. Through the combination of a network slicing technology and a Dijstra 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 chart of a power internet of things-oriented network slicing and path selection optimization method 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 present invention will be further described with reference to the following examples.
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 selects the optimal information transmission path by using the transmission time delay between the base stations as a weight value and adopting a Dijskra 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 compiles and abstracts lower-layer resources according to the dynamic scheduling of the service types, customizes the network for each client according to the needs and forms a network slice.
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.
A network slice is an end-to-end private logical network. The network slice runs on a common physical or virtual network. The network slices are isolated from each other, have independent control and management, and can be customized as required.
Dividing network slices for the current transmission service and constructing a special network, thus 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 performs unified scheduling on wireless resources of a lower-layer SDN switch, and performs 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 SaAnd a receiving terminal SbWhen the transmission service is needed, SaTransmitting transmission data to and from a terminal S via a CPEaNearest SDN switch W1Under the forwarding of a plurality of base stations, the base station arrives at the switch W nearest to the receiving terminaln. Switch W1After 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 topology discovery is complete, the switches resend the P1 instruction for measuring the transmission between the various switchesAnd (4) time delay. The controller analyzes the time stamp from the P1 instruction and receives the time treceiveAnd the time t of sending out a packetsendAnd subtracting to obtain the transmission time of the data packet. With a switch WiAnd WjFor example, a P1 instruction is transmitted from controller C to WiFrom WiIs transmitted to WjThen from WjTotal time t of forward transmission to CiCan be expressed as
Figure BDA0002836878100000071
Wherein
Figure BDA0002836878100000072
And
Figure BDA0002836878100000073
respectively, indicating that the P1 instruction is transmitted from C to WiFrom WiIs transmitted to WjAnd from WjTime to transfer to C. Similarly, the P1 command is transmitted from controller C to WjFrom WjIs transmitted to WiThen from WiTotal reverse transmission time t to CjCan be expressed as
Figure BDA0002836878100000074
Wherein
Figure BDA0002836878100000075
And
Figure BDA0002836878100000076
respectively, indicating that the P1 instruction is transmitted from C to WjFrom WjIs transmitted to WiAnd from WjTime to transfer to C.
Confirming the time stamp t carried by the instructions Echo Reply and Echo Request according to a pair of states between the controller and the switchreply，trequestComputing switch WiAnd WjRespectively transmitting time t with the controllerechoi、techoj：
Figure BDA0002836878100000081
Figure BDA0002836878100000082
Combining the formulas (1) and (2) can calculate two switches Wi，WjAverage one-way transmission delay between
Figure BDA0002836878100000083
Is composed of
Figure BDA0002836878100000084
Based on (5), each SDN switch W between the sending terminal and the receiving terminal can be calculated1,W2,…,WNAverage 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 intra-slice, the topology of the base station, and the state of each switch, needs to be checked for implementation.
Here, according to the topology structure in which data is detected every 1ms, the state of the topology and the transmission time between base stations are updated. 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 not considered.
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 SaNearest switch W1As a transmitting-end switch, record transmitting terminal SaNearest switch W1To each of the remaining switches W2,W3,…,WNAverage one-way transmission delay of
Figure BDA0002836878100000091
The initial weight value is used as the initial weight value of each exchanger
Figure BDA0002836878100000092
Form an initial set of weights
Figure BDA0002836878100000093
The switch set is recorded as
Figure BDA0002836878100000094
Initial set of selected switches
Figure BDA0002836878100000095
Set of unselected switches as
Figure BDA0002836878100000096
(2) And (3) iterative updating: from a set of values Γ0Switch corresponding to the minimum value of the selected minimum value
Figure BDA0002836878100000097
As a transitSwitches, i.e.
Figure BDA0002836878100000098
Computation transmitting terminal switch W1Warp 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
form updated weight set
Figure BDA00028368781000000911
Updating the selected switch set to
Figure BDA00028368781000000912
Set of unselected switches as
Figure BDA00028368781000000913
Circulating the above iteration process, and in the (l + 1) th iteration process, collecting from the value set ΓlIn 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 using the same method1Warp beam
Figure BDA00028368781000000917
Transmitting information to other partiesAverage one-way transmission time delay and recorded weight of switch
Figure BDA00028368781000000918
The switch weights are updated according to the following criteria.
Figure BDA00028368781000000919
Form updated weight set
Figure BDA00028368781000000920
Updating the selected switch set to
Figure BDA00028368781000000921
Set of unselected switches as
Figure BDA00028368781000000922
The iteration terminates when the set of unselected switches is an empty set. Obtain 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 an Ryu controller. The bandwidth of the switches within the network slice is set to 3M, 5M, and 10M, respectively, in the simulation. The size of the transmitted packets includes 32bytes, 64bytes, 128bytes, 256bytes, and 512 bytes. 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 SaNearest SDN switch W1As a transmitting-end switch, record transmitting terminal SaNearest SDN switch W1To each remaining SDN switch W2,W3,…,WNAverage one-way transmission delay of
Figure FDA0002836878090000011
As initial weight of each switch
Figure FDA0002836878090000012
Form an initial set of weights
Figure FDA0002836878090000013
Let SDN switch set be Λ ═ W ═1,W2,…,WNV, initial set of selected switches Λ0＝{W1Is collected as unselected switches
Figure FDA0002836878090000014
From a set of values Γ0SDN switch corresponding to medium selection minimum value
Figure FDA0002836878090000015
As a transit exchange; compute a sender switch W1Warp beam
Figure FDA0002836878090000016
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 FDA0002836878090000017
The update criteria are as follows:
Figure FDA0002836878090000018
wherein m is ∈ [1, N ∈ >]，n1∈[1,N]Form an updated weight set
Figure FDA0002836878090000019
Updating the selected switch set to
Figure FDA00028368780900000110
Set of unselected switches as
Figure FDA00028368780900000111
Circulating the above iteration process, and in the (l + 1) th iteration process, collecting from the value set ΓlIn which the weight is selected to be the smallest
Figure FDA00028368780900000112
And belong to a set of unselected switches
Figure FDA00028368780900000113
Switch of
Figure FDA00028368780900000114
By the same method, the transmission terminalEnd switch W1Warp beam
Figure FDA00028368780900000115
Average one-way transmission delay and recorded weight for transmitting information to other exchangers
Figure FDA00028368780900000116
Comparing, updating the weight of each exchanger according to the following criteria, wherein the updated weight is
Figure FDA00028368780900000117
Figure FDA00028368780900000118
Form updated weight set
Figure FDA00028368780900000119
Updating the selected switch set to
Figure FDA0002836878090000021
Set of unselected switches as
Figure FDA0002836878090000022
When the unselected exchanger set is an empty set, the iteration is terminated to obtain the final weight value
Figure FDA0002836878090000023
According to
Figure FDA0002836878090000024
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, wherein the method comprises the following steps: the average one-way transmission delay calculation formula is as follows:
Figure FDA0002836878090000025
wherein the content of the first and second substances,
Figure FDA0002836878090000026
for any two SDN switches W in N SDN switchesi，WjAverage one-way transmission delay between; t is tiFrom controller C to W for P1 instructioniFrom WiIs transmitted to WjThen from WjTotal time of forward transmission to controller C; t is tjFrom controller C to W for P1 instructionjFrom WjIs transmitted to WiThen from WiTotal reverse transmission time to controller C; t is techoiFor SDN switch WiTransmission time with controller C, techojFor SDN switch WjAnd controller C.
3. The power internet of things oriented network slicing and path selection optimization method according to claim 2, characterized in that: said t isiThe calculation formula is as follows:
Figure FDA0002836878090000027
wherein
Figure FDA0002836878090000028
And
Figure FDA0002836878090000029
respectively, indicating that the P1 instruction is transmitted from C to WiFrom WiIs transmitted to WjAnd from WjTime 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 isjThe calculation formula is as follows:
Figure FDA00028368780900000210
wherein
Figure FDA00028368780900000211
And
Figure FDA00028368780900000212
respectively, indicating that the P1 instruction is transmitted from C to WjFrom WjIs transmitted to WiAnd from WjTime to transfer to C.
5. The power internet of things oriented network slicing and path selection optimization method according to claim 3, characterized in that: said t isechoiThe calculation formula is as follows:
Figure FDA0002836878090000031
6. the power Internet of things-oriented network slicing and path selection optimization method according to claim 4, characterized in that: said t isechojThe calculation formula is as follows:
Figure FDA0002836878090000032
7. the power internet of things oriented network slicing and path selection optimization method according to any one of claims 1 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 the sending terminal and the receiving terminal is achieved through the services of the plurality of 5G micro base stations and the SDN controller, bandwidth resources are distributed according to the service requirements of the power Internet of things, and service-oriented network slices are 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 true CN112637066A (en) 2021-04-09
CN112637066B 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)

Cited By (1)

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

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160218917A1 (en) * 2015-01-26 2016-07-28 Telefonaktiebolaget L M Ericsson (Publ) SDN Based Interdomain and Intradomain Traffic Engineering
WO2017000719A1 (en) * 2015-06-30 2017-01-05 中兴通讯股份有限公司 Congestion control method and device based on queue delay
US20180006928A1 (en) * 2016-06-30 2018-01-04 Futurewei Technologies, Inc. Multi-controller control traffic balancing in software defined networks
CN108206790A (en) * 2018-01-11 2018-06-26 重庆邮电大学 A kind of selection of SDN joint routes and resource allocation methods based on network slice
US20200267051A1 (en) * 2017-10-06 2020-08-20 Telefonaktiebolaget Lm Ericsson (Publ) Remotely controlling network slices in a network
WO2020181761A1 (en) * 2019-03-11 2020-09-17 江苏君英天达人工智能研究院有限公司 Sdn enhanced path allocation device and method employing bin-packing technique

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160218917A1 (en) * 2015-01-26 2016-07-28 Telefonaktiebolaget L M Ericsson (Publ) SDN Based Interdomain and Intradomain Traffic Engineering
WO2017000719A1 (en) * 2015-06-30 2017-01-05 中兴通讯股份有限公司 Congestion control method and device based on queue delay
US20180006928A1 (en) * 2016-06-30 2018-01-04 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
CN108206790A (en) * 2018-01-11 2018-06-26 重庆邮电大学 A kind of selection of SDN joint routes and resource allocation methods based on network slice
WO2020181761A1 (en) * 2019-03-11 2020-09-17 江苏君英天达人工智能研究院有限公司 Sdn enhanced path allocation device and method employing bin-packing technique

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
许明元: "5G低时延技术的应用浅析", 《移动通信》 *
陈蕾衣等: "SDN网络性能测量系统设计与实现", 《成都信息工程大学学报》 *

Cited By (1)

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

Also Published As

Publication number Publication date
CN112637066B (en) 2023-01-24

Similar Documents

Publication Publication Date Title
CN104737609A (en) System and method for radio access virtualization
CN104412549B (en) The network entity of communication network
CN105830401A (en) Software-defined network infrastructure having virtual range extenders
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
CN105188149A (en) Method for implementing aeronautical Ad hoc network STDMA (Self Organizing Time Division Multiple Access) protocol based on directional antenna
CN114124792B (en) Multi-path concurrent transmission dynamic decision method and device for hybrid dual-mode heterogeneous power distribution field area network
CN101383772B (en) Method and device for automatically discovering and establishing MAC route information table
CN113765544A (en) Dual-mode heterogeneous field area network multipath concurrent transmission method based on HPLC and RF
CN102244614A (en) Message forwarding method, system and routing switch
Chekired et al. Hierarchical wireless vehicular fog architecture: A case study of scheduling electric vehicle energy demands
CN114503458A (en) System, method and apparatus for managing network resources
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
CN116155366B (en) High-flux satellite system route addressing method based on software defined network
WO2020156397A1 (en) Spectrum management device, electronic device, radio communication method, and storage medium
CN117118886A (en) Message forwarding method, head-end equipment, controller, equipment and storage medium
CN109547345B (en) Software-defined airborne network system and content-driven routing method
WO2023029757A1 (en) Resource estimation method and related device
CN112690014A (en) Cellular telecommunications network
Lavanya et al. Fog computing based radio access network in 5G wireless communications
Raptis et al. On the performance of data distribution methods for wireless industrial networks
Shan et al. Relieving hotspots in data center networks with wireless neighborways
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