WO2016090758A1 - 一种树结构网络自治管理和节点加入方法 - Google Patents

一种树结构网络自治管理和节点加入方法 Download PDF

Info

Publication number
WO2016090758A1
WO2016090758A1 PCT/CN2015/074085 CN2015074085W WO2016090758A1 WO 2016090758 A1 WO2016090758 A1 WO 2016090758A1 CN 2015074085 W CN2015074085 W CN 2015074085W WO 2016090758 A1 WO2016090758 A1 WO 2016090758A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
child
nodes
newly added
dynamic root
Prior art date
Application number
PCT/CN2015/074085
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 中国科学院声学研究所
Priority to EP15867971.2A priority Critical patent/EP3232618B1/en
Priority to AU2015361959A priority patent/AU2015361959B2/en
Publication of WO2016090758A1 publication Critical patent/WO2016090758A1/zh

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/48—Routing tree calculation
    • 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/48—Routing tree calculation
    • H04L45/488—Routing tree calculation using root node determination
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • the invention relates to a computer network technology, in particular to a tree structure network autonomous management and a node joining method.
  • P2P network related technologies provide methods, including unstructured P2P networks, structured P2P networks, and the like.
  • nodes are organized into overlay networks to ensure connectivity and routing between nodes through logical topologies.
  • these methods are generally designed and constructed for an application, such as a streaming media system, and its structure has certain limitations and is difficult to apply to other applications.
  • the object of the present invention is to overcome the shortcomings of the tree structure network autonomous management and the node joining method in the prior art, thereby providing a flexible and convenient method.
  • the present invention provides a tree structure network autonomous management and node joining method, including:
  • the number of route hops between nodes to be added to the node and the tree structure network is measured, and then the nodes to be joined are added to the appropriate positions in the tree network according to the route hop relationship, so that the physical hop relationship and the topology hop count between the nodes are obtained.
  • the relationship remains basically the same.
  • each node in the tree structure network includes: a child node list, a child node number counter, a neighbor node list, and a parent node pointer; the method further includes:
  • Step 2) for any child node p i of the dynamic root node o, calculate the hop count h o,s of the newly added node s and the dynamic root node o, the hop count of the newly added node s and the child node p i And the number of hops of the dynamic root node o and the child node p i in case Taking p i as a child node newly added to the node s, taking the dynamic root node o as the parent node of the newly added node s, and then ending the operation; if no child node p i is satisfied Then proceed to the next step;
  • Step 3 for any child node p i of the dynamic root node o, if the hop count of the newly added node s and the child node p i Greater than the hop count h s,o of the newly added node s and the dynamic root node o, the dynamic root node o is taken as the parent node of the newly added node s, and then the operation ends; otherwise, the next step is performed;
  • Step 4 for any child node p i of the dynamic root node o, if the number of hops of the newly added node and the child node p i The hop count h s,o of the newly added node s and the dynamic root node o , and the child node list of the p i are viewed. If the p i child node list is empty, the node s is directly inserted as the leaf node of the p i and ends. Operation, if the p i child node list is not empty, the child node p i is taken as the new dynamic root node o, and then step 2) is re-executed.
  • step 2) if there are more than one child nodes p i of the condition, all the child nodes p i satisfying the condition are taken as the child nodes of the newly added node s, and the dynamic root node o is taken as the parent node of the newly added node s.
  • the invention provides a flexible node autonomous management method for network services in which large-scale nodes participate, and the joining process tries to reflect the physical positional relationship between nodes as much as possible, and facilitates addressing and searching of nodes.
  • Figure 1 is a flow chart of the method of the present invention
  • FIG. 2 is a schematic diagram of a situation in which a newly joined node is between a root node and a child node;
  • FIG. 3 is a schematic diagram of a case where a newly added node is a root node leaf node
  • Figure 3 shows the case where the newly joined node is the child node of the root node.
  • All nodes in a network can form a tree network.
  • the root node assumes management. Except for the root node, each node has a parent node and possibly multiple child nodes. The same layer in the tree. It is possible for a node to form a neighbor node relationship, that is, a neighbor node refers to another node in the same layer as a node in the tree.
  • Each node that makes up the tree contains the following data structures: a list of child nodes, a counter number of children, a list of neighbor nodes, and a pointer to the parent node.
  • the child node list is used to describe the information of the child nodes contained in the node; the subsection The point counter is used to describe the number of child nodes included in the node; the neighbor node list is used to describe the information of the neighbor nodes contained in the node; the parent node pointer is used to describe the pointer of the parent node of the node.
  • the method of the present invention When adding a new node to the tree network, the method of the present invention firstly measures the number of route hops between the node to be joined and each node in the tree network, and then adds the node to be added to the tree network according to the route hop relationship.
  • the position is such that the relationship between the physical hops of the nodes and the number of hops of the topology remains substantially the same.
  • a new node s is to join a tree network
  • the root node of the tree network is R
  • the joining process of the new node s is as follows:
  • the dynamic root node o is the root node R.
  • Step 2) for any child node p i of the dynamic root node o, calculate the hop count h o,s of the newly added node s and the dynamic root node o, the hop count of the newly added node s and the child node p i And the number of hops of the dynamic root node o and the child node p i in case It is indicated that the newly added node s is between the dynamic root node o and the child node p i .
  • p i is used as a child node of the newly added node s
  • the dynamic root node o is used as the parent node of the newly added node s
  • Step 3 for any child node p i of the dynamic root node o, if the hop count of the newly added node s and the child node p i Greater than the hop count of the newly added node s and the dynamic root node o
  • the dynamic root node o is taken as the parent node of the newly added node s, that is, the newly added node s will be the leaf node of the dynamic root node o, the joining process is completed, and the operation is ended; otherwise, the next step is performed.
  • Step 4 for any child node p i of the dynamic root node o, if the number of hops of the newly added node and the child node p i If the number of hops h s,o of the newly added node s and the dynamic root node o is less, the new joining node s should be in the subtree of the node p i .
  • the child node list of the p i is viewed, if the p i child node list is empty, with reference to FIG.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Computer And Data Communications (AREA)

