摘要:
The invention includes a method and apparatus for determining a coincidence count associated with a traffic flow in a network. The method includes receiving a first packet having a first flow identifier associated with one of the traffic flows, comparing the first flow identifier of the first packet to each of a plurality of other flow identifiers associated with a respective plurality of other packets, and determining a coincidence count associated with the first flow identifier based on the comparison of the first flow identifier to each of the plurality of other flow identifiers. The method for determining a coincidence count associated with one of a plurality of traffic flows may be extended for determining respective coincidence counts associated with a plurality of traffic flows. The determined coincidence counts may be used for determining at least one traffic flow statistic.
摘要:
The invention includes a method and apparatus for generating a coincidence count table adapted for determining at least one flow statistic. The method includes receiving a plurality of packets comprising a respective plurality of payloads, comparing payloads associated with consecutive ones of the plurality of packets for identifying at least one simple pattern included within the compared payloads of the consecutive ones of the plurality of packets, for each of the consecutive ones of the plurality of packets, if the at least one simple pattern is identified, processing the at least one simple pattern to form a complex pattern, and for each complex pattern, updating a coincidence count associated with the complex pattern, wherein the coincidence counts are adapted for determining at least one flow statistic.
摘要:
Method and apparatus using incremental linear regression to derive a traffic flow signature indicative of a particular application within a packet stream.
摘要:
A method and system for generating a bloom filter by mapping into respective groups each of a plurality of initial keys according to a first hash function and mapping each group hashed key into a bloom filter using k respective hash functions.
摘要:
A method for measuring flow is disclosed. The method includes receiving an IP packet; determining if another IP packet is stored in a register; if another IP packet is stored in the register, comparing the stored IP packet with the received IP packet; and determining the longest match between the stored IP packet and the received IP packet.
摘要:
A method and system for generating a bloom filter by mapping into respective groups each of a plurality of initial keys according to a first hash function and mapping each group hashed key into a bloom filter using k respective hash functions.
摘要:
A method and apparatus providing improved set membership determination and group membership identification of candidate data elements using a single Bloom filter programmed to provide a plurality of non-zero f-bit binary vectors, where each of the f-bit binary vectors is associated with a respective group. The Bloom filter is programmed using one or more (but not all) of a plurality of hash filter sets.
摘要:
A method and apparatus providing improved set membership determination and group membership identification of candidate data elements using a single Bloom filter programmed to provide a plurality of non-zero f-bit binary vectors, where each of the f-bit binary vectors is associated with a respective group. The Bloom filter is programmed using one or more (but not all) of a plurality of hash filter sets.
摘要:
Method and apparatus using incremental linear regression to derive a traffic flow signature indicative of a particular application within a packet stream.
摘要:
The invention includes a method and apparatus for generating a link transmission schedule for handling traffic variation in wireless networks without dynamic scheduling or routing. The method includes determining fixed traffic capacities associated with respective wireless links of a wireless network according to a routing algorithm, and generating, using the routing algorithm and the fixed traffic capacities, a link transmission schedule including at least one condition by which traffic is transmitted using each of the network links. The link transmission schedule is adapted to remain substantially fixed during dynamic traffic changes. The routing algorithm may be a two-phase routing algorithm in which traffic is distributed by each node in the wireless network to every node in the wireless network using traffic split ratios. For two-phase routing, fixed traffic capacities may be determined using ingress and egress traffic capacities and traffic split ratios associated with respective nodes in the wireless network.