# US 2010/0169280 A1 · Distributed network construction and storage method, apparatus and system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0169280 A1
- Document ID: US20100169280A1
- Status: Published application
- Kind: A1
- Application number: 12/639,667
- Filed: 2009-12-16
- Published: 2010-07-01
- Earliest claimed: 2008-12-26
- Assignees: Huawei Technologies Co., Ltd.
- Inventors: Guangyu Shi; Hao Gong; Jian Chen; Lingyuan Fan
- Web page: https://patentgrep.com/patent/US20100169280A1

## CPC

- H04L 67/104: Peer-to-peer [P2P] networks
- H04L 67/1046: {Joining mechanisms}
- H04L 67/1065: {Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] (pre-configuration of logical or physical connections H04L67/1053)}
- H04L 67/1076: {Resource dissemination mechanisms or network resource keeping policies for optimal resource availability in the overlay network}
- H04L 67/1095: Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

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.

## Claims

### Claim 1

A distributed data storage method, comprising:
obtaining geographic location information about data;
determining a storage area of the data according to the geographic location information, and calculating the key value of the data;
selecting a local node in the storage area according to the key value; and
storing the data into the local node

### Claim 2 (depends on 1)

The method according to claim 1, further comprising:
selecting a backup node outside the storage area according to the key value, and backing up the data into the selected backup node.

### Claim 3 (depends on 1)

The method according to claim 1, further comprising:
calculating a Backup-Key of a certain offset according to the key value; and
selecting backup nodes inside the storage area or outside the storage area according to the Backup-Key, and backup the data into the backup nodes.

### Claim 4 (depends on 1)

The method according to claim 1, further comprising:
obtaining a first backup key value and a second backup key value according to different offsets;
selecting a local backup node in the storage area according to the first backup key value;
selecting a backup node outside the storage area according to the second backup key value; and
backing up the data into the local backup node and the remote backup node.

### Claim 5 (depends on 3)

The method according to claim 3, before calculating a Backup-Key of a certain offset according to the key value further comprising:
determining a striplet segment of the key value, wherein different striplets segments correspond to different offsets; and
calculating the Backup-Key according to the key value and the offset corresponding to the determined striplet segment.

### Claim 6

A distributed data storage apparatus, comprising:
an obtaining module, adapted to obtain geographic location information about data, and determine the storage area of the data according to the geographic location information about the data;
a Hash module, adapted to calculate the key value of the data; and
a storage module, adapted to select a local node in the storage area determined by the obtaining module according to the key value, wherein the key value is calculated by the Hash module, and store the data into the local node.

### Claim 7 (depends on 6)

The apparatus according to claim 6, wherein the storage module comprises:
a first backup unit, adapted to select a remote backup node outside the storage area determined by the obtaining module according to the key value, wherein the key value is calculated by the Hash module, and back up the data into the remote backup node.

### Claim 8 (depends on 6)

The apparatus according to claim 6, wherein the storage module comprises:
a first backup unit, adapted to calculate the backup key value of the offset according to the key value calculated by the Hash module, select a backup node inside the storage area and/or a backup node outside the storage area determined by the obtaining module according to the back up key value, and backup the data into the backup nodes.

### Claim 9 (depends on 6)

The apparatus according to claim 6, wherein the storage module comprises:
a first backup unit, adapted to calculate different offsets according to the key value calculated by the Hash module to obtain the first backup key value and the second backup key value, select a local backup node in the storage area determined by the obtaining module according to the first backup key value, select a backup node outside the storage area according to the second backup key value, and backup the data into the local backup node and the remote back up node.

### Claim 10 (depends on 7)

The apparatus according to claim 7, wherein the first backup unit comprises:
a second fragment unit, adapted to determine the striplet segment corresponding to the key value according to the key value calculated by the Hash module, wherein different fragments of the same striplet correspond to different offsets;
a second offset unit, adapted to calculate the backup key value according to the key value and the offset corresponding to the striplet fragment determined by the second fragment unit; and
a second backup unit, adapted to: select a backup node in the storage area and/or a backup node outside the storage area determined by the obtaining module 81 according to the backup key value calculated by the second offset unit, and back up the data into the backup nodes.

### Claim 11

A distributed network construction method, comprising:
obtaining geographic location information about a node;
determining the home area of the node according to the geographic location information about the node, and determining the ID space of the node according to the home area of the node, wherein different areas correspond to different ID spaces; and
selecting a value in the determined ID space to construct the ID of the node.

### Claim 12 (depends on 11)

The method according to claim 11, wherein the selecting a value in the determined ID space to construct the ID of the node comprises:
selecting a value in the ID space corresponding to the area randomly; or,
if the ID space corresponding to the area is divided into ID subspaces, selecting an ID subspace first, and then selecting a value in the selected ID subspace randomly.

### Claim 13 (depends on 11)

The method according to claim 11, wherein determining the ID space of the node according to the home area of the node comprises:
using a selected value as a prefix, a suffix, a key field of the node ID, and then constructing the final node ID according to other attributes of the node; or,
using a selected value as the node ID directly.

### Claim 14 (depends on 11)

The method according to claim 11, wherein determining the home area of the node according to the geographic location information about the node, and determining the ID space of the node according to the home area of the node comprises:
selecting a strip from the Hash space, wherein each strip includes striplets that belong to different areas;
determining the home area of the node according to the geographic location information about the node in the selected strip, and determine the striplet, as the ID space of the node, corresponding to the home area of the node, and use this striplet.

### Claim 15 (depends on 14)

The method according to claim 14, wherein the selecting a strip from the Hash space comprises:
selecting a strip randomly from the strips of the Hash space, or
selecting a strip from the strips that are not used before, or
selecting a strip that is least used.

### Claim 16

A distributed network construction apparatus, comprising:
an obtaining module, adapted to obtain geographic location information about a node; and
a selecting module, adapted to determine the home area of the node according to the geographic location information about the node, wherein the geographic location information about the node is obtained by the obtaining module, and determine the ID space of the node according to the home area of the node, where different areas correspond to different ID spaces; and
a constructing module, adapted to select a value in the ID space determined by the selecting module to construct the ID of the node.

### Claim 17 (depends on 16)

The apparatus according to claim 16, wherein the constructing module comprises:
a first selecting unit, adapted to select an ID subspace in the ID space, wherein the ID space is divided into ID subspaces; and
a first constructing unit, adapted to select a value in the ID subspace selected by the first selecting unit to construct the ID of the node.

### Claim 18 (depends on 16)

The apparatus according to claim 16, wherein the selecting module comprises:
a second selecting unit, adapted to select a strip from the Hash space of the network, wherein each strip includes striplets that belong to different areas: and
a second determining unit, adapted to determine the home area of the node according to the geographic location information about the node in the strip selected by the second selecting unit, and determine the striplet according to the home area of the node and use the determined the striplet as the ID space of the node.