Abstract

一种树结构网络自治管理和节点加入方法，包括：首先测量待加入节点与树结构网络中各节点间的路由跳数，然后根据路由跳数关系将待加入节点加入到树形网络中的合适位置，使得节点间的物理跳数关系与拓扑跳数关系保持基本一致。为大规模节点参与的网络服务提供一种灵活的节点自治管理方法，其加入过程尽量反映了节点间的物理位置关系，便于节点的寻址和查找。

Description

一种树结构网络自治管理和节点加入方法 技术领域
本发明涉及计算机网络技术，特别涉及一种树结构网络自治管理和节点加入方法。
背景技术
随着计算机和网络的不断发展，互联网中服务需求的增加和处理要求逐渐提高，大规模节点的协同处理和管理在许多系统中都是一个关键问题。网络中，节点的管理结构和拓扑常常呈树形，在大规模节点的情况下，如何高效的对节点进行寻址、定位和加入管理关系到服务的启动效率和处理效率。节点的无序管理，不仅仅增加了查找和定位时间，而且对系统的扩展性、服务性能均有较大影响。
在实际网络中，除了网络中部署的服务节点，还存在大量的、动态的用户节点。当用户节点有服务请求时，由靠近用户节点的服务点响应该请求是提升网络服务性能的重要途径。因此，在大量节点的情况下，如何组织节点，且将请求快速定位到位置较近的服务点是一个重要的问题。
当前，针对网络中节点的自治管理，P2P网络相关技术提供了一些方法，包括无结构P2P网络、有结构P2P网络等。在这些方法中，节点组织成覆盖网结构，通过逻辑拓扑保障节点间的联通和路由。但是，这些方法一般都是针对某项应用，如流媒体系统，进行的设计和构建，其结构具有一定的局限性，难以适用于其他应用。
发明内容
本发明的目的在于克服现有技术中的树结构网络自治管理和节点加入方法所存在的缺陷，从而提供一种灵活、便捷的方法。
为了实现上述目的，本发明提供了一种树结构网络自治管理和节点加入方法，包括：
首先测量待加入节点与树结构网络中各节点间的路由跳数，然后根据路由跳数关系将待加入节点加入到树形网络中的合适位置，使得节点间的物理跳数关系与拓扑跳数关系保持基本一致。
上述技术方案中，所述树结构网络中的各个节点均包括：子节点列表，子节点数计数器，邻居节点列表和父节点指针；该方法进一步包括：
步骤1)、将一节点设为动态根节点o，动态根节点o的子节点列表记为P＝{p1，p2，...，pi，...}；其中，在初始时，动态根节点o为根节点R；
步骤2)、对于动态根节点o的任意子节点pi，计算新加入节点s与动态根节点o 的跳数ho，s、新加入节点s与子节点pi的跳数
Figure PCTCN2015074085-appb-000001
以及动态根节点o与子节点pi的跳数
Figure PCTCN2015074085-appb-000002
如果
Figure PCTCN2015074085-appb-000003
将pi作为新加入节点s的子节点，将动态根节点o作为新加入节点s的父节点，然后结束操作；若没有子节点pi满足
Figure PCTCN2015074085-appb-000004
则执行下一步；
步骤3)、对于动态根节点o的任意子节点pi，如果新加入节点s与子节点pi的跳数
Figure PCTCN2015074085-appb-000005
大于新加入节点s与动态根节点o的跳数hs，o，将动态根节点o作为新加入节点s的父节点，然后结束操作，否则，执行下一步；
步骤4)、对于动态根节点o的任意子节点pi，如果新加入节点与子节点pi的跳数
Figure PCTCN2015074085-appb-000006
小于新加入节点s与动态根节点o的跳数hs，o，查看pi的子节点列表，如果pi子节点列表为空，则将节点s直接作为pi的叶子节点插入其中，结束操作，如果pi子节点列表不为空，将该子节点pi作为新的动态根节点o，然后重新执行步骤2)。
上述技术方案中，在步骤2)中，若满足
Figure PCTCN2015074085-appb-000007
条件的子节点pi的数目多于一个，则将所有满足条件的子节点pi都作为新加入节点s的子节点，并将动态根节点o作为新加入节点s的父节点。
本发明的优点在于：
本发明为大规模节点参与的网络服务提供一种灵活的节点自治管理方法，其加入过程尽量反映了节点间的物理位置关系，便于节点的寻址和查找。
附图说明
图1是本发明方法的流程图；
图2是新加入节点在根节点和子节点之间的情况示意图；
图3是新加入节点为根节点叶子节点的情况示意图；
图3是新加入节点为根节点子代节点的情况。
具体实施方式
现结合附图对本发明作进一步的描述。
一个网络中的所有节点能够形成一个树形网络，在该树形网络中，根节点承担管理作用，除了根节点外，每个节点都有一个父节点和可能有多个子节点，树中同一层节点才有可能构成邻居节点关系，即邻居节点是指与某一节点在树中的同一层中其他节点。组成树的各个节点均包含以下数据结构：子节点列表，子节点数计数器，邻居节点列表和父节点指针。顾名思义，子节点列表用于描述所在节点所包含的子节点的信息；子节 点数计数器用于描述所在节点所包含的子节点的数目；邻居节点列表用于描述所在节点所包含的邻居节点的信息；父节点指针用于描述所在节点的父节点的指针。
本发明的方法在为树形网络加入新节点时，首先测量待加入节点与树形网络中各节点间的路由跳数，然后根据路由跳数关系将待加入节点加入到树形网络中的合适位置，使得节点间的物理跳数关系与拓扑跳数关系保持基本一致。
下面结合附图1对本发明的节点加入方法做详细说明。
若一新节点s要加入一树形网络，该树形网络的根节点为R，新节点s的加入过程如下：
步骤1)、将一节点设为动态根节点o，动态根节点o的子节点列表记为P＝{p1，p2，...，pi，...}；其中，在初始时，动态根节点o为根节点R。
步骤2)、对于动态根节点o的任意子节点pi，计算新加入节点s与动态根节点o的跳数ho，s、新加入节点s与子节点pi的跳数
Figure PCTCN2015074085-appb-000008
以及动态根节点o与子节点pi的跳数
Figure PCTCN2015074085-appb-000009
如果
Figure PCTCN2015074085-appb-000010
说明新加入的节点s处于动态根节点o和子节点pi之间，参考图2，将pi作为新加入节点s的子节点，将动态根节点o作为新加入节点s的父节点；若满足
Figure PCTCN2015074085-appb-000011
条件的子节点pi的数目多余一个，则将所有满足条件的子节点pi都作为新加入节点s的子节点，并将动态根节点o作为新加入节点s的父节点；完成对节点s的加入树形网络后，结束操作；若没有子节点pi满足
Figure PCTCN2015074085-appb-000012
则执行下一步。
步骤3)、对于动态根节点o的任意子节点pi，如果新加入节点s与子节点pi的跳数
Figure PCTCN2015074085-appb-000013
大于新加入节点s与动态根节点o的跳数
Figure PCTCN2015074085-appb-000014
参考图3，将动态根节点o作为新加入节点s的父节点，即新加入节点s将作为动态根节点o的叶子节点，加入过程完成，结束操作，否则，执行下一步。
步骤4)、对于动态根节点o的任意子节点pi，如果新加入节点与子节点pi的跳数
Figure PCTCN2015074085-appb-000015
小于新加入节点s与动态根节点o的跳数hs，o，则说明新加入节点s应当处于节点pi的子树中，此时，查看pi的子节点列表，如果pi子节点列表为空，参考图4，则将节点s直接作为pi的叶子节点插入其中，加入过程完成，结束操作，如果pi子节点列表不为空，将该子节点pi作为新的动态根节点o；然后重新执行步骤2)。
最后所应说明的是，以上实施例仅用以说明本发明的技术方案而非限制。尽管参照实施例对本发明进行了详细说明，本领域的普通技术人员应当理解，对本发明的技术方案进行修改或者等同替换，都不脱离本发明技术方案的精神和范围，其均应涵盖在本发明的权利要求范围当中。

