公开(公告)号：US08645433B2

公开(公告)日：2014-02-04

申请号：US12639667

申请日：2009-12-16

申请人： Guangyu Shi ,  Hao Gong ,  Jian Chen ,  Lingyuan Fan

发明人： Guangyu Shi ,  Hao Gong ,  Jian Chen ,  Lingyuan Fan

IPC分类号： G06F17/30

CPC分类号： H04L67/104 ,  H04L67/1046 ,  H04L67/1065 ,  H04L67/1076 ,  H04L67/1095

摘要： The disclosure relates to distributed network communications, and in particular, to a distributed network construction method and apparatus, a distributed data storage method and apparatus, and a distributed network system. When a node joins a distributed network, the ID of the node is determined according to the geographic location information about the node. Therefore, all the nodes in the same area belong to the same ID range, and the node IDs are allocated according to the area. Because the node IDs are determined according to the area, the local data may be stored in the node in the area according to the geographic information, inter-area data access is reduced. Therefore, the method, the apparatus, and the system provided herein reduce the data load on the backbone network, balance the data traffic and the bandwidth overhead of the entire network, and reduce the network instability.

摘要翻译： 本公开涉及分布式网络通信，特别涉及分布式网络构造方法和装置，分布式数据存储方法和装置以及分布式网络系统。 当节点加入分布式网络时，根据节点的地理位置信息确定节点的ID。 因此，同一区域的所有节点属于相同的ID范围，并根据该区域分配节点ID。 由于根据区域来确定节点ID，所以可以根据地理信息将本地数据存储在该区域的节点中，减少区域间数据访问。 因此，本文提供的方法，装置和系统减少骨干网上的数据负载，平衡整个网络的数据流量和带宽开销，并减少网络不稳定性。

公开(公告)号：US20100169280A1

公开(公告)日：2010-07-01

申请号：US12639667

申请日：2009-12-16

申请人： Guangyu Shi ,  Hao Gong ,  Jian Chen ,  Lingyuan Fan

发明人： Guangyu Shi ,  Hao Gong ,  Jian Chen ,  Lingyuan Fan

IPC分类号： G06F17/30 ,  G06F15/16

CPC分类号： H04L67/104 ,  H04L67/1046 ,  H04L67/1065 ,  H04L67/1076 ,  H04L67/1095

摘要： The disclosure relates to distributed network communications, and in particular, to a distributed network construction method and apparatus, a distributed data storage method and apparatus, and a distributed network system. When a node joins a distributed network, the ID of the node is determined according to the geographic location information about the node. Therefore, all the nodes in the same area belong to the same ID range, and the node IDs are allocated according to the area. Because the node IDs are determined according to the area, the local data may be stored in the node in the area according to the geographic information, inter-area data access is reduced. Therefore, the method, the apparatus, and the system provided herein reduce the data load on the backbone network, balance the data traffic and the bandwidth overhead of the entire network, and reduce the network instability.

摘要翻译： 本公开涉及分布式网络通信，特别涉及分布式网络构造方法和装置，分布式数据存储方法和装置以及分布式网络系统。 当节点加入分布式网络时，根据节点的地理位置信息确定节点的ID。 因此，同一区域的所有节点属于相同的ID范围，并根据该区域分配节点ID。 由于根据区域来确定节点ID，所以可以根据地理信息将本地数据存储在该区域的节点中，减少区域间数据访问。 因此，本文提供的方法，装置和系统减少骨干网上的数据负载，平衡整个网络的数据流量和带宽开销，并减少网络不稳定性。

公开(公告)号：US08230063B2

公开(公告)日：2012-07-24

申请号：US12829752

申请日：2010-07-02

申请人： Guangyu Shi ,  Lingyuan Fan ,  Jian Chen ,  Hao Gong

发明人： Guangyu Shi ,  Lingyuan Fan ,  Jian Chen ,  Hao Gong

IPC分类号： G06F15/173 ,  G06F15/16 ,  H04L12/28

CPC分类号： H04L67/104 ,  H04L67/1065

摘要： A user data server system includes: a data storage node, which stores user data, registers the user data in a Distributed Hash Table (DHT) network by using a key, and receives and processes user data operation requests; a DHT index node, which creates and maintains DHT routing information according to a DHT algorithm and stores information of data storage nodes where user data is stored according to the key and searches for information of a data storage node where target user data is stored according to the key; a DHT super maintenance node, which manages and optimizes the DHT network; and a front end node capable of protocol processing and service processing, which obtains a key associated with a target user and obtains information of a data storage node where the target user data is stored by querying the DHT index node via the DHT network according to the key, and performs operations on the user data stored in the data storage node where the target user data is stored. With the technical solution provided by the present invention, a user data server is not centralized and is highly scalable and highly reliable with a high cost-effectiveness.

