WO2016045513A1 - 基于内容的WInternet管道通信协议路由算法 - Google Patents

基于内容的WInternet管道通信协议路由算法 Download PDF

Info

Publication number
WO2016045513A1
WO2016045513A1 PCT/CN2015/089510 CN2015089510W WO2016045513A1 WO 2016045513 A1 WO2016045513 A1 WO 2016045513A1 CN 2015089510 W CN2015089510 W CN 2015089510W WO 2016045513 A1 WO2016045513 A1 WO 2016045513A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
filter
tree
message
subscription
Prior art date
Application number
PCT/CN2015/089510
Other languages
English (en)
French (fr)
Inventor
蒋昌俊
闫春钢
陈闳中
叶晨
支海邦
Original Assignee
同济大学
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 同济大学 filed Critical 同济大学
Publication of WO2016045513A1 publication Critical patent/WO2016045513A1/zh
Priority to AU2017100411A priority Critical patent/AU2017100411A4/en

Links

Images

Definitions

  • the invention relates to a routing algorithm for an Internet of Things communication protocol.
  • the WInternet protocol mainly consists of three parts: pipeline communication protocol, NETGEAR calculation protocol, naming and search protocol.
  • the pipe communication protocol runs on the TCP/IP protocol stack of the Internet and provides network communication functions based on TCP/IP.
  • the current pipe communication protocol does not provide a route forwarding mechanism, which may cause unnecessary message filtering and engine load imbalance.
  • As a universal transmission protocol of the entire WInternet the protocol puts high demands on the real-time nature of data transmission, privacy, high efficiency, and load balancing of the entire WInternet network. Therefore an efficient pipeline communication protocol must solve the above problems.
  • the technical problem to be solved by the present invention is: for the WInternet standard data model, a filter model is established to determine the coverage relationship between the filters. A message distribution tree is constructed based on the coverage relationship between InGate's subscription conditions. Considering the dynamic change of the WInternet network, the routing algorithm should solve the problem of reconstruction of the distribution tree when the engine node is dynamically added and exited, and deal with the failed nodes in the tree network.
  • the present invention adopts the following technical solutions:
  • a content-based WInternet pipe communication protocol routing algorithm characterized in that according to the coverage relationship between the message content and the subscription condition, the message distribution tree is used to route the distribution message, and the dynamic joining and exiting of the node can be supported, and the failed node is Processing, the method includes the following steps:
  • a subscription tree with a filter keyword as a node and a routing table are established for each OutGate.
  • the parent node of the subscription tree The filter of the table covers the filter represented by its child node.
  • a routing entry of the routing table corresponds to a filter, and the next hop is a collection of engine nodes that arrive through the message after the filter.
  • the distribution tree has an engine as a node, and each path has a filter. Messages are distributed along the distribution tree from top to bottom. Only messages whose content matches the filter can reach their subsequent nodes, thus reducing unnecessary message filtering. And forwarding.
  • the routing algorithm supports the dynamic joining and exiting of the engine nodes, and supports the processing of the failed nodes.
  • the invention makes the protocol real-time, privacy, high efficiency, and load balancing of the entire WInternet network.
  • Figure 1 is a schematic diagram of the relationship between WInternet nodes, engines, network elements, pipes, and valve ports.
  • Figure 2 is a filter model based on a multi-level index structure.
  • Figure 3 is an example of a subscription tree.
  • Figure 4 is an abstract model of the message distribution tree.
  • Figure 5 is a schematic diagram of several situations when nodes join the WInternet network.
  • the present invention proposes a content-based WInternet pipe communication protocol routing algorithm, which establishes a subscription tree and a routing table according to the coverage relationship between subscription conditions, thereby constructing a virtual message distribution tree.
  • a content-based WInternet pipe communication protocol routing algorithm which establishes a subscription tree and a routing table according to the coverage relationship between subscription conditions, thereby constructing a virtual message distribution tree.
  • FIG. 1 is a schematic diagram of the relationship between WInternet nodes, engines, network elements, pipes, and valve ports.
  • WInternet is a network of nodes.
  • One node runs one or more WInternet engines (WInternet Engine).
  • Multiple NETGEARs can be registered on the engine.
  • the NETGEAR has multiple input/output valves. InGate/OutGate.
  • a pipe is a unidirectional logical channel that connects the output port of one net piece to the inlet port of another net piece.
  • FIG. 2 is a filter model diagram based on a multi-level index structure.
  • message filtering is implemented based on XML.
  • XML XML
  • the first level index is Object(obj)
  • the second level is Measurement(mea)
  • the third level is Operator, the operator in the filter, and the fourth level index represents the parameter value.
  • Each parameter value points to a number of filters, and the index pointing to the same filter can be represented by an AND operation.
  • To determine the relationship between two filters simply compare the values in the fourth level index block. For example, to determine the relationship between F1 and F2, simply compare 65 and 68 because their symbol values are equal.
  • the three filters in Figure 2 are composite filters (filters that rely on multiple attributes). Each composite filter can be decomposed into several attribute filters (filters that rely on only one attribute), and each attribute filter is compared with the corresponding attribute filter of another composite filter, if they all have corresponding coverage Relationship, then there are also coverage relationships between the two composite filters.
  • FIG. 3 is an example of a subscription tree.
  • Each subscription condition sent by InGate can be considered a filter.
  • the root node of the tree is the OutGate ID, and the filter coverage represented by the parent node (except the root node).
  • the table on the right in the figure is the multi-level index structure information of the filters in the subscription tree.
  • Figure 4 is an abstract model of a message distribution tree in a routing algorithm.
  • the message distribution tree is dynamically constructed according to the subscription tree and routing table corresponding to OutGate, and does not exist. Only messages whose content matches the filter criteria can reach their subsequent nodes, thus avoiding unnecessary message filtering and forwarding.
  • each node represents an engine in the WInternet network, and the filter on the node branch is maintained by the engine on the node, thereby distributing the message filtering work previously performed at the source of the message to each Participating nodes effectively balance the node load.
  • Figure 5 shows several scenarios for reconstructing a message distribution tree when a WInternet node joins the network.
  • the filter corresponding to the newly added node 4 is identical to the 0.0 in the subscription tree, and the node 4 can also communicate with its possible parent node 0, then the node is added to the corresponding filtering.
  • the next hop set of (0.0) As shown in FIG. 5(b), the insertion position of the newly joined node 3 is a leaf node.
  • the node set ⁇ 1, 2 ⁇ is detected upwards, the HELLO message is sent to nodes 1 and 2, and the response message (HA) of which node is received first, and that node is selected as the parent node of node 3.
  • Figure 5 (c) is similar to (a), the filter of node 5 is equal to 0.1, but 5 and 1 cannot be connected, then the parent node is found in the sibling node ⁇ 2, 3 ⁇ of 1, if not found yet Then, node 0 is detected again.
  • the newly inserted node 4 is inserted into the non-leaf node, causing the original tree network to be split.
  • the same policy is used to find the parent node. Since node 3 is split, it needs to re-find the parent node from node 4.
  • the routing algorithm can support the dynamic joining and exiting of nodes and support the processing of failed nodes.
  • the message is distributed from top to bottom along the message distribution tree.

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Computer And Data Communications (AREA)