Claims (3)

  1. 一种树结构网络自治管理和节点加入方法，包括：
    首先测量待加入节点与树结构网络中各节点间的路由跳数，然后根据路由跳数关系将待加入节点加入到树形网络中的合适位置，使得节点间的物理跳数关系与拓扑跳数关系保持基本一致。
  2. 根据权利要求1所述的树结构网络自治管理和节点加入方法，其特征在于，所述树结构网络中的各个节点均包括：子节点列表，子节点数计数器，邻居节点列表和父节点指针；该方法进一步包括：
    步骤1)、将一节点设为动态根节点o，动态根节点o的子节点列表记为P＝{p1，p2，...，pi，...}；其中，在初始时，动态根节点o为根节点R；
    步骤2)、对于动态根节点o的任意子节点pi，计算新加入节点s与动态根节点o的跳数ho，s、新加入节点s与子节点pi的跳数
    Figure PCTCN2015074085-appb-100001
    以及动态根节点o与子节点pi的跳数
    Figure PCTCN2015074085-appb-100002
    如果
    Figure PCTCN2015074085-appb-100003
    将pi作为新加入节点s的子节点，将动态根节点o作为新加入节点s的父节点，然后结束操作；若没有子节点pi满足
    Figure PCTCN2015074085-appb-100004
    则执行下一步；
    步骤3)、对于动态根节点o的任意子节点pi，如果新加入节点s与子节点pi的跳数
    Figure PCTCN2015074085-appb-100005
    大于新加入节点s与动态根节点o的跳数hs，o，将动态根节点o作为新加入节点s的父节点，然后结束操作，否则，执行下一步；
    步骤4)、对于动态根节点o的任意子节点pi，如果新加入节点与子节点pi的跳数
    Figure PCTCN2015074085-appb-100006
    小于新加入节点s与动态根节点o的跳数hs，o，查看pi的子节点列表，如果pi子节点列表为空，则将节点s直接作为pi的叶子节点插入其中，结束操作，如果pi子节点列表不为空，将该子节点pi作为新的动态根节点o，然后重新执行步骤2)。
  3. 根据权利要求2所述的树结构网络自治管理和节点加入方法，其特征在于，在步骤2)中，若满足
    Figure PCTCN2015074085-appb-100007
    条件的子节点pi的数目多于一个，则将所有满足条件的子节点pi都作为新加入节点s的子节点，并将动态根节点o作为新加入节点s的父节点。
