Abstract:
An upstream bandwidth allocation method, apparatus, and system. The method includes obtaining, by a cable modem termination system (CMTS), a service flow attribute of each online cable modem (CM) of one or more online CMs, where the service flow attribute comprises at least one delay-sensitive service and a delay-insensitive service, allocating, by the CMTS, an upstream bandwidth to each online CM according to a received service request, and obtaining a remaining bandwidth that is a remaining part in a preset total bandwidth other than the upstream bandwidth that is allocated to each online CM according to the service request, allocating, by the CMTS, at least a part of the remaining bandwidth to a CM whose service flow attribute is a delay-sensitive service, and informing, by the CMTS, each online CM of the one or more online CMs of an upstream bandwidth allocation result.
Abstract:
A distributed data storage method, apparatus, and system. The method includes: splitting a data file to generate K data slices, splitting each data slice of the K data slices to generate M data blocks for each data slice, and performing check coding on the M data blocks by using a redundancy algorithm to generate N check blocks; determining, by using a random algorithm, a first physical storage node corresponding to one block of the M data blocks and the N check blocks, and determining at least M+1 different physical storage nodes based on the determined first physical storage node and according to a first rule-based sorting manner; and storing at least M+1 blocks of the M data blocks and the N check blocks onto the at least M+1 different storage nodes, where K, M, and N are integers.
Abstract:
A distributed data storage method, apparatus, and system for reducing a data loss that may result from a single-point failure. The method includes: splitting a data file to generate K data slices, splitting each data slice of the K data slices to generate M data blocks for each data slice, and performing check coding on the M data blocks by using a redundancy algorithm to generate N check blocks; determining, by using a random algorithm, a first physical storage node corresponding to one block of the M data blocks and the N check blocks, and determining at least M+1 different physical storage nodes based on the determined first physical storage node and according to a first rule-based sorting manner; and storing at least M+1 blocks of the M data blocks and the N check blocks onto the at least M+1 different storage nodes, where K, M, and N are integers.
Abstract:
An upstream bandwidth allocation method, apparatus, and system. The method includes obtaining, by a cable modem termination system (CMTS), a service flow attribute of each online cable modem (CM) of one or more online CMs, where the service flow attribute comprises at least one delay-sensitive service and a delay-insensitive service, allocating, by the CMTS, an upstream bandwidth to each online CM according to a received service request, and obtaining a remaining bandwidth that is a remaining part in a preset total bandwidth other than the upstream bandwidth that is allocated to each online CM according to the service request, allocating, by the CMTS, at least a part of the remaining bandwidth to a CM whose service flow attribute is a delay-sensitive service, and informing, by the CMTS, each online CM of the one or more online CMs of an upstream bandwidth allocation result.
Abstract:
A distributed data storage method, apparatus, and system. The method includes: splitting a data file to generate K data slices, splitting each data slice of the K data slices to generate M data blocks for each data slice, and performing check coding on the M data blocks by using a redundancy algorithm to generate N check blocks; determining, by using a random algorithm, a first physical storage node corresponding to one block of the M data blocks and the N check blocks, and determining at least M+1 different physical storage nodes based on the determined first physical storage node and according to a first rule-based sorting manner; and storing at least M+1 blocks of the M data blocks and the N check blocks onto the at least M+1 different storage nodes, where K, M, and N are integers.
Abstract:
A distributed data storage method, apparatus, and system for reducing a data loss that may result from a single-point failure. The method includes: splitting a data file to generate K data slices, splitting each data slice of the K data slices to generate M data blocks for each data slice, and performing check coding on the M data blocks by using a redundancy algorithm to generate N check blocks; determining, by using a random algorithm, a first physical storage node corresponding to one block of the M data blocks and the N check blocks, and determining at least M+1 different physical storage nodes based on the determined first physical storage node and according to a first rule-based sorting manner; and storing at least M+1 blocks of the M data blocks and the N check blocks onto the at least M+1 different storage nodes, where K, M, and N are integers.