CN104283792A - W Internet pipeline communication protocol routing algorithm based on content - Google Patents
W Internet pipeline communication protocol routing algorithm based on content Download PDFInfo
- Publication number
- CN104283792A CN104283792A CN201410489962.8A CN201410489962A CN104283792A CN 104283792 A CN104283792 A CN 104283792A CN 201410489962 A CN201410489962 A CN 201410489962A CN 104283792 A CN104283792 A CN 104283792A
- Authority
- CN
- China
- Prior art keywords
- node
- filter
- message
- internet
- tree
- 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
Abstract
The invention relates to Internet-of-Things communication protocol routing algorithms, in particular to a W Internet pipeline communication protocol routing algorithm based on content. The W Internet pipeline communication protocol routing algorithm based on the content is characterized in that messages can be distributed in a routing mode through message distribution trees according to the covering relation between message content and subscription conditions, dynamic joining and exiting of nodes can be achieved, and failure nodes can be processed. The method includes the steps that (1) a filter model of a multilevel index structure is established, and a fundamental basis is provided for judging the covering relation; (2) subscription trees are established according to the covering relation between the subscription conditions; (3) virtual message distribution trees are established according to the subscription trees and routing tables; (4) messages are distributed along the message distribution trees from top to bottom; (5) when nodes join and exit out of the W Internet and the failures nodes are processed, the message distribution trees are adjusted, and a route is reconstructed. Serving as a common transport protocol of the entire W Internet, the W Internet pipeline communication protocol routing algorithm based on the content enables the protocol to have real-time performance, privacy and high efficiency on data transmission, and load balancing of the entire W Internet is realized.
Description
Technical field
The present invention relates to the routing algorithm of Internet of Things communication protocol.
Background technology
After technology of Internet of things occurs, have also been obtained the attention of height in every field, many Internet of Things Demonstration Application are suggested and build, and also achieve certain achievement.But meanwhile, we also can see the development of current Internet of Things have with the Internet before the similar feature, particularly " Vertical collection " of electric network and " specialized protocol ".Current many Internet of things system are that the particular demands for solving a certain field or region is built, independent each other." open large net " that " thing-machine " connected " thing net " develops into connected numerous " thing net " should be the development trend of Internet of Things, and based on this trend and demand, the present application people have proposed a double-layer network framework, called after WInternet.The design of WInternet is with horizontal connector, puppy parc, double-decker is basic ideas, take Internet as bottom, provide support communication service, construction connection service layer provides general communication, calculating and safety guarantee service towards the application of all kinds of Internet of Things on internet.
The agreement of WInternet mainly comprises 3 parts: pipelined communication protocols, netware calculate agreement, name and search protocol.Pipelined communication protocols runs on the ICP/IP protocol stack of the Internet, relies on TCP/IP to provide network communicating function.Current pipelined communication protocols does not provide routing forwarding mechanism, may cause unnecessary message screening, the problems such as engine load is unbalanced.As the general transmission protocol of whole WInternet, this agreement to transfer of data real-time, privacy, high efficiency, and the aspect such as the load balancing realizing whole WInternet network proposes very high requirement.Therefore an efficient pipelined communication protocols must overcome the above problems.
Summary of the invention
Technical problem to be solved by this invention is: for WInternet normal data model, sets up a kind of filter model to judge the covering relation between filter.According to the covering relation between the subscription condition of InGate, build message distribution tree.Consider the dynamic change of WInternet network, the reconstruction of distribution tree when routing algorithm will solve dynamically adding and exiting of engine node, and the failure node in tree network will be processed.
For solving above technical problem, the present invention adopts following technical scheme:
A kind of content-based WInternet pipelined communication protocols routing algorithm, it is characterized in that according to the covering relation between message content and subscription condition, message distribution tree is relied on to carry out route dispatch messages, and can dynamically the adding and exit of support node, and the process of failure node, the method comprises the steps:
(1) for the standard data format of WInternet pipeline, a kind of filter model based on multilevel index structure is set up.This model is divided into Object, Measurement, Operator, Parameter level Four index, and it is judge that the covering relation between filter provides theoretical foundation.
(2) complex filter is decomposed into attribute filter, utilizes multilevel index structure model to judge the relation between attribute filter, and then judge the relation between complex filter.In the model, by comparing the value in fourth stage index block, the relation between two attribute filters is judged.
(3) work in coordination with subscribing to the InGate of same OutGate, according to the covering relation between subscription condition, for each OutGate sets up one with filter keyword be node tree of subscriptions and a routing table.The filter of the father node representative of tree of subscriptions covers the filter representated by its child nodes.The corresponding filter of route table items of routing table, its down hop be by this filter after the set of engine node that arrives of message.
(4) according to tree of subscriptions and routing table, for each OutGate sets up a virtual message distribution tree.Distribution tree take engine as node, and every paths has a filter, and message, along this distribution tree, is distributed from top to bottom, only meaningfully could arrive its subsequent node with the message of filter matching, thus reduces unnecessary message screening and forwarding.
(5) consider the dynamic change of WInternet network, when new engine node adds or exits distribution tree, and during certain node failure of distribution tree, we will be affected node searching father node, to join in tree network, and reconstruct route.
Innovative point of the present invention is embodied in:
1) for judging the covering relation between filter, a kind of filter model based on multilevel index structure is established.
2) according to the covering relation between subscription condition, build tree of subscriptions and routing table, and then set up virtual message distribution for WInternet network and set.
3) consider the dynamic change of WInternet network, this routing algorithm supports dynamically adding and exiting of engine node, and supports the process of failure node.
As the general transmission protocol of whole WInternet, the present invention makes this agreement have real-time to transfer of data, privacy, high efficiency, and realizes the load balancing of whole WInternet network.
Accompanying drawing explanation
Fig. 1 is WInternet node, engine, netware, pipeline and valve port relation schematic diagram.
Fig. 2 is the filter model based on multilevel index structure.
Fig. 3 is the example of a tree of subscriptions.
Fig. 4 is message distribution tree abstract model.
Fig. 5 node adds several situations discussion schematic diagrames during WInternet network.
Embodiment
Below in conjunction with accompanying drawing, technical solution of the present invention is described further.
Principle: the present invention proposes a kind of content-based WInternet pipelined communication protocols routing algorithm, and it sets up tree of subscriptions and routing table according to the covering relation between subscription condition, and then build virtual message distribution tree.Consider the dynamic change of WInternet network, it is according to the connection situation of physical layer network, under the prerequisite ensureing accurate route, supports dynamically adding and exiting of engine node, and the process of failure node.
Fig. 1 is WInternet node, engine, netware, pipeline and valve port relation schematic diagram.WInternet is a network be made up of node (Node), a node runs one or more WInternet engine (WInternet Engine), engine can be registered multiple netware (Netlet), and netware has multiple I/O valve port (InGate/OutGate).Pipeline (Pipe) is the output valve port of a connection netware and the one-way logical channel of another one netware input valve port.
Fig. 2 is the filter model figure based on multilevel index structure.In WInternet, the filtration of message realizes based on XML.Suppose there are three filter F 1, F2, F3, the XML coding of their correspondences as shown in Figure 2.According to the feature of XML format file, these three filters are expressed as a kind of multilevel index structure.First order index is Object (obj), and the second level is Measurement (mea), Object and Measurement respectively in corresponding WInternet normal data model.The third level is Operator, the operator namely in filter, and fourth stage index represents parameter value.Each parameter value points to some filters, and the index pointing to same filter, after AND computing, just can represent this filter.Judge the relation between two filters, only need compare fourth stage index block intermediate value.Such as, the relation between F1 and F2 be judged, only need compare 65 and 68, because their symbol value is equal.
Three filters in Fig. 2 are all complex filter (relying on the filter of multiple attribute).Each complex filter can be decomposed into several attribute filters (only relying on the filter of an attribute), each attribute filter compares with the corresponding attribute filter of another one complex filter respectively, if they all correspondence there is covering relation, then also there is covering relation in two complex filters.
Fig. 3 is an example of tree of subscriptions.Each subscription condition that InGate sends, can be considered to a filter.According to the covering relation between filter, we construct for each OutGate the tree of subscriptions that is node with filter keyword, the root node of tree is OutGate ID, and the filter representated by father node (except root node) covers the filter representated by its child nodes.In figure, the form on the right is the multilevel index structure information of tree of subscriptions middle filtrator.
Fig. 4 is the abstract model of message distribution tree in routing algorithm.It is that reality does not exist according to tree of subscriptions corresponding to OutGate and routing table virtual structure that message distribution is set.Only meaningful message of mating with filter condition could arrive its subsequent node, thus avoids unnecessary message screening and forwarding.In this distribution tree, engine in each node on behalf WInternet network, filter in node branch is safeguarded by the engine on this node, thus the message screening work all carried out in message source is in the past distributed to each and participates in node, efficient balance node load.
Fig. 5 is WInternet node when adding network, several situations of reconstructed message distribution tree.As shown in Fig. 5 (a), in the filter of node 4 correspondence newly added and tree of subscriptions 0.0 is identical, and node 4 father node 0 possible with it also can be communicated with, so just this node is added in the down hop set of corresponding filter (0.0).As shown in Fig. 5 (b), the insertion position of the node 3 newly added is leaf nodes.First { 1,2} sends HELLO message to node 1 and 2, first receives the response message (HA) of which node, just select that node as the father node of node 3 in upwards probe node set.If all cannot be communicated with, then continuing upwards probe node 0, is that new node finds father node with a kind of like this strategy seeking father step by step.Fig. 5 (c) and (a) are similar, and the filter of node 5 is identical with 0.1, but 5 cannot be communicated with 1, so just { find father node in 2,3}, if also can not find, with regard to probe node 0 again in the brotgher of node of 1.In Fig. 5 (d), the insertion position of the node 4 newly added is non-leaf nodes, causes original tree network divided, is first 4 searching father nodes with same strategy.Because node 3 is divided, need for it again finds father node from node 4.With add network class seemingly, exit network at node, and during handling failure node, main process is also be that affected node finds father node.By such method, this routing algorithm can dynamically the adding and exit of support node, and support the process to failure node.
In sum, whole realization flow is summarised as:
1) a kind of filter model of multilevel index structure is set up, for judging that covering relation is provided fundamental basis.
2) according to the covering relation between subscription condition, tree of subscriptions is set up.
3) according to tree of subscriptions and routing table, virtual message distribution tree is built.
4) message is distributed from top to bottom along this message distribution tree.
5) when node adds and exit WInternet network, and during handling failure node, adjustment message distribution tree, reconstruct route.
Claims (1)
1. a content-based WInternet pipelined communication protocols routing algorithm, it is characterized in that, according to the covering relation between message content and subscription condition, message distribution tree is relied on to carry out route dispatch messages, and can dynamically the adding and exit of support node, and the process of failure node, the method comprises the steps:
(1) for the standard data format of WInternet pipeline, a kind of filter model based on multilevel index structure is set up; This model is divided into Object, Measurement, Operator, Parameter level Four index, for judging that the covering relation between filter provides theoretical foundation;
(2) complex filter is decomposed into attribute filter, utilizes multilevel index structure model to judge the relation between attribute filter, and then judge the relation between complex filter; In the model, by comparing the value in fourth stage index block, the relation between two attribute filters is judged;
(3) work in coordination with subscribing to the InGate of same OutGate, according to the covering relation between subscription condition, for each OutGate sets up one with filter keyword be node tree of subscriptions and a routing table; The filter of the father node representative of tree of subscriptions covers the filter representated by its child nodes; The corresponding filter of route table items of routing table, its down hop be by this filter after the set of engine node that arrives of message;
(4) according to tree of subscriptions and routing table, for each OutGate sets up a virtual message distribution tree; Distribution tree take engine as node, and every paths has a filter, and message, along this distribution tree, is distributed from top to bottom, only meaningfully could arrive its subsequent node with the message of filter matching, thus reduces unnecessary message screening and forwarding;
(5) consider the dynamic change of WInternet network, when new engine node adds or exits distribution tree, and during certain node failure of distribution tree, be affected node searching father node, to join in tree network, and reconstruct route.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410489962.8A CN104283792B (en) | 2014-09-23 | 2014-09-23 | WInternet pipelined communication protocols routing algorithms based on content |
| PCT/CN2015/089510 WO2016045513A1 (en) | 2014-09-23 | 2015-09-14 | Content-based w internet channel communication protocol routing algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410489962.8A CN104283792B (en) | 2014-09-23 | 2014-09-23 | WInternet pipelined communication protocols routing algorithms based on content |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104283792A true CN104283792A (en) | 2015-01-14 |
| CN104283792B CN104283792B (en) | 2017-07-28 |
Family
ID=52258289
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410489962.8A Active CN104283792B (en) | 2014-09-23 | 2014-09-23 | WInternet pipelined communication protocols routing algorithms based on content |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN104283792B (en) |
| WO (1) | WO2016045513A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016045513A1 (en) * | 2014-09-23 | 2016-03-31 | 同济大学 | Content-based w internet channel communication protocol routing algorithm |
| CN109120537A (en) * | 2017-06-23 | 2019-01-01 | 迈普通信技术股份有限公司 | Multicast tree calculation method and device |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11520880B2 (en) | 2017-11-03 | 2022-12-06 | International Business Machines Corporation | Identifying internet of things network anomalies using group attestation |
| CN114584505B (en) * | 2022-01-25 | 2024-04-09 | 威胜信息技术股份有限公司 | Method for routing communication messages at edge based on publish-subscribe |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100039933A1 (en) * | 2008-08-12 | 2010-02-18 | General Atomics | Method and system for network setup and maintenance and medium access control for a wireless sensor network |
| CN102281558A (en) * | 2011-06-23 | 2011-12-14 | 成都赛康信息技术有限责任公司 | Wireless sensor networking method applied to data transmission of internet of things |
| CN103957162A (en) * | 2014-05-14 | 2014-07-30 | 常熟理工学院 | Routing communication realization method of wireless network |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101309286B (en) * | 2007-05-17 | 2012-07-04 | 华为技术有限公司 | Forced node exit method and application layer multicast system |
| WO2010128905A1 (en) * | 2009-05-05 | 2010-11-11 | Telefonaktiebolaget L M Ericsson (Publ) | P2p for mobile providers |
| CN103974202A (en) * | 2014-05-28 | 2014-08-06 | 苏州鸣伦电子科技有限公司 | Multicast-tree-based code dispatching method for power demand side acquisition node |
| CN104283792B (en) * | 2014-09-23 | 2017-07-28 | 同济大学 | WInternet pipelined communication protocols routing algorithms based on content |
-
2014
- 2014-09-23 CN CN201410489962.8A patent/CN104283792B/en active Active
-
2015
- 2015-09-14 WO PCT/CN2015/089510 patent/WO2016045513A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100039933A1 (en) * | 2008-08-12 | 2010-02-18 | General Atomics | Method and system for network setup and maintenance and medium access control for a wireless sensor network |
| CN102281558A (en) * | 2011-06-23 | 2011-12-14 | 成都赛康信息技术有限责任公司 | Wireless sensor networking method applied to data transmission of internet of things |
| CN103957162A (en) * | 2014-05-14 | 2014-07-30 | 常熟理工学院 | Routing communication realization method of wireless network |
Non-Patent Citations (1)
| Title |
|---|
| 赵雁航: "一种基于LEACH协议改进的物联网路由算法", 《全国优秀硕士学位论文》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016045513A1 (en) * | 2014-09-23 | 2016-03-31 | 同济大学 | Content-based w internet channel communication protocol routing algorithm |
| CN109120537A (en) * | 2017-06-23 | 2019-01-01 | 迈普通信技术股份有限公司 | Multicast tree calculation method and device |
| CN109120537B (en) * | 2017-06-23 | 2020-10-16 | 迈普通信技术股份有限公司 | Multicast tree calculation method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2016045513A1 (en) | 2016-03-31 |
| CN104283792B (en) | 2017-07-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102823205B (en) | Aggregating data traffic from access domains | |
| CN104283792A (en) | W Internet pipeline communication protocol routing algorithm based on content | |
| CN103036653B (en) | A kind of method of OpenFlow network being carried out to network code | |
| US20140226531A1 (en) | Multicast support for EVPN-SPBM based on the mLDP signaling protocol | |
| CN104639507B (en) | A kind of bearing protocol packet data transmission method and system between heterogeneous network | |
| CN103873363A (en) | Double route configuration method for electric power optical fiber communication net services | |
| CN106209615B (en) | A kind of Dynamic Route Control method and system calculating forward-path based on SPFA algorithm | |
| CN103650433A (en) | Route distributing method, system and controller | |
| CN105654699A (en) | Many-to-many Internet-of -things intelligent gas meter system used for smart city system | |
| CN103780425A (en) | A method and a controller device for configuring a software-defined network | |
| CN107124365A (en) | A kind of acquisition system of the routing policy based on machine learning | |
| CN106059918B (en) | A kind of energy internet-based control layer architecture and dispatching method based on SDN | |
| CN106254244A (en) | A kind of merging stream list item method based on SDN | |
| CN104270384A (en) | Fire wall policy redundancy detection method and device | |
| CN102447640B (en) | Method for carrying out aggregate routing in IRF (intelligent resilient framework) system and machine frame switch | |
| CN111193971A (en) | Machine learning-oriented distributed computing interconnection network system and communication method | |
| CN104301212A (en) | Functional chain combination method | |
| CN113488996A (en) | Power distribution network protogram modeling method based on distributed parallel graph computing framework | |
| CN103067298A (en) | Network flow allocation method and system | |
| CN104954439B (en) | A kind of Cloud Server and its node interconnected method, cloud server system | |
| Mangler et al. | On the origin of services using riddl for description, evolution and composition of restful services | |
| CN110197302B (en) | Power distribution network planning method considering wiring mode topology constraints | |
| CN104219113A (en) | Topological algorithm for displaying and analyzing multicast distribution | |
| CN103746894A (en) | Batch virtual network mapping method based on geographic position constraint | |
| AU2017100411A4 (en) | Content-based w internet channel communication protocol routing algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |