CN114745326A - End-to-end path calculation method based on block chain - Google Patents
End-to-end path calculation method based on block chain Download PDFInfo
- Publication number
- CN114745326A CN114745326A CN202210285756.XA CN202210285756A CN114745326A CN 114745326 A CN114745326 A CN 114745326A CN 202210285756 A CN202210285756 A CN 202210285756A CN 114745326 A CN114745326 A CN 114745326A
- Authority
- CN
- China
- Prior art keywords
- domain
- domain controller
- node
- host
- array
- 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
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/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- 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/02—Topology update or discovery
-
- 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/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- 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
-
- 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/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
- H04L45/7453—Address table lookup; Address filtering using hashing
-
- 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
Abstract
The invention provides an end-to-end path calculation method based on a block chain, which comprises the steps that (1) a host address generates a random number through an unbiased hash function and stores the random number in a block chain array; (2) the single domain controller detects whether the target host is in the single domain, if the target host is directly forwarded, if the target host is not in the single domain, the step (3) is carried out; (3) and constructing a multi-domain topological structure, and calculating the shortest path from the starting node to the destination host node by using a designed shortest path algorithm. In the invention, by combining the block chain technology, the single-domain controller also serves as a block chain node, only data needs to be written to the block chain, and the redundant controller serves as a light node, and only information needs to be sent to the single-domain controller, so that the controller load is reduced compared with the traditional method; the shortest path algorithm is used for calculating the path with higher efficiency, and the forwarding efficiency of the SDN is improved.
Description
Technical Field
The invention belongs to the field of block chain path calculation, and particularly relates to an end-to-end path calculation method based on a block chain.
Background
The rapid development of information technology and the continuous change of user requirements not only bring new requirements and challenges to the communication network, but also put higher requirements on the equipment capacity and the management complexity of the communication network, and the communication network needs to further simplify operation and maintenance, mine network potential and provide rapid and flexible service support capacity.
The SDN is based on the idea that control logic of switching equipment in a network is integrated on one computing device through separation of control and forwarding, and a new idea is brought to improvement of network management configuration capacity. The essential features of SDN are the separation of control and data planes and open programmability. By separating the control plane and the data plane and the open communication protocol, the closure of the traditional network equipment is broken. The control layer function of the SDN is provided by a controller, for a complex network, the SDN needs to divide the network into domains to form a multi-domain network, and each domain network is controlled by a separate controller; for the whole network, the management is carried out by a multi-domain controller.
In an SDN (software defined network) architecture, information interaction among single-domain controllers has a safety problem, traditional centralized authentication is easily subjected to a single-point attack problem, and the interaction power consumption among a plurality of single-domain controller nodes is large; in addition, the creation of the service between the single domain controllers is initiated to the controllers by the APP through the northbound interface, after the path calculation of the service is completed, the controller performs label distribution, and then issues the flow table to each switch in the path through protocols such as openflow and the like, so that the quality and the speed of the path calculation result play a decisive role in the success and the quality of the service. Moreover, the traditional multi-domain controller has the problem of privacy disclosure when calculating the path, and once the number of single domains is too large, the problem of overlarge occupied memory exists. Therefore, in a multi-domain network, the calculation of the optimal cross-domain path by the multi-domain controller is also a key technical problem of the SDN.
Disclosure of Invention
The purpose of the invention is as follows: aiming at the problem of path calculation of inter-domain communication of multiple controllers in the current SDN network, an end-to-end path calculation method based on a block chain is provided to solve the technical problem.
The technical scheme is as follows: the invention provides an end-to-end path calculation method based on a block chain, which comprises the following steps:
(1) the single domain controller obtains the IP address of the host in the domain; each single domain controller generates k random numbers by each host IP address in the domain through k unbiased hash functions, the k random numbers are sent to the multi-domain controller, an all-zero array v with the length of m is stored on a block chain, the k random numbers correspond to array subscripts of the all-zero array, 0 of the array corresponding to the position of the subscript is changed into 1, the host IP addresses are regarded as being stored in the array, and the operation of each host IP is the same;
(2) the single domain controller sends a packet, the packet comprises pre-sending content and a sending destination host address, the single domain controller searches whether the destination address is in the local domain, and if so, the single domain controller directly forwards the packet to the destination host; if not, the single domain controller generates k random numbers h1, h2 … hk from the destination host address through k unbiased hash functions and sends the k random numbers h1, h2 … hk to the multi-domain controller;
(3) k random numbers h1, h2 … hk correspond to the position of the array V, the multi-domain controller inquires whether the corresponding position of the array V on the chain is 1 or not according to the k random numbers, if so, a destination host for forwarding the data packet is in a multi-domain, the multi-domain controller issues destination host information and a multi-domain topological structure to the single-domain controller where the host for sending the packet is located, and if not, the eSSOS is returned;
(4) the single domain controller where the sending packet host is located obtains a multi-domain topological structure, the sending packet host is used as an initial node, and the two arrays S and U are used for recording the vertex of the shortest path and the vertex of the unknown short path, so that the shortest path is found out.
Preferably, the specific method of step (1) is as follows:
(1.1) each single domain controller discovers a structure formed by the single domain controller and the link in the corresponding domain through an LLDP protocol; each single-domain controller respectively constructs a corresponding intra-domain topological structure according to the intra-domain nodes and the link relation between the nodes, and the multi-domain controller constructs an inter-domain topological structure according to the link relation between the single-domain controllers controlled by the multi-domain controller;
(1.2) each intra-domain host sends a host address a to a single-domain controller to form a data set A which is { a1, a2 … an } as a set to be operated, n is the total number of the data set, each element a1 to an in the data set generates k random numbers through k unbiased hash functions, the single-domain controller sends the k random numbers generated by each element to the multi-domain controller, and the multi-domain controller changes the position index position element of the position corresponding to the array stored in the block chain from 0 to 1 according to the random numbers.
Preferably, the specific method of step (4) is as follows:
(4.1) taking a host sending a packet as an initial node D, introducing two arrays S and U, wherein the S is used for recording the distance from the initial node D to the shortest path of other nodes in the topology structure, and the U is used for recording the node which does not calculate the shortest path from the initial node D to other nodes in the topology;
(4.2) initially, only an initial node D exists in the array S, and the path weight assignment of the initial node is 0 and is recorded as D (0); for the neighbor node A which can directly reach the starting node, the path weight is a0 and is marked as A (a 0); meanwhile, the weights of all other node paths which cannot directly reach the starting node D are set as x, and initially, only the starting node D exists in the set S.
(4.3) finding out the adjacent node with the initial node D from the array U, selecting the node B with the minimum path weight, wherein the path weight is B, adding the node B into the array S, and the weight marked by B in S is the sum of the weights of D and B, namely 0+ B. And simultaneously updating the node path weight values adjacent to the node B in the array U.
And 4.4, repeating the operation of 4.3 until all the vertexes are traversed, so that the shortest path from all the nodes to the starting node D can be obtained.
The beneficial effects are that: compared with the prior art, the technical scheme of the invention has the following beneficial technical effects:
the invention discloses an end-to-end path calculation method based on a block chain, which utilizes a block chain technology, a single domain controller also serves as a block chain node and only needs to write data to the block chain, a multi-domain controller serves as a light node and only needs to send information to the single domain controller, and compared with the traditional method, the load of the controller is reduced; the bloom filter is used for searching the destination address, the speed is higher, the privacy is higher, and the bloom filter only needs one binary array, so that the bloom filter occupies less memory compared with the traditional method; blockchain storage replacement controller storage is more private.
Drawings
FIG. 1 is an overall flow diagram of the present invention;
FIG. 2 is a flow chart of path computation of the present invention;
fig. 3 is a diagram of a specific implementation scenario of the technical solution of the present invention.
Detailed Description
The present invention will be described in further detail with reference to examples and drawings, but the present invention is not limited thereto.
As shown in fig. 3, C is a multi-domain controller, C1, C2, C3 are single-domain controllers, and a1 to a13 are hosts.
The method comprises the following steps: single domain controllers C1, C2 and C3 discover nodes and links in respective corresponding domains through an LLDP protocol, C1, C2 and C3 respectively construct corresponding intra-domain topological structures according to the link relations among the nodes and the nodes in the domains, and a multi-domain controller C constructs an inter-domain topological structure according to the link relations among the single domain controllers C1, C2 and C3;
step two: the host addresses A1-A13 send the local addresses to the single domain controllers c1, c2 and c3 to form a data set A { a1, a2 … a13} as a set to be operated, each host address generates k random numbers through k unbiased hash functions, and the random numbers are all-zero array position subscripts stored on the corresponding block chain. The single domain controller sends the random number to the multi-domain controller, and the multi-domain controller changes the corresponding position of the all-zero array stored in the block chain into 1 according to the random number, which is equivalent to storing the host address in the block chain in an array form.
Step three: assuming that a destination host A1 sends a packet to A8, a single-domain controller c1 searches whether a destination address is in the local domain or not, and the search result shows that A8 is not in c1, the single-domain controller c1 sends the address of the host A8 to the multi-domain controller through k unbiased hash functions to generate k random numbers h1, h2 and … hk; the multi-domain controller receives the random numbers h1, h2 and … hk, queries the array V, obtains the array values of the corresponding positions of the random numbers which are all 1, namely the host A8 is in the multi-domain, and obtains the topological structure through the LLDP protocol.
Step four: the shortest path is calculated.
Two arrays S and U are defined, the source node A1 is added into the array S, other nodes are added together with the distance (the nodes adjacent to the source node are nodes with known distance, and the positions of other nodes are temporarily set as x), the distance is written in brackets and added into the array U, namely: s ═ a1(0) },
U＝{A2(1),A3(x),A4(x),A5(x),A6(x),A7(x),A8(x),A9(x),A10(x),A11(x),A12(x),A13(x),C1(3),C2(x),C3(x),C4(x)}；
selecting the shortest distance neighboring node A2, namely S ═ A1(0), A2(1) },
U＝{A3(5),A4(x),A5(x),A6(x),A7(x),A8(x),A9(x),A10(x),A11(x),A12(x),A13(x),C1(3),C2(x),C3(x),C4(x)}；
selecting a shortest distance adjacent node C1, namely S ═ A1(0), A2(1), C1(3) }, U ═ A3(5), A4(x), A5(x), A6(x), A7(x), A8(x), A9(x), A10(x), A11(x), A12(x), A13(x), C2(x), C3(4), C4(x) };
selecting a shortest adjacent node A6, namely S ═ a1(0), a2(1), C1(3), A6(5) }, U ═ A3(5), a4(x), a5(7), a7(7), A8(x), a9(x), a10(x), a11(x), a12(x), a13(x), C2(x), C3(4), C4(x) };
selecting shortest adjacent nodes A7, S ═ A1(0), A2(1), C1(3), A6(5), A7(8) }, U ═ A3(5), A4(x), A5(7),
A7(7),A8(10),A9(x),A10(x),A11(x),A12(x),A13(x),C2(x),C3(4),C4(x)}；
at this time, the shortest distance and path from the A8 host to the source host a1 have been found, namely:
A1-A2-C1-A6-A7-A8。
Claims (3)
1. an end-to-end path computation method based on a block chain is characterized by comprising the following steps:
(1) the single domain controller obtains the IP address of the host in the domain; each single domain controller generates k random numbers by each host IP address in the domain through k unbiased hash functions, the k random numbers are sent to the multi-domain controller, an all-zero array v with the length of m is stored on a block chain, the k random numbers correspond to array subscripts of the all-zero array, 0 of the array corresponding to the position of the subscript is changed into 1, the host IP addresses are regarded as being stored in the array, and the operation of each host IP is the same;
(2) the single domain controller sends a packet, the packet comprises pre-sending content and a sending destination host address, the single domain controller searches whether the destination address is in the local domain, and if so, the single domain controller directly forwards the packet to the destination host; if not, the single domain controller generates k random numbers h1, h2 … hk from the destination host address through k unbiased hash functions and sends the k random numbers h1, h2 … hk to the multi-domain controller;
(3) k random numbers h1, h2 … hk correspond to the position of the array V, the multi-domain controller inquires whether the corresponding position of the array V on the chain is 1 or not according to the k random numbers, if so, a destination host forwarded by the data packet is in a multi-domain, the multi-domain controller issues destination host information and a multi-domain topological structure to the single-domain controller where the host sending the packet is located, and if not, the eSSOS is returned;
(4) the single domain controller where the host sending the packet is located obtains a multi-domain topological structure, the host sending the packet is used as an initial node, and the two arrays S and U are used for recording the vertex of the shortest path and the vertex of the unknown short path, so that the shortest path is found out.
2. The end-to-end path computation method based on block chains according to claim 1, wherein the specific method in step (1) is as follows:
(1.1) each single domain controller discovers a structure formed by the single domain controller and the link in the corresponding domain through an LLDP protocol; each single-domain controller respectively constructs a corresponding intra-domain topological structure according to the intra-domain nodes and the link relation between the nodes, and the multi-domain controller constructs an inter-domain topological structure according to the link relation between the single-domain controllers controlled by the multi-domain controller;
(1.2) each intra-domain host sends a host address a to a single-domain controller to form a data set A which is { a1, a2 … an } as a set to be operated, n is the total number of the data set, each element a1 to an in the data set generates k random numbers through k unbiased hash functions, the single-domain controller sends the k random numbers generated by each element to the multi-domain controller, and the multi-domain controller changes the position subscript position element corresponding to the array stored in the block chain from 0 to 1 according to the random numbers.
3. The method for calculating an end-to-end path based on a block chain as claimed in claim 1, wherein the specific method of step (4) is as follows:
(4.1) taking a host sending a packet as an initial node D, and introducing two arrays S and U, wherein S is used for recording the distance from the initial node D to the shortest paths of other nodes in the topology structure, and U is used for recording the shortest paths from the initial node D to other nodes in the topology;
(4.2) initially, only an initial node D exists in the array S, and the path weight of the initial node is assigned to be 0 and is marked as D (0); for the neighbor node A which can directly reach the starting node, the path weight is a0 and is marked as A (a 0); meanwhile, setting the weights of all other node paths which can not directly reach the initial node D as x;
(4.3) finding out an adjacent node to the initial node D from the array U, selecting a node B with the minimum path weight, adding the node B into the array S, wherein the path weight is B, the weight marked by the node B in the array S is the sum of the weights D and B, namely 0+ B, and updating the path weight value of the node adjacent to the node B in the array U;
and 4.4, repeating the operation of 4.3 until all the vertexes are traversed to obtain the shortest path from all the nodes to the starting node D.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210285756.XA CN114745326B (en) | 2022-03-21 | 2022-03-21 | End-to-end path calculation method based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210285756.XA CN114745326B (en) | 2022-03-21 | 2022-03-21 | End-to-end path calculation method based on block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114745326A true CN114745326A (en) | 2022-07-12 |
| CN114745326B CN114745326B (en) | 2023-07-25 |
Family
ID=82277147
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210285756.XA Active CN114745326B (en) | 2022-03-21 | 2022-03-21 | End-to-end path calculation method based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114745326B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107332768A (en) * | 2017-06-06 | 2017-11-07 | 烽火通信科技股份有限公司 | A kind of cross-domain path calculation method of multiple domain controller |
| CN110535697A (en) * | 2019-08-22 | 2019-12-03 | 杭州趣链科技有限公司 | A kind of method of the cross-domain broadcasting network load of equilibrium block chain |
| US20200374127A1 (en) * | 2019-05-21 | 2020-11-26 | The University Of Akron | Blockchain-powered cloud management system |
| WO2021121596A1 (en) * | 2019-12-19 | 2021-06-24 | Telefonaktiebolaget Lm Ericsson (Publ) | Selecting a path between network resources in a telecommunications network |
| CN113726665A (en) * | 2021-08-27 | 2021-11-30 | 四川启睿克科技有限公司 | Updating method of border gateway route based on block chain |
-
2022
- 2022-03-21 CN CN202210285756.XA patent/CN114745326B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107332768A (en) * | 2017-06-06 | 2017-11-07 | 烽火通信科技股份有限公司 | A kind of cross-domain path calculation method of multiple domain controller |
| US20200374127A1 (en) * | 2019-05-21 | 2020-11-26 | The University Of Akron | Blockchain-powered cloud management system |
| CN110535697A (en) * | 2019-08-22 | 2019-12-03 | 杭州趣链科技有限公司 | A kind of method of the cross-domain broadcasting network load of equilibrium block chain |
| WO2021121596A1 (en) * | 2019-12-19 | 2021-06-24 | Telefonaktiebolaget Lm Ericsson (Publ) | Selecting a path between network resources in a telecommunications network |
| CN113726665A (en) * | 2021-08-27 | 2021-11-30 | 四川启睿克科技有限公司 | Updating method of border gateway route based on block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114745326B (en) | 2023-07-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Guo et al. | Traffic engineering in SDN/OSPF hybrid network | |
| EP1579716B1 (en) | Routing scheme based on virtual space representation | |
| Baras et al. | A probabilistic emergent routing algorithm for mobile ad hoc networks | |
| JP5551253B2 (en) | Method and apparatus for selecting from multiple equal cost paths | |
| CN104246701B (en) | For the system and method based on source routing routing traffic between different infinite bandwidth subnets | |
| US7334047B1 (en) | Method and system for selective link state advertisement blocking over a data network area | |
| US20060140185A1 (en) | Methods and apparatus for storage and processing of routing information | |
| CN105393511B (en) | A kind of mode switcher switching method, equipment and system | |
| CN101677286B (en) | Optimization method of carrier network | |
| Sharma et al. | Comparison of Dijkstra’s shortest path algorithm with genetic algorithm for static and dynamic routing network | |
| CN110679120B (en) | Communication network node | |
| CN102387068B (en) | Extensible routing method and router of identification network | |
| CN100428736C (en) | Topology method of one-time route computing to realize hierarchical route | |
| CN111147372A (en) | Downlink message sending and forwarding method and device | |
| CN103259720B (en) | A kind of data transmission method and equipment based on MTR | |
| CN109600326A (en) | Data or method, node and the system of message forwarding | |
| CN103457855B (en) | Classless inter-domain routing table is established and the method and apparatus of message forwarding | |
| US10666580B1 (en) | Network switches using centralized improvement of routing based on link capacity | |
| Sawada et al. | Network routing optimization based on machine learning using graph networks robust against topology change | |
| CN111865789B (en) | SR path constraint method based on segment routing | |
| CN114745326B (en) | End-to-end path calculation method based on block chain | |
| Avallone et al. | A DAG-based forwarding paradigm for large scale software defined networks | |
| Karna et al. | Performance Analysis of Interior Gateway Protocols (IGPs) using GNS-3 | |
| CN111355659B (en) | Data sending method and device, equipment and storage medium | |
| JP2000188608A (en) | Information relay method and system |
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 |