Patent classifications
H04L45/742
AUTOMATED ROUTE PROPAGATION AMONG NETWORKS ATTACHED TO SCALABLE VIRTUAL TRAFFIC HUBS
Metadata indicating that a virtual traffic hub enabling connectivity between a plurality of isolated networks has been established is stored. A determination is made that a first entry of a first isolated network attached to the hub is to be represented in a second routing table of a second isolated network attached to the hub, e.g., to enable network packets originating at resources of the second isolated network to be transmitted via the hub to the first isolated network. A new entry corresponding to the first entry is included in the second routing table.
TOPOLOGY CHANGE PROCESSING IN BRIDGED NETWORKS USING A SPANNING TREE PROTOCOL
In a spanning tree network, topology change notifications are omitted when a port becomes forwarding if the peer port is an Alternate or Backup port in Discarding state. Other features are also provided.
LIGHTWEIGHT AND TRUST-AWARE ROUTING IN NoC BASED SoC ARCHITECTURES
Various examples are provided related to software and hardware architectures that enable lightweight and trust-aware routing. In one example, among others, a method for trust-aware routing includes calculating trust values to represent how much a node can be trusted to route packets through its router. Each node can store the trust values of routers that are one hop and two hops away from it, which represent direct trust and delegated trust, respectively. When a router receives a packet, the router can update trust values and forward the packet to the next hop.
Method and apparatus for search engine cache
Aspects of the disclosure provide a network device. The network device includes a search engine, a ternary content addressable memory (TCAM) cache engine, a search key generation unit and an output controller. The search engine stores a lookup table of entries for rules of packet processing, and searches the lookup table in response to packets received from a network interface of the network device. The TCAM cache engine caches a subset of the entries in the lookup table based on hit statistics of the entries. The search key generation unit generates a search key based on a received packet and provides the search key to the search engine and to the TCAM cache engine. The output controller outputs a search result from the TCAM cache engine when the TCAM cache engine has a matching entry to the search key.
Packet routing using a network device
An example method of routing a packet includes receiving, at a networking device, a first packet storing a first destination address of a first type and a second destination address of a second type. The example method also includes determining whether a mapping between the first and second destination addresses is valid. The example method further includes in response to a determination that the mapping is not valid: obtaining, at the networking device, a second packet storing the first destination address of the first type and a third destination address of the second type, the first destination address operating at a different network layer than the second and third destination addresses; and transmitting, at the networking device, the second packet to a receiver node, the first and third destination addresses being assigned to the receiver node.
Automated route propagation among networks attached to scalable virtual traffic hubs
Metadata indicating that a virtual traffic hub enabling connectivity between a plurality of isolated networks has been established is stored. A determination is made that a first entry of a first isolated network attached to the hub is to be represented in a second routing table of a second isolated network attached to the hub, e.g., to enable network packets originating at resources of the second isolated network to be transmitted via the hub to the first isolated network. A new entry corresponding to the first entry is included in the second routing table.
CACHE AND MEMORY CONTENT MANAGEMENT
Examples described herein relate to a network interface apparatus that includes an interface; circuitry to determine whether to store content of a received packet into a cache or into a memory, at least during a configuration of the network interface to store content directly into the cache, based at least in part on a fill level of a region of the cache allocated to receive copies of packet content directly from the network interface; and circuitry to store content of the received packet into the cache or the memory based on the determination, wherein the cache is external to the network interface. In some examples, the network interface is to determine to store content of the received packet into the memory based at least in part on a fill level of the region of the cache being identified as full or determine to store content of the received packet into the cache based at least in part on a fill level of the region of the cache being identified as not filled. In some examples, the network interface is to indicate a complexity level of content of the received packet to cause adjustment of a power usage level of a processor that is to process the content of the received packet.
SYSTEM AND METHOD FOR A WEB SCRAPING TOOL
A web scraping system configured with web scraping countermeasure resolution technology.
LOGICAL ROUTER WITH MULTIPLE ROUTING COMPONENTS
Some embodiments provide a method for handling failure at one of several peer centralized components of a logical router. At a first one of the peer centralized components of the logical router, the method detects that a second one of the peer centralized components has failed. In response to the detection, the method automatically identifies a network layer address of the failed second peer. The method assumes responsibility for data traffic to the failed peer by broadcasting a message on a logical switch that connects all of the peer centralized components and a distributed component of the logical router. The message instructs recipients to associate the identified network layer address with a data link layer address of the first peer centralized component.
Load balanced access to distributed endpoints using resiliently advertised global network addresses
Systems and methods are described to enable the load-balanced use of globalized network addresses, addressable throughout a network to access a network-accessible service. A set of global access points are provided, which advertise availability of the globalized network addresses. Globalized network addresses can be divided among different pools, and each service can be associated with addresses of more than one pool. To increase resiliency, access points can advertise different pools of addresses to different neighboring devices, creating different pathways to reach the access point. If an error occurs on a neighboring network, a client can try to access the service via an address of a different pool, which can be expected to be routed through a different neighboring network, thus enabling the client to reach the access point.