Patent classifications
H04L45/7459
Decoding a route encoded by a probabilistic encoding data structure
A mobile apparatus receives a route response including information identifying a starting location and a target location of a route and an encoding data structure encoding the route. The encoding data structure is a probabilistic data structure configured to not provide false negatives. The mobile apparatus uses the information identifying the starting and target locations to identify a decoded origin traversable map element (TME) and a decoded target TME of the mobile version of the digital map for the route; accesses map information for determining a cost value for TMEs of the digital map, wherein a TME that satisfies the encoding data structure is assigned a minimal cost value; determines a decoded route from the decoded starting TME to the decoded target TME based on the cost value assigned to the TMEs using a cost minimization route determination algorithm; and performs at least one navigation function using the decoded route.
Decoding a route encoded by a probabilistic encoding data structure
A mobile apparatus receives a route response including information identifying a starting location and a target location of a route and an encoding data structure encoding the route. The encoding data structure is a probabilistic data structure configured to not provide false negatives. The mobile apparatus uses the information identifying the starting and target locations to identify a decoded origin traversable map element (TME) and a decoded target TME of the mobile version of the digital map for the route; accesses map information for determining a cost value for TMEs of the digital map, wherein a TME that satisfies the encoding data structure is assigned a minimal cost value; determines a decoded route from the decoded starting TME to the decoded target TME based on the cost value assigned to the TMEs using a cost minimization route determination algorithm; and performs at least one navigation function using the decoded route.
SINGLE FIELD FOR ENCODING MULTIPLE ELEMENTS
Implementations of the present disclosure are directed to systems and methods for reducing the size of packet headers by using a single field to encode multiple elements. Instead of including separate fields for each element, one or more encoded fields may be used, each of which is decoded to determine two or more values for the data packet. A receiving device decodes the encoded data field to retrieve the two or more values.
METHOD FOR IDENTIFYING FLOW, AND APPARATUS
The technology of this application relates to a method for identifying a flow, where a communication device counts a received packet in a first filtering manner. When determining that a quantity of the received packets of the target flow is greater than or equal to a first threshold, the communication device marks, starting from a packet that exceeds the first threshold, a packet whose count is a multiple of m. When determining that a quantity of the received packets of the target flow is greater than or equal to a second threshold, the communication device counts, in a second filtering manner, a packet that is continuously received. When determining that a quantity of the received packets of the target flow is greater than or equal to a third threshold λ.sub.4, the communication device determines that the target flow is an elephant flow, and marks a packet that is continuously received.
METHOD FOR IDENTIFYING FLOW, AND APPARATUS
The technology of this application relates to a method for identifying a flow, where a communication device counts a received packet in a first filtering manner. When determining that a quantity of the received packets of the target flow is greater than or equal to a first threshold, the communication device marks, starting from a packet that exceeds the first threshold, a packet whose count is a multiple of m. When determining that a quantity of the received packets of the target flow is greater than or equal to a second threshold, the communication device counts, in a second filtering manner, a packet that is continuously received. When determining that a quantity of the received packets of the target flow is greater than or equal to a third threshold λ.sub.4, the communication device determines that the target flow is an elephant flow, and marks a packet that is continuously received.
DATA PACKET EXTRACTION METHOD AND APPARATUS
A data packet extraction method and apparatus is disclosed. Two hash values calculated based on quintuple information of different data packets of a same session are the same, that is, two calculated remainders are also the same at a same sampling ratio. When one remainder of the two calculated remainders is a preset sampling remainder, all the data packets in a network that belong to the session are extracted, so as to implement data packet extraction based on a session. When the quintuple information of the different data packets of the same session matches a first mapping table, either all the data packets of the same session can match the first mapping table, or none of the data packets of the same session can match the first mapping table, so as to implement data packet extraction based on a session.
Flow-driven forwarding architecture for information centric networks
A flow-driven forwarding strategy includes receiving an Interest packet, where the interest packet includes a flow state indicator. The content associated with the Interest packet is checked to determine whether that content is locally stored. Another check is performed to determine whether any previously received Interest packet has requested the content. In response to the content not being locally stored and no related Interest packet has been previously received, the flow state indicator is checked in the Interest packet. In response to the flow state indicator indicating that the Interest packet is associated with an active flow, forwarding information is extracted from a flow state table if a hop count has a value of zero or from the Interest packet if the hop count has a value greater than zero. The Interest packet is then forwarded to a next hop in accordance with the forwarding information.
Method and system for handling of data packet/frames using an adapted bloom filter
A method and system are disclosed for handling a received content word in a system comprising a memory of memory words, wherein: each memory word comprises Bloom Filter structures. The method comprises hashing the content word into a fixed-size word, pointing to the memory word corresponding to an address of the fixed-size word, pointing to, and reading, the Bloom Filter structure in the pointed memory word corresponding to an address in the fixed-size word, and reading and writing the content of the Bloom Filter structures so as to keep track of a number of occurrences of the received content word over a sliding window of time.
Method and system for handling of data packet/frames using an adapted bloom filter
A method and system are disclosed for handling a received content word in a system comprising a memory of memory words, wherein: each memory word comprises Bloom Filter structures. The method comprises hashing the content word into a fixed-size word, pointing to the memory word corresponding to an address of the fixed-size word, pointing to, and reading, the Bloom Filter structure in the pointed memory word corresponding to an address in the fixed-size word, and reading and writing the content of the Bloom Filter structures so as to keep track of a number of occurrences of the received content word over a sliding window of time.
Providing incremental updates of categorical information using a probabilistic encoding data structure
Information corresponding to one or more traversable map elements (TMEs) within a zone of interest is accessed from the geographic database. A respective category of a plurality of categories is determined for each of the one or more TMEs based at least in part on the information corresponding to the TME. A first category encoding data structure is generated based at least in part on map version agnostic identifiers corresponding to TMEs determined to be in a first category of the plurality of categories, wherein the first category encoding data structure is a probabilistic data structure configured to not provide false negatives for TMEs within the zone of interest. The first category encoding data structure is provided such that a mobile apparatus receives the first category encoding data structure.