摘要翻译： 用户数据服务器系统包括：存储用户数据的数据存储节点，通过使用密钥将用户数据注册在分布式散列表（DHT）网络中，并且接收和处理用户数据操作请求; DHT索引节点，其根据DHT算法创建和维护DHT路由信息，并且根据密钥存储用户数据存储的数据存储节点的信息，并根据密钥搜索存储目标用户数据的数据存储节点的信息，根据 钥匙; DHT超维护节点，管理和优化DHT网络; 以及能够进行协议处理和服务处理的前端节点，其通过根据所述DHT网络查询所述DHT索引节点，获得与目标用户相关联的密钥，并获取存储所述目标用户数据的数据存储节点的信息 并对存储在存储目标用户数据的数据存储节点中的用户数据执行操作。 利用本发明提供的技术方案，用户数据服务器不是集中的，并且具有高度可扩展性和高可靠性，而且具有高成本效益。

公开(公告)号：US08370465B2

公开(公告)日：2013-02-05

申请号：US13252824

申请日：2011-10-04

申请人： Guangyu Shi ,  Hao Gong ,  Jian Chen

发明人： Guangyu Shi ,  Hao Gong ,  Jian Chen

IPC分类号： G06F15/177

CPC分类号： H04L67/16 ,  H04L61/1582 ,  H04L61/1588 ,  H04L67/104 ,  H04L67/1046 ,  H04L67/1065 ,  H04L67/1076 ,  H04W8/08 ,  H04W40/20

摘要： The embodiment of the present invention provides a method for establishing a route, which includes searching a target node by a node from a first level node group according to first level route information, returning to query a result or data saved by the target node if the target node is found, otherwise executing the following step; searching a target node by the node from a higher level node group according to higher level route information, returning to query a result or the data saved by the target node if the target node is found, otherwise repeating the step. Through the hierarchical communication system, most of the flows of daily service operations in the communication network are limited within a small region, thereby preventing from excessively occupying the band width of a backbone network being originally not wide enough.

摘要翻译： 本发明的实施例提供了一种建立路由的方法，其包括根据第一级路由信息从第一级节点组中的节点搜索目标节点，返回查询结果或由目标节点保存的数据，如果 找到目标节点，否则执行以下步骤; 根据较高级别的路由信息​​从上一级节点组中的节点搜索目标节点，如果找到目标节点，返回查询结果或目标节点保存的数据，否则重复该步骤。 通过分层通信系统，通信网络中日常业务运行的大部分流量在小区域内受到限制，从而防止过度占据主干网络的带宽原本不够宽。

公开(公告)号：US07916629B2

公开(公告)日：2011-03-29

申请号：US12338309

申请日：2008-12-18

申请人： Guangyu Shi ,  Hao Wu ,  Jian Chen ,  Hao Gong

发明人： Guangyu Shi ,  Hao Wu ,  Jian Chen ,  Hao Gong

IPC分类号： H04L12/26

CPC分类号： H04W8/04 ,  G06F17/30097 ,  H04L67/104 ,  H04L67/1065 ,  H04L67/1076 ,  H04L67/28 ,  H04L67/2842 ,  H04W24/04

摘要： In order to overcome the defects of the centralized subscriber data management in the telecommunication network, a highly effective distributed data management system for the communication network is achieved in the present invention through improving and applying the distributed Hash table (DHT) technology to subscriber data management in the communication network, which overcomes the deficiencies of the conventional centralized data management. A method for processing subscriber data in a communication network based on a DHT is provided, which includes the following steps. A first node in a DHT overlay network receives subscriber data to be stored. The subscriber data to be stored is regarded as backup data divided into L/K portions. L is greater than or equal to a ratio of a node working bandwidth of a second node to a node recovering bandwidth for data recovery of the second node in the DHT overlay network. K is a total number of backup data and is an integer greater than zero. The subscriber data to be stored is regarded as master data, and the master data and K×L/K divided backup data are, respectively, stored in 1+K×L/K DHT nodes.

