Patent classifications
H04L45/7453
Packet generation-based bidirectional forwarding detection
A method of performing bidirectional forwarding detection (BFD) by a hardware forwarding element that includes a set of ingress pipelines and a set of egress pipelines. Each ingress pipeline includes a packet generator. A packet generator in a first pipeline periodically generates a pair of packets to monitor the health of a particular egress link. The pair includes a BFD transmit packet and a BFD dummy transmit packet. The method forwards each dummy BFD transmit packet to a first egress pipeline and increments a counter at the first egress pipeline. Each BFD packet is transmitted through the particular egress link to a network node. BFD packets received from the network node are forwarded to the first egress pipeline and the value of the counter is rest. The method marks the particular egress link as failed when the value of the counter exceeds a predetermined threshold.
Methods and apparatus for improving load balancing in overlay networks
An apparatus includes a virtual switch hosted at a first network device. The virtual switch is configured to receive a data packet from a first virtual resource hosted at the first network device to be sent to a second virtual resource hosted at a second network device. The virtual switch is configured to encapsulate the data packet to define an encapsulated data packet using a tunnel header, which has a first portion associated with the first and second network devices, and a second portion associated with a data flow between the first and second virtual resources when the data packet is sent from the first network device to the second network device. An Internet Protocol network can use the second portion of the tunnel header to load balance the data packet with respect to other data packets sent from the first network device to the second network device.
Data storage management and resource scaling
Aspects of the present disclosure relate to managing data storage resources. In embodiments, one or more data streams are received. Each data stream can include one or more data portions. Further, one or more storage parameters are monitored. Each storage parameter can include data input load of each data stream, data write rate of each stream, number of events in each stream, and data ingestion rates of one or more storage devices. Data storage resources are elastically scales based on any changes to the at least one monitored storage parameter.
Data storage management and resource scaling
Aspects of the present disclosure relate to managing data storage resources. In embodiments, one or more data streams are received. Each data stream can include one or more data portions. Further, one or more storage parameters are monitored. Each storage parameter can include data input load of each data stream, data write rate of each stream, number of events in each stream, and data ingestion rates of one or more storage devices. Data storage resources are elastically scales based on any changes to the at least one monitored storage parameter.
Overlay network routing using a programmable switch
The techniques discussed herein include storing a fast-path and a slow-path table in a memory associated with a programmable switch, such as a cache of the programmable switch. An offload controller may control the contents of the fast-path and/or slow-path table and may thereby control behavior of the programmable switch. The programmable may route a received packet to a gateway if the packet generates a hit in the slow-path table. If the received packet generates a hit in the fast-path table, the packet may be forwarded directly to a virtual private cloud (VPC), virtual switch thereof, and/or to a virtual machine (VM).
UNIFIED STORAGE SYSTEM FOR ONLINE IMAGE SEARCHING AND OFFLINE IMAGE ANALYTICS
According to one embodiment, a master storage node receives a search query for searching images from a client, where the master storage node is coupled to a number of worker storage nodes over a storage network. The master storage node performs a hash operation on one or more keywords of the search query using a first predetermined hash function, generating a first hash value. A first of the worker storage nodes is identified based on the first hash value. The master storage node redirects the search query to the first worker storage node to allow the first worker storage node service the search query. The first worker storage node is to identify one or more images from a first system memory of the first worker storage node based on the search query and to transmit the one or more images to the client.
Distributed storage system, control apparatus, client terminal, load balancing method and program
A distributed storage system includes: a plurality of servers that store data that is associated with key information, respectively; a packet forwarding apparatus that, on receipt of a new packet that contains the key information and is addressed to one of the plurality of servers, requests a control apparatus to decide a forwarding destination from among the plurality of servers; and the control apparatus. The control apparatus includes: a forwarding destination selection section that decides a forwarding destination of the packet based on key information in a header part of the packet; and an entry setting section that sets, in a packet forwarding apparatus(es) on a path to the forwarding destination, a flow entry for forwarding a subsequent packet(s) with same key information to the forwarding destination. The packet forwarding apparatus(es) forwards a packet(s) with the same key information to the forwarding destination using the set flow entry.
Methods and systems for transmitting packets through an aggregated connection
The present invention discloses methods and systems for transmitting a received packet at a first network node through an aggregated connection. The first network node determines session information of the received packet and determines whether a new tunnel needs to be selected for transmitting the received packet. When a new tunnel needs to be selected, a hash result is determined. The hash result is substantially based on the session information and the number of available tunnels. A first tunnel is determined for transmitting the received packet according to the hash result. The session information and tunnel ID of the first tunnel is then stored in a first database. The received packet is transmitted through the first tunnel. When a new tunnel need not be selected, a lookup is performed to determine a tunnel ID substantially based on the session information. The received packet is transmitted through the determined tunnel.
Network Devices
The present disclosure is related to systems, methods, and processor readable media for distributing digital data over networks. Certain embodiments relate to systems, methods, and devices used within such networks where at least a substantial portion of the interconnected devices are capable of interacting with one or more neighbouring devices, and then to form such a time synchronous network using local network information.
Single Double Cuckoo Hash
In a network element a decision apparatus has a plurality of multi-way hash tables of single size and double size associative entries. A logic pipeline extracts a search key from each of a sequence of received data items. A hash circuit applies first and second hash functions to the search key to generate first and second indices. A lookup circuit reads associative entries in the hash tables that are indicated respectively by the first and second indices, matches the search key against the associative entries in all the ways. Upon finding a match between the search key and an entry key in an indicated associative entry. A processor uses the value of the indicated associative entry to insert associative entries from a stash of associative entries into the hash tables in accordance with a single size and a double size cuckoo insertion procedure.