Abstract

本发明涉及物联网通信协议的路由算法。一种基于内容的WInternet管道通信协议路由算法，其特征在于，根据消息内容和订阅条件之间的覆盖关系，依托消息分发树来路由分发消息，并且能够支持节点的动态加入和退出，以及失效节点的处理。方法为：1）建立一种多级索引结构的过滤器模型，为判断覆盖关系提供理论基础。2）根据订阅条件之间的覆盖关系，建立订阅树。3）根据订阅树和路由表，构建虚拟的消息分发树。4）消息沿着这棵消息分发树自上而下分发。5）当节点加入和退出WInternet网络，以及处理失效节点时，调整消息分发树，重构路由。作为整个WInternet的通用传输协议，本发明使该协议对数据传输具有实时性，隐私性，高效性，以及实现整个WInternet网络的负载均衡。

Description

基于内容的WInternet管道通信协议路由算法 技术领域
本发明涉及物联网通信协议的路由算法。
背景技术
物联网技术出现后，在各个领域也得到了高度的重视，许多的物联网示范应用被提出和建设，也取得了一定的成果。但同时，我们也可以看到当前物联网的发展有着和互联网前的电子网络类似的特点，特别是“垂直集成”和“专用协议”。当前许多物联网系统是为解决某一领域或区域的特定需求搭建，相互之间独立。“物-机”相连的“物网”发展成为相连众多“物网”的“开放大网”应是物联网的发展趋势，基于这个趋势和需求，本申请发明人们已提出了一个双层网络架构，命名为WInternet。WInternet的设计以水平互联，通用协议，双层结构为基本思路，以Internet为底层，提供支撑通信服务，在Internet上构建物联服务层面向各类物联网应用提供通用的通信、计算和安全保障服务。
WInternet的协议主要包括3个部分：管道通信协议、网件计算协议、命名及搜索协议。管道通信协议运行于互联网的TCP/IP协议栈之上，依托TCP/IP提供网络通信功能。当前的管道通信协议未提供路由转发机制，可能会导致不必要的消息过滤，引擎负载不均衡等问题。作为整个WInternet的通用传输协议，该协议对数据传输实时性，隐私性，高效性，以及实现整个WInternet网络的负载均衡等方而提出了很高的要求。因此一个高效的管道通信协议必须要解决以上问题。
发明内容
本发明所要解决的技术问题是：针对WInternet标准数据模型，建立一种过滤器模型来判断过滤器之间的覆盖关系。根据InGate的订阅条件之间的覆盖关系，构建消息分发树。考虑WInternet网络的动态变化，路由算法要解决引擎节点的动态加入和退出时的分发树的重构问题，并且要处理树形网络中的失效节点。
为解决以上技术问题，本发明采用如下的技术方案：
一种基于内容的WInternet管道通信协议路由算法，其特征在于根据消息内容和订阅条件之间的覆盖关系，依托消息分发树来路由分发消息，并且能够支持节点的动态加入和退出，以及失效节点的处理，该方法包括如下步骤：
(1)针对WInternet管道的标准数据格式，建立一种基于多级索引结构的过滤器模型。该模型分为Object，Measurement，Operator，Parameter四级索引，它为判断过滤器之间的覆盖关系提供了理论基础。
(2)将复合过滤器分解为属性过滤器，利用多级索引结构模型来判断属性过滤器之间的关系，进而判断复合过滤器之间的关系。在该模型中，通过比较第四级索引块中的值，来判断两个属性过滤器之间的关系。
(3)将订阅同一个OutGate的InGate协同起来，根据订阅条件之间的覆盖关系，为每个OutGate建立一棵以过滤器关键字为节点的订阅树和一张路由表。订阅树的父节点代 表的过滤器覆盖其孩子节点所代表的过滤器。路由表的一条路由表项对应一个过滤器，其下一跳是通过该过滤器后的消息到达的引擎节点的集合。
(4)根据订阅树和路由表，为每个OutGate建立一棵虚拟的消息分发树。分发树以引擎为节点，每条路径都有一个过滤器，消息沿着这个分发树，自上而下分发，只有内容与过滤器匹配的消息才能到达其后续节点，从而减少不必要的消息过滤和转发。
(5)考虑WInternet网络的动态变化，当新的引擎节点加入或退出分发树，以及分发树的某个节点失效时，我们要为受影响的节点寻找父节点，以加入到树形网络中，并且重构路由。
本发明的创新点体现在：
1)为判断过滤器之间的覆盖关系，建立了一种基于多级索引结构的过滤器模型。
2)根据订阅条件之间的覆盖关系，构建订阅树和路由表，进而为WInternet网络建立虚拟的消息分发树。
3)考虑WInternet网络的动态变化，该路由算法支持引擎节点的动态加入和退出，并且支持失效节点的处理。
作为整个WInternet的通用传输协议，本发明使该协议对数据传输具有实时性，隐私性，高效性，以及实现整个WInternet网络的负载均衡。
附图说明
图1是WInternet节点、引擎、网件、管道及阀口关系示意图。
图2是基于多级索引结构的过滤器模型。
图3是一棵订阅树的例子。
图4是消息分发树抽象模型。
图5节点加入WInternet网络时的几种情况讨论示意图。
具体实施方式
以下结合附图对本发明技术方案作进一步说明。
原理：本发明提出一种基于内容的WInternet管道通信协议路由算法，它根据订阅条件之间的覆盖关系，建立订阅树和路由表，进而构建虚拟的消息分发树。考虑WInternet网络的动态变化，它根据物理层网络的连通状况，在保证准确路由的前提下，支持引擎节点的动态加入和退出，以及失效节点的处理。
图1是WInternet节点、引擎、网件、管道及阀口关系示意图。WInternet是一个由节点(Node)组成的网络，一个节点上运行着一个或多个WInternet引擎(WInternet Engine)，在引擎上可以注册多个网件(Netlet)，网件有多个输入/输出阀口(InGate/OutGate)。管道(Pipe)是连接一个网件的输出阀口和另外一个网件输入阀口的单向逻辑通道。
图2是基于多级索引结构的过滤器模型图。在WInternet中，消息的过滤是基于XML实现的。假设有三个过滤器F1，F2，F3，它们对应的XML编码如图2所示。根据XML格式文件的特点，将这三个过滤器表示成一种多级索引结构。第一级索引是Object(obj)，第二级是Measurement(mea)，分别对应WInternet标准数据模型中的Object和Measurement。 第三级是Operator，即过滤器中的操作符，第四级索引表示参数值。每个参数值指向若干过滤器，指向同一个过滤器的索引经过AND运算后，就可以表示该过滤器。判断两个过滤器之间的关系，只需比较第四级索引块中值。例如，要判断F1和F2之间的关系，只需比较65和68即可，因为它们的symbol值相等。
图2中的三个过滤器均是复合过滤器(依赖多个属性的过滤器)。每个复合过滤器都可以分解为若干个属性过滤器(仅依赖一个属性的过滤器)，每个属性过滤器分别与另外一个复合过滤器的对应的属性过滤器比较，如果它们都对应存在覆盖关系，则两个复合过滤器也存在覆盖关系。
图3是订阅树的一个示例。InGate发来的每个订阅条件，可以被认为是一个过滤器。根据过滤器之间的覆盖关系，我们为每个OutGate构建了一棵以过滤器关键字为节点的订阅树，树的根节点是OutGate ID，父节点(除了根节点)所代表的过滤器覆盖其孩子节点所代表的过滤器。图中右边的表格是订阅树中过滤器的多级索引结构信息。
图4是路由算法中消息分发树的抽象模型。消息分发树是根据OutGate对应的订阅树和路由表虚拟构建的，实际并不存在。只有内容与过滤器条件匹配的消息才能到达其后续节点，从而避免不必要的消息过滤及转发。在这棵分发树中，每个节点代表WInternet网络中的引擎，节点分支上的过滤器是由该节点上的引擎来维护的，从而将以前全部在消息源端进行的消息过滤工作分散到各个参与节点，有效均衡了节点负载。
图5是WInternet节点加入网络时，重构消息分发树的几种情况。如图5(a)所示，新加入的节点4对应的过滤器与订阅树中的0.0恒等，而且节点4与其可能的父节点0也能连通，那么就将该节点添加到对应的过滤器(0.0)的下一跳集合中。如图5(b)所示，新加入的节点3的插入位置是叶子节点。首先向上探测节点集合{1，2}，发送HELLO消息到节点1和2，先收到哪个节点的应答消息(HA)，就选择那个节点作为节点3的父节点。如果都无法连通，则继续向上探测节点0，用这样一种逐级寻父的策略为新节点寻找父节点。图5(c)与(a)类似，节点5的过滤器与0.1恒等，但是5与1无法连通，那么就在1的兄弟节点{2，3}中寻找父节点，如果还找不到，就再探测节点0。图5(d)中，新加入的节点4的插入位置是非叶子节点，导致原来的树形网络被分割，首先用同样的策略为4寻找父节点。因为节点3被分割，需要为其从节点4开始重新寻找父节点。与加入网路类似，在节点退出网络，以及处理失效节点时，主要过程也是为受影响的节点寻找父节点。用这样的方法，该路由算法可以支持节点的动态加入和退出，并且支持对失效节点的处理。
综上所述，整个实现流程概括为：
1)建立一种多级索引结构的过滤器模型，为判断覆盖关系提供理论基础。
2)根据订阅条件之间的覆盖关系，建立订阅树。
3)根据订阅树和路由表，构建虚拟的消息分发树。
4)消息沿着这棵消息分发树自上而下分发。
5)当节点加入和退出WInternet网络，以及处理失效节点时，调整消息分发树，重构路由。

