Entity

Time filter

Source Type

Palo Alto, CA, United States

Jeyakumar V.,Stanford University | Alizadeh M.,Cisco Systems | Geng Y.,Stanford University | Kim C.,Barefoot Networks | Mazieres D.,Stanford University
SIGCOMM 2014 - Proceedings of the 2014 ACM Conference on Special Interest Group on Data Communication | Year: 2014

This paper presents a practical approach to rapidly introducing new dataplane functionality into networks: End-hosts embed tiny programs into packets to actively query and manipulate a network's internal state. We show how this "tiny packet program" (TPP) interface gives end-hosts unprecedented visibility into network behavior, enabling them to work with the network to achieve a desired functionality. Our design leverages what each component does best: (a) switches forward and execute tiny packet programs (at most 5~ instructions) in-band at line rate, and (b) end-hosts perform arbitrary (and easily updated) computation on network state. By implementing three different research proposals, we show that TPPs are useful. Using a hardware prototype on a NetFPGA, we show our design is feasible at a reasonable cost. © 2014 ACM.


Trademark
Barefoot Networks | Date: 2016-05-18

Integrated circuits; computer networking systems, namely, computer hardware and software for computer networks.


Trademark
Barefoot Networks | Date: 2016-06-02

Integrated circuits.


Trademark
Barefoot Networks | Date: 2016-06-14

Software development kit for developing software for integrated circuits.


Patent
Barefoot Networks | Date: 2014-10-06

Some embodiments of the invention provide novel methods for storing data in a hash-addressed memory and retrieving stored data from the hash-addressed memory. In some embodiments, the method receives a search key and a data tuple. The method then uses a first hash function to generate a first hash value from the search key, and then uses this first hash value to identify an address in the hash-addressed memory. The method also uses a second hash function to generate a second hash value, and then stores this second hash value along with the data tuple in the memory at the address specified by the first hash value. To retrieve data from the hash-addressed memory, the method of some embodiments receives a search key. The method then uses the first hash function to generate a first hash value from the search key, and then uses this first hash value to identify an address in the hash-addressed memory. At the identified address, the hash-addressed memory stores a second hash value and a data tuple. The method retrieves a second hash value from the memory at the identified address, and compares this second hash value with a third hash value that the method generates from the search key by using the second hash function. When the second and third hash values match, the method retrieves the data tuple that the memory stores at the identified address.

Discover hidden collaborations