PCT/CN2015/074085 2014-12-08 2015-03-12 一种树结构网络自治管理和节点加入方法 WO2016090758A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP15867971.2A EP3232618B1 (en) 2014-12-08 2015-03-12 Tree structure network autonomous management and node adding method
AU2015361959A AU2015361959B2 (en) 2014-12-08 2015-03-12 Tree structure network autonomous management and node adding method

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410743785.1A CN105743789B (zh) 2014-12-08 2014-12-08 一种树结构网络自治管理和节点加入方法
CN201410743785.1 2014-12-08

Publications (1)

Publication Number Publication Date
WO2016090758A1 true WO2016090758A1 (zh) 2016-06-16

Family

ID=56106533

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/074085 WO2016090758A1 (zh) 2014-12-08 2015-03-12 一种树结构网络自治管理和节点加入方法

Country Status (4)

Country Link
EP (1) EP3232618B1 (zh)
CN (1) CN105743789B (zh)
AU (1) AU2015361959B2 (zh)
WO (1) WO2016090758A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101179499A (zh) * 2007-12-06 2008-05-14 上海大学 用于监控系统的无线自组网形成树形路由方法
CN101197748A (zh) * 2007-11-30 2008-06-11 华南理工大学 一种基于分区树的多跳无线自组织网络构建方法
WO2013042207A1 (ja) * 2011-09-20 2013-03-28 富士通株式会社 ノード装置および通信方法
CN103078796A (zh) * 2013-01-28 2013-05-01 杭州华三通信技术有限公司 一种路由计算方法和设备

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6982960B2 (en) * 2001-03-09 2006-01-03 Motorola, Inc. Protocol for self-organizing network using a logical spanning tree backbone
WO2008096912A1 (en) * 2007-02-04 2008-08-14 Ki-Hyung Kim Method for allowing a family-based address in a wireless sensor network, and method for hierarchical routing a path setting using the same
US8279766B2 (en) * 2007-07-31 2012-10-02 The Hong Kong University Of Science And Technology Interior-node-disjoint multi-tree topology formation
CN103078798B (zh) * 2012-12-28 2015-12-02 华为技术有限公司 一种建立路由表的方法和设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101197748A (zh) * 2007-11-30 2008-06-11 华南理工大学 一种基于分区树的多跳无线自组织网络构建方法
CN101179499A (zh) * 2007-12-06 2008-05-14 上海大学 用于监控系统的无线自组网形成树形路由方法
WO2013042207A1 (ja) * 2011-09-20 2013-03-28 富士通株式会社 ノード装置および通信方法
CN103078796A (zh) * 2013-01-28 2013-05-01 杭州华三通信技术有限公司 一种路由计算方法和设备

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3232618A4 *

