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 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 stream computer system and a method for processing a data stream in a stream computing system are disclosed. The method includes a first working node invokes at least one execution unit to process a data stream according to an initial parallelism degree, a control node collects information reflecting data traffic between the first working node and a second working node, and information reflecting data processing speed of the first working node, determines an optimized parallelism degree for the first working node according to the collected information, and adjusts the parallelism degree of the first working node to be consistent with the optimized parallelism degree.
Abstract:
A stream computer system and a method for processing a data stream in a stream computing system are disclosed. In an embodiment, the method includes collecting data traffic information between each working node and other working nodes and processing speed information for each working node, determining an optimized parallelism degree for each working node according to the collected data traffic information and processing speed information and adjusting a parallelism degree of the working node according to the optimized parallelism degree of the working node.
Abstract:
Embodiments of the present invention provide a method and an apparatus for network traffic simulation. The method includes: obtaining traffic information and user requirement information of a to-be-simulated IP network; analyzing the traffic information to generate a traffic characteristic; according to correspondence between user requirement information and traffic models, obtaining a traffic model corresponding to the user requirement information; and generating, through simulation, traffic of the to-be-simulated IP network according to the traffic characteristic and the traffic model. The embodiments of the present invention can improve flexibility and an emulation degree of traffic simulation.
Abstract:
The present invention discloses a method and apparatus for querying a nondeterministic graph, which are used to implement quick query of a nondeterministic graph, reduce query complexity, and improve query efficiency. The method comprises receiving a query instruction, where the query instruction is used to query a nondeterministic graph for data that satisfies a query condition; determining two vertices in the nondeterministic graph according to the query instruction; determining all possible paths that use one vertex in the two vertices as a start point and the other vertex as an end point; calculate a probability of a first event or a second event corresponding to each of the paths; and obtaining, according to the probability of the first event or the probability of the second event, a query result corresponding to the query instruction.
Abstract:
A method, an apparatus, and a system for identifying an abnormal IP data stream, which are used to improve identification accuracy. The method provided by the embodiments of the present invention includes: receiving Y elements sent by a data collection node; mapping the Y elements to N buckets; acquiring a bucket in the N buckets as a target bucket; acquiring r upper traffic limits of a first object in r buckets within the current time interval, the first object is any object mapped to the target bucket; and identifying, according to a preset abnormal object type and the r upper traffic limits within the current time interval, whether the first object is an abnormal object, where the preset abnormal object type is a heavy hitter or a heavy changer.
Abstract:
In a data processing method, a worker node in a distributed data processing system receives first data from an upstream worker node. The first data has been stored in a buffer of the upstream worker node. The worker node sends a first portion of the first data to a persistent storage device of the distributed data processing system for persistent backup, and performs computational processing on the first data to generate second data. Prior to completing performing computational processing on the first data, the worker node sends acknowledgement information to the upstream worker node to instruct the upstream node to delete the first data from the buffer of the upstream worker node. The worker node then sends the second data to a downstream worker node in the distributed data processing system for further processing by the downstream worker 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 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.