CN104283792B - WInternet pipelined communication protocols routing algorithms based on content - Google Patents
WInternet pipelined communication protocols routing algorithms based on content Download PDFInfo
- Publication number
- CN104283792B CN104283792B CN201410489962.8A CN201410489962A CN104283792B CN 104283792 B CN104283792 B CN 104283792B CN 201410489962 A CN201410489962 A CN 201410489962A CN 104283792 B CN104283792 B CN 104283792B
- Authority
- CN
- China
- Prior art keywords
- filter
- node
- winternet
- tree
- message
- 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
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
Abstract
The present invention relates to the routing algorithm of Internet of Things communication protocol.A kind of WInternet pipelined communication protocols routing algorithms based on content, characterized in that, according to the covering relation between message content and subscription condition, relying on message distribution tree to route dispatch messages, and be capable of being dynamically added and exiting for supporting node, and failure node processing.Method is：1) a kind of filter model of multilevel index structure is set up, to judge 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 is added and exits WInternet networks, and during processing failure node, message distribution tree is adjusted, reconstruct is route.As whole WInternet general transmission protocol, the present invention makes the agreement have real-time, privacy, high efficiency to data transfer, and realizes the load balancing of whole WInternet networks.
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, the attention of height, many Internet of Things Demonstration Application quilts have also been obtained in every field
Propose and build, also achieve certain achievement.But meanwhile, we are it can also be seen that the development of current Internet of Things has and interconnected
The characteristics of electric network before net is similar, particularly " Vertical collection " and " specialized protocol ".Current many Internet of things system be for
The particular demands for solving a certain field or region are built, independent each other." thing-machine " connected " thing net " develops into phase
Even " the open big net " of numerous " thing nets " should be the development trend of Internet of Things, based on this trend and demand, present inventor
Have been presented for a double-layer network framework, be named as WInternet.WInternet design is with horizontal connector, general association
View, double-decker is basic ideas, and by bottom of Internet there is provided support communication service, Internet of Things is built on internet
Service layer provides general communication, calculating and safety guarantee service towards the application of all kinds of Internet of Things.
WInternet agreement mainly includes 3 parts：Pipelined communication protocols, netware calculate agreement, name and search association
View.Pipelined communication protocols are run on the ICP/IP protocol stack of internet, rely on TCP/IP to provide network communicating function.Currently
Pipelined communication protocols routing forwarding mechanism is not provided, may result in unnecessary message screening, engine load is unbalanced etc.
Problem.As whole WInternet general transmission protocol, the agreement is to data transfer real-time, privacy, high efficiency, with
And realize and propose very high requirement in terms of the load balancing of whole WInternet networks.Therefore an efficient pipeline leads to
Letter agreement has to solve problem above.
The content of the invention
The technical problems to be solved by the invention are：For WInternet normal data models, a kind of filter mould is set up
Type judges the covering relation between filter.According to the covering relation between InGate subscription condition, message distribution is built
Tree.Consider the dynamic change of WInternet networks, routing algorithm will solve distribution when being dynamically added and exiting of engine node
The reconstruction of tree, and to handle the failure node in tree network.
To solve above technical problem, the present invention is adopted the following technical scheme that：
A kind of WInternet pipelined communication protocols routing algorithms based on content, it is characterised in that according to message content and
Covering relation between subscription condition, relies on message distribution tree to route dispatch messages, and is capable of the dynamic of supporting node and add
Enter and exit, and failure node processing, this method comprises the following steps：
(1) standard data format of WInternet pipelines is directed to, a kind of filter mould based on multilevel index structure is set up
Type.The model is divided into Object, Measurement, Operator, Parameter level Four index, and it is judges between filter
Covering relation provide theoretical foundation.
(2) complex filter is decomposed into attribute filter, attribute filter is judged using multilevel index structure model
Between relation, and then judge the relation between complex filter.In the model, by comparing in fourth stage index block
Value, to judge the relation between two attribute filters.
(3) the InGate collaborations for subscribing to same OutGate are got up, according to the covering relation between subscription condition, is
Each OutGate sets up a tree of subscriptions and a routing table using filter keyword as node.The father node generation of tree of subscriptions
The filter of table covers the filter representated by its child nodes.A route table items one filter of correspondence of routing table, its
Next-hop is the set of the engine node reached by the message after the filter.
(4) it is that each OutGate sets up a virtual message distribution tree according to tree of subscriptions and routing table.Distribution tree with
Engine is node, has a filter per paths, message is distributed from top to bottom along this distribution tree, only content with
The message of filter matching gets to its subsequent node, so as to reduce unnecessary message screening and forwarding.
(5) dynamic change of WInternet networks is considered, when new engine node adds or exited distribution tree, Yi Jifen
When sending out some node failure of tree, we will find father node for impacted node, to be added in tree network, and again
Structure is route.
The innovative point of the present invention is embodied in：
1) to judge 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, tree of subscriptions and routing table are built, and then build for WInternet networks
Vertical virtual message distribution tree.
3) dynamic change of WInternet networks is considered, the routing algorithm supports being dynamically added and exiting for engine node,
And support the processing of failure node.
As whole WInternet general transmission protocol, the present invention makes the agreement have real-time to data transfer, hidden
Private, high efficiency, and realize the load balancing of whole WInternet networks.
Brief description of the drawings
Fig. 1 is WInternet nodes, 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.
Several situations when Fig. 5 nodes add WInternet networks discuss schematic diagram.
Embodiment
Technical solution of the present invention is described further below in conjunction with accompanying drawing.
Principle：The present invention proposes a kind of WInternet pipelined communication protocols routing algorithms based on content, and it is according to subscription
Covering relation between condition, sets up tree of subscriptions and routing table, and then build virtual message distribution tree.Consider WInternet
The dynamic change of network, it on the premise of accurate route is ensured, supports engine node according to the connection situation of physical layer network
Be dynamically added and exit, and failure node processing.
Fig. 1 is WInternet nodes, engine, netware, pipeline and valve port relation schematic diagram.WInternet is one by saving
One or more WInternet engines (WInternet Engine) are run on the network of point (Node) composition, a node,
Multiple netware (Netlet) can be registered on engine, netware there are multiple input/output valve ports (InGate/OutGate).Pipeline
(Pipe) it is that the output valve port and another netware of one netware of connection input the one-way logical channel of valve port.
Fig. 2 is the filter model figure based on multilevel index structure.In WInternet, the filtering of message is to be based on XML
Realize.Assuming that having three filter Fs 1, F2, F3, their corresponding XML codings are as shown in Figure 2.According to XML format file
These three filters are expressed as a kind of multilevel index structure by feature.First order index is Object (obj), and the second level is
Measurement (mea), corresponds to the Object and Measurement in WInternet normal data models respectively.The third level
It is Operator, i.e. operator in filter, fourth stage index represents parameter value.Each parameter value points to some filters,
The index of same filter is pointed to after AND operation, it is possible to represent the filter.Judge the pass between two filters
System, only need to compare fourth stage index block intermediate value.For example, to judge the relation between F1 and F2,65 and 68 only need to be compared, because
It is equal for their symbol values.
Three filters in Fig. 2 are complex filter (filters for relying on multiple attributes).Each complex filter
Can be broken into several attribute filters (filter for relying only on an attribute), each attribute filter respectively with addition
The corresponding attribute filter of one complex filter compares, if they, which are all corresponded to, has covering relation, two were combined
There is also covering relation for filter.
Fig. 3 is an example of tree of subscriptions.Each subscription condition that InGate is sent, is considered a filtering
Device.According to the covering relation between filter, we are that each OutGate constructs one using filter keyword as node
Tree of subscriptions, the root node of tree is OutGate ID, and the filter representated by father node (except root node) covers its child nodes
Representative filter.The form on the right is the multilevel index structure information of filter in tree of subscriptions in figure.
Fig. 4 is the abstract model of message distribution tree in routing algorithm.Message distribution tree is subscribed to according to OutGate is corresponding
What tree and routing table were virtually built, reality is simultaneously not present.The message that only content is matched with filter condition is got to thereafter
Continuous node, so as to avoid unnecessary message screening and forwarding.In this distribution tree, each node on behalf WInternet nets
Filter in engine in network, node branch is the engine on the node to safeguard, so that will be in the past all in message
The message screening work that source is carried out is distributed to each and participates in node, efficient balance node load.
When Fig. 5 is that WInternet nodes add network, several situations of message distribution tree are reconstructed.As shown in Fig. 5 (a), newly
The corresponding filter of node 4 of addition and 0.0 in tree of subscriptions identical, and node 4 can also connect with its possible father node 0
It is logical, then just the node is added in the next-hop set of corresponding filter (0.0).As shown in Fig. 5 (b), newly add
The insertion position of node 3 is leaf node.Probe node set { 1,2 } upward first, sends HELLO message to node 1 and 2,
The response message (HA) of which node is first received, that node is just selected as the father node of node 3.If can not all connect,
Probe node 0 is then continued up, is that new node finds father node with such a strategy for seeking father step by step.Fig. 5 (c) and (a) class
Seemingly, the filter of node 5 and 0.1 identical, but 5 can not connect with 1, then father's section is just found in 1 brotgher of node { 2,3 }
Point, if also can not find, just probe node 0 again.In Fig. 5 (d), the insertion position of the node 4 newly added is non-leaf nodes, is led
Cause original tree network to be divided, be 4 searching father nodes first with same strategy.Because node 3 is divided, it is necessary to be it
Father node is found again since node 4.It is similar with adding networking, exitted network in node, and during processing failure node, it is main
It is also to find father node for impacted node to want process.Such method is used, the routing algorithm can be with the dynamic of supporting node
Add and exit, and support the processing to failure node.
In summary, whole implementation process is summarised as：
1) a kind of filter model of multilevel index structure is set up, to judge 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 is added and exits WInternet networks, and during processing failure node, message distribution tree is adjusted, weighed
Structure is route.
Claims (1)
1. a kind of WInternet pipelined communication protocols routing algorithms based on content, it is characterised in that according to message content and order
The covering relation between condition is read, relies on message distribution tree to route dispatch messages, and be capable of being dynamically added for supporting node
With exit, and failure node processing, this method comprises the following steps：
(1) standard data format of WInternet pipelines is directed to, a kind of filter model based on multilevel index structure is set up；
The model is divided into Object, Measurement, Operator, Parameter level Four index, to judge covering between filter
Lid relation provides theoretical foundation；
First order index is Object, and the second level is Measurement, is corresponded to respectively in WInternet normal data models
Object and Measurement；The third level is Operator, i.e. operator in filter, and fourth stage index represents parameter value；
Each parameter value points to some filters, points to the index of same filter after AND operation, it is possible to represent the filtering
Device；
(2) complex filter is decomposed into attribute filter, judged using multilevel index structure model between attribute filter
Relation, and then judge the relation between complex filter；In the model, by comparing the value in fourth stage index block, come
Judge the relation between two attribute filters；
The complex filter refers to the filter for relying on multiple attributes；Each complex filter is decomposed into several attribute mistakes
Filter, the attribute filter refers to the filter for relying only on an attribute, and each attribute filter is multiple with another respectively
The corresponding attribute filter for closing filter compares, if they, which are all corresponded to, has covering relation, two complex filters
There is covering relation；
(3) the InGate collaborations for subscribing to same OutGate are got up, is each according to the covering relation between subscription condition
OutGate sets up a tree of subscriptions and a routing table using filter keyword as node；What the father node of tree of subscriptions was represented
Filter covers the filter representated by its child nodes；A route table items one filter of correspondence of routing table, its is next
Jump is the set of the engine node reached by the message after the filter；
(4) it is that each OutGate sets up a virtual message distribution tree according to tree of subscriptions and routing table；Distribution tree is with engine
For node, there is a filter per paths, message is distributed from top to bottom along this distribution tree, only content and filtering
The message of device matching gets to its subsequent node, so as to reduce unnecessary message screening and forwarding；
(5) dynamic change of WInternet networks is considered, when new engine node adds or exited distribution tree, and distribution tree
Some node failure when, to find father node for impacted node, to be added 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 CN104283792A (en) | 2015-01-14 |
| CN104283792B true 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) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104283792B (en) * | 2014-09-23 | 2017-07-28 | 同济大学 | WInternet pipelined communication protocols routing algorithms based on content |
| CN109120537B (en) * | 2017-06-23 | 2020-10-16 | 迈普通信技术股份有限公司 | Multicast tree calculation method and device |
| 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 (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 (5)
| 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 |
| US8199635B2 (en) * | 2008-08-12 | 2012-06-12 | General Atomics | Method and system for network setup and maintenance and medium access control for a wireless sensor network |
| CN102428687B (en) * | 2009-05-05 | 2015-01-07 | 瑞典爱立信有限公司 | 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 (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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协议改进的物联网路由算法;赵雁航;《全国优秀硕士学位论文》;20140915;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2016045513A1 (en) | 2016-03-31 |
| CN104283792A (en) | 2015-01-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104283792B (en) | WInternet pipelined communication protocols routing algorithms based on content | |
| CN102823205B (en) | Aggregating data traffic from access domains | |
| CN110134833A (en) | Diagram data modeling and method towards power network topology management | |
| CN101426000A (en) | General protocol parsing method and system | |
| CN103036653A (en) | Method of network coding for Open Flow networks | |
| CN106209615B (en) | A kind of Dynamic Route Control method and system calculating forward-path based on SPFA algorithm | |
| CN103179178A (en) | Method and device for expanding member ports of aggregation groups among clusters | |
| CN110249593A (en) | The system and method for configuring the IED process bus network switch according to substation topology specification | |
| CN105654699A (en) | Many-to-many Internet-of -things intelligent gas meter system used for smart city system | |
| CN105159256A (en) | Web service-based intelligent household control system | |
| CN103200102A (en) | Method, device and system for service routing | |
| CN109656688A (en) | A kind of method that realizing distributed service rule, system and server | |
| CN107124365A (en) | A kind of acquisition system of the routing policy based on machine learning | |
| CN102447640B (en) | Method for carrying out aggregate routing in IRF (intelligent resilient framework) system and machine frame switch | |
| CN102685128B (en) | A kind of protocol construction method based on state machine | |
| CN104954439B (en) | A kind of Cloud Server and its node interconnected method, cloud server system | |
| CN104811479B (en) | A kind of creation method based on forwarding with the virtual network node of control separated protocol | |
| Ke | A social networking services system based on the “Six Degrees of Separation” theory and damping factors | |
| CN102045186B (en) | Event analysis method and system | |
| WO2019041944A1 (en) | Method and apparatus for processing packets | |
| Mangler et al. | On the origin of services using riddl for description, evolution and composition of restful services | |
| CN104882007A (en) | Traffic signal control system building method based on stream computing and control system | |
| AU2017100411A4 (en) | Content-based w internet channel communication protocol routing algorithm | |
| CN102685011B (en) | Route computing method in a kind of TRILL network and equipment | |
| CN109286536A (en) | A kind of interface test method and device |
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 |