Claims (1)

  1. 一种基于内容的WInternet管道通信协议路由算法，其特征在于，根据消息内容和订阅条件之间的覆盖关系，依托消息分发树来路由分发消息，并且能够支持节点的动态加入和退出，以及失效节点的处理，该方法包括如下步骤：
    (1)针对WInternet管道的标准数据格式，建立一种基于多级索引结构的过滤器模型；该模型分为Object，Measurement，Operator，Parameter四级索引，为判断过滤器之间的覆盖关系提供了理论基础；
    (2)将复合过滤器分解为属性过滤器，利用多级索引结构模型来判断属性过滤器之间的关系，进而判断复合过滤器之间的关系；在该模型中，通过比较第四级索引块中的值，来判断两个属性过滤器之间的关系；
    (3)将订阅同一个OutGate的InGate协同起来，根据订阅条件之间的覆盖关系，为每个OutGate建立一棵以过滤器关键字为节点的订阅树和一张路由表；订阅树的父节点代表的过滤器覆盖其孩子节点所代表的过滤器；路由表的一条路由表项对应一个过滤器，其下一跳是通过该过滤器后的消息到达的引擎节点的集合；
    (4)根据订阅树和路由表，为每个OutGate建立一棵虚拟的消息分发树；分发树以引擎为节点，每条路径都有一个过滤器，消息沿着这个分发树，自上而下分发，只有内容与过滤器匹配的消息才能到达其后续节点，从而减少不必要的消息过滤和转发；
    (5)考虑WInternet网络的动态变化，当新的引擎节点加入或退出分发树，以及分发树的某个节点失效时，要为受影响的节点寻找父节点，以加入到树形网络中，并且重构路由。
