Abstract: A method for weighted data traffic routing can include generating an integer hash value based on a header of a data packet and encoding the integer hash value to generate a search key for a content addressable memory included in the data switch. The method can also include performing a lookup in the content addressable memory to match the search key with one of a plurality of prefixes stored in the content addressable memory, the plurality of prefixes including an encoded set of routing weights associated with a plurality of egress ports of the data switch. The method can further include forwarding the data packet on an egress port of the plurality of egress ports associated with the one of the plurality of prefixes in the content addressable memory.

Abstract: Aspects and implementations of the present disclosure are directed to methods and systems for a network tolerant to a network device that is temporarily absent from the control plane. In one aspect, in general, the system includes an event manager configured to send, to a controller configured to exchange control messages with a network device, a first request to temporarily withdraw the network device from control plane interactions. The event manager then triggers an event at the network device during which the network device is non-responsive to control plane interactions. After determining that the event has completed, the event manager sends the controller a second request to restore the network device. The controller is configured to request, responsive to the first request, a network application to transition to a tolerant state; and to request, responsive to the second request, the network application to transition to a sensitive state.

Abstract: Systems and techniques for prioritizing network traffic based on a flow deadline are presented. Data bandwidth in a network is detected. In response to congestion in the network, a transmission control protocol (TCP) window size is reduced. The TCP window size is reduced based on time remaining until the flow deadline. In one example, the TCP window size if further reduced based on a degree of congestion in the network. In response to no congestion in the network, the TCP window size is increased by a predetermined amount.

Abstract: An architecture and method for data storage and retrieval which also addresses a number of key problems associated with systems employing hash-based techniques. The architecture and method employs a collision-free hashing scheme called Bloomier filter while eliminates its false positives in a storage efficient way. Wildcard support is added through the use of a scheme called prefix collapsing, while introducing only a small additional storage requirement and reduced hardware complexity. Real update traces indicate that both fast and incremental updates are provided—features generally not available in prior-art collision-free hashing schemes.

Abstract: An architecture and method for data storage and retrieval which also addresses a number of key problems associated with systems employing hash-based techniques. The architecture and method employs a collision-free hashing scheme called Bloomier filter while eliminates its false positives in a storage efficient way. Wildcard support is added through the use of a scheme called prefix collapsing, while introducing only a small additional storage requirement and reduced hardware complexity. Real update traces indicate that both fast and incremental updates are provided—features generally not available in prior-art collision-free hashing schemes.