Also Published As

Publication number Publication date
CN105743789A (zh) 2016-07-06
AU2015361959B2 (en) 2018-05-31
EP3232618A4 (en) 2017-12-06
CN105743789B (zh) 2019-01-08
EP3232618B1 (en) 2019-02-20
EP3232618A1 (en) 2017-10-18
AU2015361959A1 (en) 2017-07-27

Similar Documents

Publication Publication Date Title
WO2016091174A1 (zh) 图数据的搜索方法和装置
US7664742B2 (en) Index data structure for a peer-to-peer network
WO2015070674A1 (zh) 一种操作数据的方法和系统
CN104145257A (zh) 用于被连接设备的语义缓存云服务
WO2018184305A1 (zh) 基于社交网络的群组查找方法、装置、服务器和存储介质
Hao et al. BlockP2P: Enabling fast blockchain broadcast with scalable peer-to-peer network topology
Lin et al. A QoS‐aware service discovery method for elastic cloud computing in an unstructured peer‐to‐peer network
CN105978711A (zh) 一种基于最小生成树的最佳交换边查找方法
WO2016101759A1 (zh) 一种数据路由方法、数据管理装置和分布式存储系统
Min et al. A real-time generalization and multi-scale visualization method for poi data in volunteered geographic information
CN103546327A (zh) 一种建立基于jxta的混合式拓扑的网络管理模型的方法
CN104657385A (zh) 一种节点的查找方法及装置
JP2012252705A (ja) 階層的な名前構造に基づいたネットワークにおけるコンテンツ要請者及びコンテンツ回答者の通信方法及び装置
WO2008089616A1 (fr) Serveur, système réseau p2p et procédé d'acheminement et de transfert de l'affectation de la clé de ressource de ce dernier.......
WO2016090758A1 (zh) 一种树结构网络自治管理和节点加入方法
Caminero et al. P2P-based resource discovery in dynamic grids allowing multi-attribute and range queries
Azmy et al. A machine-checked correctness proof for Pastry
Xie et al. Semantic service composition based on social network
JP2008269141A (ja) オーバレイ検索装置、オーバレイ検索システム、オーバレイ検索方法およびオーバレイ検索用プログラム
CN112463735B (zh) 一种大体积json文件拆分并按需请求的方法
JP6522934B2 (ja) コンポーネント陳腐化レジストリ
Manzanares-Lopez et al. P4-kbr: A key-based routing system for p4-programmable networks
Schönfelder et al. Abstract routing models and abstractions in the context of vehicle routing
Li et al. Cluster based dynamic routing on powerline carrier network
WO2016086547A1 (zh) 一种树结构网络的管理结构分裂方法

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: 15867971

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2015867971

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2015361959

Country of ref document: AU

Date of ref document: 20150312

Kind code of ref document: A