摘要翻译： 为了克服电信网络中集中用户数据管理的缺陷，本发明通过改进和应用分布式哈希表（DHT）技术对用户数据管理实现了高效的通信网分布式数据管理系统 在通信网络中，克服了传统集中式数据管理的缺陷。 提供了一种基于DHT处理通信网络中的用户数据的方法，其包括以下步骤。 DHT覆盖网络中的第一个节点接收要存储的用户数据。 要存储的用户数据被认为是分为L / K部分的备份数据。 L大于或等于第二节点的节点工作带宽与恢复用于DHT覆盖网络中的第二节点的数据恢复的带宽的节点的比率。 K是备份数据的总数，大于零的整数。 要存储的订户数据被认为是主数据，主数据和K×L / K分割备份数据分别存储在1 + K×L / K DHT节点中。

公开(公告)号：US20100281163A1

公开(公告)日：2010-11-04

申请号：US12834239

申请日：2010-07-12

申请人： Guangyu Shi ,  Jian Chen ,  Hao Gong

发明人： Guangyu Shi ,  Jian Chen ,  Hao Gong

IPC分类号： G06F15/16

CPC分类号： H04L67/104 ,  H04L45/00 ,  H04L45/04 ,  H04L67/1051 ,  H04L67/1093

摘要： A method and apparatus for maintaining routing information in a Peer-to-Peer (P2P) network are provided. The method includes that: a super maintenance node receives routing update information of an ordinary node in its home area; the super maintenance node sends routing update information to super maintenance nodes in other network areas; the super maintenance nodes in other network areas notify ordinary nodes in their home network areas to update routing information. With the present invention, a node of strong processing capabilities at the network area border is chosen to act as a super maintenance node and other nodes as ordinary nodes; when a node joins or fails, an ordinary node sends detected routing update information only to the super maintenance node in the local network area; the super maintenance node then forwards the update information to super maintenance nodes in other network areas. Each super maintenance node notifies ordinary nodes in its home network area of the received routing update information.

摘要翻译： 提供了一种用于在对等（P2P）网络中维护路由信息的方法和装置。 该方法包括：超维护节点在其归属区域中接收普通节点的路由更新信息; 超维护节点向其他网络区域的超维护节点发送路由更新信息; 其他网络区域的超维护节点通知家庭网络区域中的普通节点更新路由信息。 利用本发明，选择在网络区域边界具有强处理能力的节点作为普通节点作为超维护节点和其他节点; 当节点加入或失败时，普通节点只将检测到的路由更新信息发送到本地网区域的超维护节点; 超维护节点然后将更新信息转发到其他网络区域中的超维护节点。 每个超级维护节点向其归属网络区域中的普通节点通知所接收的路由更新信息。

公开(公告)号：US20100039931A1

公开(公告)日：2010-02-18

申请号：US12605931

申请日：2009-10-26

申请人： Guangyu Shi ,  Jian Chen ,  Hao Gong

发明人： Guangyu Shi ,  Jian Chen ,  Hao Gong

IPC分类号： G06F11/00

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/025 ,  H04L67/104 ,  H04L67/1048

摘要： A method for updating routing table information after a node fails in a P2P network is disclosed herein. The method includes: the range of the nodes whose route is directed to the failed node is determined according to the distance between the failed node and the neighboring node of the failed node; the failure information of the failed node is sent to the LDN of the failed node within the node range; and the LDN updates the routing table according to the failure information. A network device and a P2P communication network are also disclosed herein. The embodiments of the present invention enhance the capability of the whole P2P network in perceiving node churn and improve the route search efficiency and system stability of the whole P2P network.

摘要翻译： 这里公开了在P2P网络中节点故障之后更新​​路由表信息的方法。 该方法包括：根据故障节点与故障节点的相邻节点之间的距离确定路由指向故障节点的节点范围; 故障节点的故障信息发送到节点范围内的故障节点的LDN; LDN根据故障信息更新路由表。 本文还公开了网络设备和P2P通信网络。 本发明的实施例提高了整个P2P网络感知节点流失的能力，提高了整个P2P网络的路由搜索效率和系统稳定性。

公开(公告)号：US08732298B2

公开(公告)日：2014-05-20

申请号：US12834239

申请日：2010-07-12

申请人： Guangyu Shi ,  Jian Chen ,  Hao Gong

发明人： Guangyu Shi ,  Jian Chen ,  Hao Gong

IPC分类号： G06F15/173 ,  G06F15/16

CPC分类号： H04L67/104 ,  H04L45/00 ,  H04L45/04 ,  H04L67/1051 ,  H04L67/1093