PCT/CN2015/089510 2014-09-23 2015-09-14 基于内容的WInternet管道通信协议路由算法 WO2016045513A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2017100411A AU2017100411A4 (en) 2014-09-23 2017-04-10 Content-based w internet channel communication protocol routing algorithm

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410489962.8 2014-09-23
CN201410489962.8A CN104283792B (zh) 2014-09-23 2014-09-23 基于内容的WInternet管道通信协议路由算法

Related Child Applications (1)

Application Number Title Priority Date Filing Date
AU2017100411A Division AU2017100411A4 (en) 2014-09-23 2017-04-10 Content-based w internet channel communication protocol routing algorithm

Publications (1)

Publication Number Publication Date
WO2016045513A1 true WO2016045513A1 (zh) 2016-03-31

Family

ID=52258289

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/089510 WO2016045513A1 (zh) 2014-09-23 2015-09-14 基于内容的WInternet管道通信协议路由算法

Country Status (2)

Country Link
CN (1) CN104283792B (zh)
WO (1) WO2016045513A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114584505A (zh) * 2022-01-25 2022-06-03 威胜信息技术股份有限公司 一种基于发布订阅的边边通讯消息路由方法
US11520880B2 (en) 2017-11-03 2022-12-06 International Business Machines Corporation Identifying internet of things network anomalies using group attestation

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104283792B (zh) * 2014-09-23 2017-07-28 同济大学 基于内容的WInternet管道通信协议路由算法
CN109120537B (zh) * 2017-06-23 2020-10-16 迈普通信技术股份有限公司 组播树计算方法和装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101309286A (zh) * 2007-05-17 2008-11-19 华为技术有限公司 强制节点退出方法和应用层组播系统
US20120016947A1 (en) * 2009-05-05 2012-01-19 Ayodele Damola P2p for mobile providers
CN103974202A (zh) * 2014-05-28 2014-08-06 苏州鸣伦电子科技有限公司 一种用于电力需求侧采集节点基于多播树的代码分发方法
CN104283792A (zh) * 2014-09-23 2015-01-14 同济大学 基于内容的WInternet管道通信协议路由算法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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
CN102281558B (zh) * 2011-06-23 2013-12-18 北京市电力公司 一种应用于物联网数据传输的无线传感器网络组网方法
CN103957162B (zh) * 2014-05-14 2017-02-15 常熟理工学院 一种无线网络的路由通信实现方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101309286A (zh) * 2007-05-17 2008-11-19 华为技术有限公司 强制节点退出方法和应用层组播系统
US20120016947A1 (en) * 2009-05-05 2012-01-19 Ayodele Damola P2p for mobile providers
CN103974202A (zh) * 2014-05-28 2014-08-06 苏州鸣伦电子科技有限公司 一种用于电力需求侧采集节点基于多播树的代码分发方法
CN104283792A (zh) * 2014-09-23 2015-01-14 同济大学 基于内容的WInternet管道通信协议路由算法

