Abstract:
A method for compressing flow data, including: generating multiple line segments according to flow data and a predefined maximum error that are acquired; obtaining a target piecewise linear function according to the multiple line segments, where the target piecewise linear function includes multiple linear functions, and an intersection set of value ranges of independent variables of every two linear functions among the multiple linear functions includes a maximum of one value; and outputting a reference data point according to the target piecewise linear function, where the reference data point includes a point of continuity and a point of discontinuity of the target piecewise linear function. In this way, a maximum error, a target piecewise linear function is further determined according to the multiple line segments, and a point of continuity and a point of discontinuity of the target piecewise linear function are used to represent compressed flow data.
Abstract:
A data storage method is used to improve storage consistency of a distributed storage system. The method includes: a primary storage node performs EC coding on a to-be-stored data segment to obtain a target EC stripe; determines in a storage node group to which the primary storage node belongs, m+k target storage nodes used to store m+k target EC blocks of the target EC stripe; sends a preparation message to the target storage nodes; receives a response message sent by a target storage node; and sends an execution message to the target storage nodes to instruct the target storage nodes to write target EC blocks that are in preparation logs.
Abstract:
The present invention provide a method and an apparatus for mining a maximal repeated sequence, where a maximal repeated sequence is determined based on pipelines and a suffix tree, thereby implementing incremental mining and improving computation efficiency. The method comprises: acquiring a character; appending the character to each pipeline in a pipeline set, and separately determining whether a sequence in each pipeline appended with the character is the same as a corresponding sequence on a suffix tree; determining a maximal repeated sequence according to a first preset policy and the sequence in the first pipeline when there exists such a first pipeline in the pipeline set that after the character is appended to the first pipeline, a sequence in the first pipeline is different from a corresponding sequence on the suffix tree.
Abstract:
A communication method includes a control plane node transferring a first virtual media access control (MAC) address in a plurality of virtual MAC addresses on a plurality of user plane (UP) nodes from a first UP node in the plurality of UP nodes to a target UP node based on that the target UP node in the plurality of UP nodes in a virtual broadband network gateway (vBNG) system satisfies a target condition, where the target condition is related to a load of the target UP node.
Abstract:
A deep neural network to which data category information is added is established locally, to-be-identified data is input to an input layer of the deep neural network generated based on the foregoing data category information, and information of a category to which the to-be-identified data belongs is acquired, where the information of the category is output by an output layer of the deep neural network. A deep neural network is established based on data category information, such that category information of to-be-identified data is conveniently and rapidly obtained using the deep neural network, thereby implementing a category identification function of the deep neural network, and facilitating discovery of an underlying law of the to-be-identified data according to the category information of the to-be-identified data.
Abstract:
A data storage method is used to improve storage consistency of a distributed storage system. The method includes: a primary storage node performs EC coding on a to-be-stored data segment to obtain a target EC stripe; determines in a storage node group to which the primary storage node belongs, m+k target storage nodes used to store m+k target EC blocks of the target EC stripe; sends a preparation message to the target storage nodes; receives a response message sent by a target storage node; and sends an execution message to the target storage nodes to instruct the target storage nodes to write target EC blocks that are in preparation logs.
Abstract:
A method and an apparatus for identifying a state of a user of a social network. The identification method includes acquiring a user-event similarity of a user regarding a new event; identifying whether the user is a silent user or a non-activated user according to the user-event similarity; and determining whether the silent user or the non-activated user on the social network is finally in an activated state or a non-activated state. In the foregoing manner, a novel user state model of a social network is designed in the present disclosure, the model includes an activated state, a non-activated state and an unstable silent state, and a final state of a user is inferred precisely under full and comprehensive consideration of factors that may affect the state of the user, such that the state of the user can be accurately and precisely monitored.
Abstract:
A data recovery method to improve storage consistency of a distributed storage system includes: receiving a recovery message from a storage node after a fault recovery of the faulty storage node; obtaining N lost erasure coding (EC) blocks of the faulty storage node through computation according to EC blocks stored by non-faulty storage nodes; sequentially sending N lost EC blocks to the faulty storage node for storage. In the process of sequentially sending the N lost EC blocks to the faulty storage node, when it is determined that for a first EC block that is to be stored by the faulty storage node, a second EC block having a same key value as the first EC block exists in the lost EC blocks, after the faulty storage node stores the second EC block, the first EC block is sent to the faulty storage node to store.
Abstract:
A method for compressing flow data, including: constructing multiple line segments according to flow data and a predefined maximum error that are acquired; obtaining a target piecewise linear function according to the multiple line segments, where the target piecewise linear function includes multiple linear functions, and an intersection set of value ranges of independent variables of every two linear functions among the multiple linear functions includes a maximum of one value; and outputting a reference data point according to the target piecewise linear function, where the reference data point includes a point of continuity and a point of discontinuity of the target piecewise linear function. In this way, a maximum error, a target piecewise linear function is further determined according to the multiple line segments, and a point of continuity and a point of discontinuity of the target piecewise linear function are used to represent compressed flow data.
Abstract:
A data distribution method for improving performance of a distributed storage system includes: receiving, by a data distribution apparatus, a storage instruction of a user, dividing to-be-stored data that the storage instruction instructs to store, into P data segments, determining a storage node group corresponding to each data segment, and finally distributing the data segment to a primary node in the corresponding storage node group.