Patents by Inventor Hanxu Hou

Hanxu Hou has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20190220768
    Abstract: An example topology construction method for satisfying partition tolerance, comprising: combining the consortium blockchain consensus mechanism with the network topology structure to make the consortium blockchain consensus satisfy the partition tolerance in probability; abstracting the partition tolerance of a system into a class of convergent Markov process and computing a steady-state probability of the system; estimating the probability and the average minimum repair time of failing to meet consistency or availability in the event of a partition failure with a given number of failure channels, and a partition tolerance probability and an average minimum repair time of the system are obtained; and analyzing the resource overhead and the partition tolerance under different network topologies according to the obtained partition tolerance probability and the average minimum repair time, and constructing the network topology structure with suitable scale and high partition tolerance for the consortium blockcha
    Type: Application
    Filed: March 21, 2019
    Publication date: July 18, 2019
    Applicants: PEKING UNIVERSITY SHENZHEN GRADUATE SCHOOL, CHINA NATIONAL DIGITAL SWITCHING SYSTEM ENGINEERING & TECHNOLOGICAL R&D CENTER, SHENZHEN CESTBON TECHNOLOGY CO. LIMITED
    Inventors: Hui Li, Jiangxing Wu, Kejiao Li, Peng Yi, Han Wang, Fusheng Zhu, Hanxu Hou, Kedan Li, Xichun Zhang
  • Patent number: 9961142
    Abstract: A method, device and system disclosed used in storage technique, comprising: splitting a file of size M into k blocks, that is to say, each block is of size M/k; issuing the above k blocks across k different storage nodes in the distributed network storage system in a distributed manner; using the k blocks, constructing n?k independent blocks via linear coding method, and satisfying the property that any k of the n encoded blocks can be used to reconstruct the original data in the file, which means the linear coding method is a kind of Maximum-Distance Separable (MDS) code; distribute the n?k encoded blocks to the rest n?k different storage codes in the distributed network storage systems.
    Type: Grant
    Filed: February 15, 2012
    Date of Patent: May 1, 2018
    Assignees: PEKING UNIVERSITY SHENZHEN GRADUATE SCHOOL, SHENZHEN IPTV CO., LTD.
    Inventors: Hui Li, Xianxia Huang, Hanxu Hou, Tai Zhou, Bing Zhu, Changmin Chen, Jingbang Zhou
  • Patent number: 9722637
    Abstract: This invention gives a coding method of MBR (Minimum Bandwidth Regenerating) codes. The related method includes the following steps: equally divide the original file of size B into k(k+1)/2 blocks, obtaining the first packets; construct a symmetrical k×k system matrix S with these first packets; generate k ID codes, wherein each ID code contains k elements; obtain the coded packet through operations between one column of the system matrix and the ID code; repeat the above steps with (n?k) different columns of the system matrix separately to get the (n?k) coded packets; construct the (n?k)×k check matrix P with the column number g which is the serial number of the ID codes in the coded packet set Pg; store the rows of the system matrix and coded matrix to n nodes, each node stores one row. The present invention also involves a method to repair the failed nodes of the above coding scheme.
    Type: Grant
    Filed: March 26, 2013
    Date of Patent: August 1, 2017
    Assignees: PEKING UNIVERSITY SHENZHEN GRADUATE SCHOOL
    Inventors: Hui Li, Hanxu Hou, Bing Zhu
  • Patent number: 9647698
    Abstract: The invention relates to a method for encoding MSR (Minimum-storage Regenerating) codes, which comprises the following steps of: acquiring n first data packets which are represented by Si, i=1, 2, . . . , n; setting n storage nodes and a positive integer k, wherein n=2K; respectively adding a specified number of 0 bits on data heads or data tails of subsequent successive k first data packets by taking the next first data packet of the ith first data packet as a starting point, acquiring k second data packets, and acquiring an encoded data packet by computing the k second data packets; repeating the above steps and acquiring n encoded data packets which are represented by Pi, i=1, 2, . . . , n; and storing the ith first data packet and the encoded data packet acquired by taking the next first data packet of the first data packet as the starting point into the ith storage node.
    Type: Grant
    Filed: February 26, 2013
    Date of Patent: May 9, 2017
    Assignees: PEKING UNIVERSITY SHENZHEN GRADUATE SCHOOL
    Inventors: Hui Li, Hanxu Hou, Bing Zhu
  • Publication number: 20160285476
    Abstract: A method for encoding and decoding of data based on binary Reed-Solomon codes. The method includes the steps of constructing binary Reed-Solomon codes from an original data using XOR operations, refreshing the binary Reed-Solomon codes using XOR operations, and reconstructing the binary Reed-Solomon codes using XOR operations.
    Type: Application
    Filed: June 5, 2016
    Publication date: September 29, 2016
    Inventors: Hui LI, Hanxu HOU, Jun CHEN, Bing ZHU, Shuoyan LI
  • Publication number: 20160274972
    Abstract: An MDS erasure code capable of repairing multiple node failures, being a C(k, r, p) code which stores original information data blocks and parity data blocks by constructing a (p?l)*(k+r) matrix, in which, p is a prime larger than both k and r, k is an arbitrary integer between 2 and p, and r is smaller than or equal to 5. Both an addition operation and a subtraction operation of the C(k, r, p) code are substituted by an XOR operation. An original data block is split into k columns of the original information data blocks with each column containing p?l bits. r columns of the parity data blocks that are linearly independent from one another are generated from the k columns of the original information data blocks. After being changed, the original information data blocks and the parity data blocks are linearly independent.
    Type: Application
    Filed: May 25, 2016
    Publication date: September 22, 2016
    Inventors: Hui LI, Hanxu HOU, Kenneth W. SHUN, Zhihao HUANG
  • Publication number: 20160006463
    Abstract: This invention gives a coding method of MBR (Minimum Bandwidth Regenerating) codes. The related method includes the following steps: equally divide the original file of size B into k(k+1)/2 blocks, obtaining the first packets; construct a symmetrical k×k system matrix S with these first packets; generate k ID codes, wherein each ID code contains k elements; obtain the coded packet through operations between one column of the system matrix and the ID code; repeat the above steps with (n?k) different columns of the system matrix separately to get the (n?k) coded packets; construct the (n?k)×k check matrix P with the column number g which is the serial number of the ID codes in the coded packet set Pg; store the rows of the system matrix and coded matrix to n nodes, each node stores one row. The present invention also involves a method to repair the failed nodes of the above coding scheme.
    Type: Application
    Filed: March 26, 2013
    Publication date: January 7, 2016
    Applicants: PEKING UNIVERSITY SHENZHEN GRADUATE SCHOOL
    Inventors: Hui LI, Hanxu HOU, Bing ZHU
  • Publication number: 20150358037
    Abstract: The invention relates to a method for encoding MSR (Minimum-storage Regenerating) codes, which comprises the following steps of: acquiring n first data packets which are represented by Si, i=1, 2, . . . , n; setting n storage nodes and a positive integer k, wherein n=2K; respectively adding a specified number of 0 bits on data heads or data tails of subsequent successive k first data packets by taking the next first data packet of the ith first data packet as a starting point, acquiring k second data packets, and acquiring an encoded data packet by computing the k second data packets; repeating the above steps and acquiring n encoded data packets which are represented by Pi, i=1, 2, . . . , n; and storing the ith first data packet and the encoded data packet acquired by taking the next first data packet of the first data packet as the starting point into the ith storage node.
    Type: Application
    Filed: February 26, 2013
    Publication date: December 10, 2015
    Applicants: PEKING UNIVERSITY SHENZHEN GRADUATE SCHOOL
    Inventors: Hui LI, Hanxu HOU, Bing ZHU
  • Publication number: 20150227425
    Abstract: A method for encoding, data-restructuring and repairing projective self-repairing codes is provided. The method comprises the following steps: equally dividing original data; setting base finite fields which have an inclusion relation according to parameters of the equally divided data: a first finite field and a second finite field; partitioning a space constructed of B/C-dimensional vectors with its subgroup coset and choosing B/C subspaces among the subspaces, each chosen subspace corresponding to a storage node; arraying vectors of the B/C subspaces to obtain an encoding matrix; and according to each storage node's encoding vectors, obtaining encoding data stored therein, and storing the encoding data into the storage node.
    Type: Application
    Filed: April 20, 2015
    Publication date: August 13, 2015
    Inventors: Hui LI, Hanxu HOU, Shunhong YE, Wen NIE, Xuelei TAN
  • Publication number: 20140376366
    Abstract: The present invention relates to IP network communication technology. It provides a kind of IP multicast data layer distribution method and system. The method includes: first code original multicast data into multiple sub-flow, separately specify different shunt sub-source for every sub-flow, distribute sub-group address, create sub-group state, etc, form shunt structure. Then the sink send join news to each shunt sub-source, join each shunt sub-source sub-group and become the leaf node of each sub-tree. And then each shunt sub-source determine the intermediate node according to the port receiving join news and construct multicast distribution-tree. If the overlapping portion between the multicast distribution trees produce congestion, in the congestion nodes network coding is used to eliminate congestion and construct coding sub-tree according to the way of building multicast distribution tree from the below of the coding nodes.
    Type: Application
    Filed: February 22, 2012
    Publication date: December 25, 2014
    Inventors: Hui Li, Yining Li, Changmin Chen, Jingbang Zhou, Huayu Zhang, Junqiu Feng, Yumeng Zhang, Hanxu Hou, Han Guo, Huiyao An
  • Publication number: 20140317222
    Abstract: A method, device and system disclosed used in storage technique, comprising: splitting a file of size M into k blocks, that is to say, each block is of size M/k; issuing the above k blocks across k different storage nodes in the distributed network storage system in a distributed manner; using the k blocks, constructing n?k independent blocks via linear coding method, and satisfying the property that any k of the n encoded blocks can be used to reconstruct the original data in the file, which means the linear coding method is a kind of Maximum-Distance Separable (MDS) code; distribute the n?k encoded blocks to the rest n?k different storage codes in the distributed network storage systems.
    Type: Application
    Filed: February 15, 2012
    Publication date: October 23, 2014
    Inventors: Hui Li, Xianxia Huang, Hanxu Hou, Tai Zhou, Bing Zhu, Changmin Chen, Jingbang Zhou