Patent classifications
H04L12/743
Data packet transmission method and border routing bridge device
A data packet transmission method and a border routing bridge device, where the method includes receiving, by a first border routing bridge device of a first area, a first data packet sent by a border routing bridge device of a second area to the first area, determining, a device identifier group of the second area according to the first data packet, determining, from the device identifier group of the second area, according to the first data packet, a device identifier of a border routing bridge device used to forward a return data packet sent by the target device to the source device, and sending, by the first border routing bridge device, a second data packet carrying the determined device identifier to the target device, where the determined device identifier is used as a source routing bridge device identifier of the second data packet.
SYSTEM AND METHOD FOR TRACKING DOMAIN NAMES FOR THE PURPOSES OF NETWORK MANAGEMENT
A method includes intercepting a first data packet being transmitted from a domain name system (DNS) server to a first client device, the first data packet being a DNS response, extracting a first internet protocol (IP) address and a first hostname from the first data packet, and storing the first IP address and the first hostname in a first entry of an identification table.
Monitoring network traffic to determine similar content
In an embodiment, a method monitors a plurality of data streams passing through a router in the connectivity service provider environment, and for each of the data streams, periodically samples packets at the router. The method further generates a stream signature based at least on the payload of the sampled packets. The method further includes, for each generated stream signature, attaching information to the stream signature. Such information may, for example, include time-stamp information for the stream signature, or an identification of the router. The method may further comprise storing the stream signatures corresponding to the data streams in a database. The stored stream signatures may be compared to determine matching stream signatures. Matching signatures may identify data streams that carry identical or similar content.
DATA PLANE WITH HEAVY HITTER DETECTOR
Some embodiments of the invention provide a data-plane forwarding circuit (data plane) that can be configured to identify large data message flows that it processes for forwarding in a network. In this document, large data message flows are referred to as heavy hitter flows. To perform its forwarding operations, the data plane includes several data message processing stages that are configured to process the data tuples associated with the data messages received by the data plane. In some embodiments, parts of the data plane message-processing stages are also configured to implement a heavy hitter detection (HHD) circuit. The operations of the data plane's message processing stages are configured by a control plane of the data plane's forwarding element in some embodiments.
Systems and methods for device visiting frequency estimation
Disclosed are systems, methods, and computer-readable media for determining a distribution of various visiting frequencies among devices/elements detected at a site. A method includes generating a list representing a portion of devices detected at a site over a first time period based on wireless signals transmitted by the devices and received at an access point and determining a visiting frequency for each device represented in the list based on data representing devices previously detected at the site. The method further includes, based on the visiting frequency determined for each device represented in the list, estimating a distribution of each visiting frequency among the devices detected at the site over the first time period to yield a plurality of estimated distributions and storing the plurality of estimated distributions for further processing.
DECENTRALIZED CONTENT FABRIC
Disclosed are examples of systems, apparatus, devices, computer program products, and methods implementing aspects of a decentralized content fabric. In some implementations, a fabric node of an overlay network situated in an application layer differentiated from an internet protocol layer is configured to: obtain a request for digital content from a client device; obtain, from one or more of a plurality of fabric nodes, a plurality of content object parts of a content object representing, in the overlay network, at least a portion of the digital content; generate consumable media using: raw data stored in the content object parts, metadata stored in the content object parts, and build instructions stored in the content object parts; and provide the consumable media to the client device. In some instances, the consumable media is further generated using a digital contract stored in a blockchain.
Dynamic route profile storage in a hardware trie routing table
The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.
Forwarding table management
Disclosed herein are system, method, and computer program product embodiments for representing a forwarding information base (FIB) in a database. An embodiment operates by organizing forwarding entries of the FIB in a trie data structure. The embodiment determines that a first routing prefix of a first forwarding entry in the trie data structure is a less specific routing prefix than a second routing prefix in a second forwarding entry in the trie data structure based on the first forwarding entry being a parent of the second forwarding entry. The embodiment determines that a first next hop of the first routing prefix is equal to a second next hop of the second routing prefix. The embodiment removes the second forwarding entry from the trie data structure. The embodiment then inserts the first forwarding entry into the database based on a prefix length of the first routing prefix.
NETWORK PROCESSING DEVICE AND NETWORKS PROCESSING METHOD OF COMMUNICATION FRAMES
To realize a low power consumption and a small area of a network communication system and a semiconductor device for mounting the same. In the processing method of the network router or network communication frame, the received frame is input to the hash generator, to obtain an address based on the resulting hash value, the position of the address in the rule table, stores the rule corresponding to the received frame.
PATH SIGNATURES FOR DATA FLOWS
This disclosure describes various methods, systems, and devices related to identifying path changes of data flows in a network. An example method includes receiving, at a node, a packet including a first path signature. The method further includes generating a second path signature by inputting the first path signature and one or more node details into a hash function. The method includes replacing the first path signature with the second path signature in the packet. The packet including the second path signature is forwarded by the node.