Cited By (3)

* Cited by examiner, † Cited by third party
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
CN114584505A (zh) * 2022-01-25 2022-06-03 威胜信息技术股份有限公司 一种基于发布订阅的边边通讯消息路由方法
CN114584505B (zh) * 2022-01-25 2024-04-09 威胜信息技术股份有限公司 一种基于发布订阅的边边通讯消息路由方法

Also Published As

Publication number Publication date
CN104283792B (zh) 2017-07-28
CN104283792A (zh) 2015-01-14

Similar Documents

Publication Publication Date Title
US10897431B2 (en) Cloud resource processing method and physical node
WO2016045513A1 (zh) 基于内容的WInternet管道通信协议路由算法
Van Renesse et al. Willow: DHT, aggregation, and publish/subscribe in one protocol
US20140226531A1 (en) Multicast support for EVPN-SPBM based on the mLDP signaling protocol
US10601702B1 (en) Flexible packet replication and filtering for multicast/broadcast
WO2018010626A1 (zh) 云端数据组播方法、系统和计算机设备
TW200818811A (en) Inter-proximity communication within a rendezvous federation
CN108718246B (zh) 一种面向网络功能虚拟化的资源调度方法和系统
US20100268808A1 (en) Distributed aggregation on an overlay network
US11411830B2 (en) Systems and methods for determining entry points for mapping a network
WO2015139533A1 (zh) 一种网管对混合组网业务的反算方法
CN107124365A (zh) 一种基于机器学习的路由策略的获取系统
US9705978B1 (en) Dependency graph management
US11165750B1 (en) Flexible services-based pipeline for firewall filter processing
Zhao et al. Research of P2P architecture based on cloud computing
US20120307623A1 (en) Method and Apparatus Providing Selective Flow Redistribution Across Multi Link Trunk/Link Aggregation Group (MLT/LAG) After Port Member Failure and Recovery
WO2012088761A1 (zh) 基于数据分析的安全性信息交互监测系统及方法
US20200119974A1 (en) Spanning tree protocol traffic handling system
WO2015062484A1 (en) Calculating shortest path first tree
CN104994137B (zh) 一种网络透明代理的方法
CN110166295B (zh) 一种用于判断网络拓扑支持拜占庭容错与否的方法
Giroire et al. Maintaining balanced trees for structured distributed streaming systems
US20210135993A1 (en) Pinning bi-directional network traffic to a service device
CN102647363B (zh) 多vlan注册协议报文沿多生成树实例转发的方法和设备
Zhai et al. An improved DDS publish/subscribe automatic discovery algorithm

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15843919

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15843919

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 15843919

Country of ref document: EP

Kind code of ref document: A1

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 17/10/2017)

122 Ep: pct application non-entry in european phase

Ref document number: 15843919

Country of ref document: EP

Kind code of ref document: A1