摘要： A method and apparatus for maintaining routing information in a Peer-to-Peer (P2P) network are provided. The method includes that: a super maintenance node receives routing update information of an ordinary node in its home area; the super maintenance node sends routing update information to super maintenance nodes in other network areas; the super maintenance nodes in other network areas notify ordinary nodes in their home network areas to update routing information. With the present invention, a node of strong processing capabilities at the network area border is chosen to act as a super maintenance node and other nodes as ordinary nodes; when a node joins or fails, an ordinary node sends detected routing update information only to the super maintenance node in the local network area; the super maintenance node then forwards the update information to super maintenance nodes in other network areas. Each super maintenance node notifies ordinary nodes in its home network area of the received routing update information.

摘要翻译： 提供了一种用于在对等（P2P）网络中维护路由信息的方法和装置。 该方法包括：超维护节点在其归属区域中接收普通节点的路由更新信息; 超维护节点向其他网络区域的超维护节点发送路由更新信息; 其他网络区域的超维护节点通知家庭网络区域中的普通节点更新路由信息。 利用本发明，选择在网络区域边界具有强处理能力的节点作为普通节点作为超维护节点和其他节点; 当节点加入或失败时，普通节点只将检测到的路由更新信息发送到本地网区域的超维护节点; 超维护节点然后将更新信息转发到其他网络区域中的超维护节点。 每个超级维护节点向其归属网络区域中的普通节点通知所接收的路由更新信息。

公开(公告)号：US08248919B2

公开(公告)日：2012-08-21

申请号：US12605931

申请日：2009-10-26

申请人： Guangyu Shi ,  Jian Chen ,  Hao Gong

发明人： Guangyu Shi ,  Jian Chen ,  Hao Gong

IPC分类号： H04J1/16

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/025 ,  H04L67/104 ,  H04L67/1048

摘要： A method for updating routing table information after a node fails in a P2P network is disclosed herein. The method includes: the range of the nodes whose route is directed to the failed node is determined according to the distance between the failed node and the neighboring node of the failed node; the failure information of the failed node is sent to the LDN of the failed node within the node range; and the LDN updates the routing table according to the failure information. A network device and a P2P communication network are also disclosed herein. The embodiments of the present invention enhance the capability of the whole P2P network in perceiving node churn and improve the route search efficiency and system stability of the whole P2P network.

摘要翻译： 这里公开了在P2P网络中节点故障之后更新​​路由表信息的方法。 该方法包括：根据故障节点与故障节点的相邻节点之间的距离确定路由指向故障节点的节点范围; 故障节点的故障信息发送到节点范围内的故障节点的LDN; LDN根据故障信息更新路由表。 本文还公开了网络设备和P2P通信网络。 本发明的实施例提高了整个P2P网络感知节点流失的能力，提高了整个P2P网络的路由搜索效率和系统稳定性。

公开(公告)号：US07991858B2

公开(公告)日：2011-08-02

申请号：US12365564

申请日：2009-02-04

申请人： Guangyu Shi ,  Hao Gong ,  Jian Chen

发明人： Guangyu Shi ,  Hao Gong ,  Jian Chen

IPC分类号： G06F15/177

CPC分类号： H04L67/16 ,  H04L61/1582 ,  H04L61/1588 ,  H04L67/104 ,  H04L67/1046 ,  H04L67/1065 ,  H04L67/1076 ,  H04W8/08 ,  H04W40/20

摘要： The embodiment of the present invention provides a method for establishing a route, which includes searching a target node by a node from a first level node group according to first level route information, returning to query a result or data saved by the target node if the target node is found, otherwise executing the following step; searching a target node by the node from a higher level node group according to higher level route information, returning to query a result or the data saved by the target node if the target node is found, otherwise repeating the step. Through the hierarchical communication system, most of the flows of daily service operations in the communication network are limited within a small region, thereby preventing from excessively occupying the band width of a backbone network being originally not wide enough.

摘要翻译： 本发明的实施例提供了一种建立路由的方法，其包括根据第一级路由信息从第一级节点组中的节点搜索目标节点，返回查询结果或由目标节点保存的数据，如果 找到目标节点，否则执行以下步骤; 根据较高级别的路由信息​​从上一级节点组中的节点搜索目标节点，如果找到目标节点，返回查询结果或目标节点保存的数据，否则重复该步骤。 通过分层通信系统，通信网络中日常业务运行的大部分流量在小区域内受到限制，从而防止过度占据骨干网络的带宽原本不够宽。