Muccifora
Roberto Muccifora, Lausanne CH
Patent application number | Description | Published |
---|---|---|
20140040317 | METHODS AND APPARATUSES FOR IMPROVING DATABASE SEARCH PERFORMANCE - Methods and apparatuses for improving performance of database searches are disclosed herein. For example, in some implementations, the methods and apparatuses use a data node structure that prevents the need to duplicate data nodes shared by a plurality of data trees. Additionally, the methods and apparatus facilitate improved database lookup times by implementing an adaptive presence detection system based on the Bloom Filter, performance characteristics of the computing device evaluated at run time and status of the database. | 02-06-2014 |
Roberto Muccifora, Ropraz (vd) CH
Patent application number | Description | Published |
---|---|---|
20150358435 | FLOW MATCHING OPTIMIZATION IN SCALED ENVIRONMENTS - In one embodiment, a method includes identifying at a network device, a number of items for matching at a hash table, the number of items exceeding matching available with ternary content addressable memory (TCAM) at the network device, defining at the network device, an optimal cyclic redundancy check (CRC) polynomial based on the number of items for matching at the hash table, and generating at the network device, an optimal hash function based on the optimal CRC polynomial to extend packet classification capability at the network device. An apparatus is also disclosed herein. | 12-10-2015 |
Roberto Muccifora, Ropraz CH
Patent application number | Description | Published |
---|---|---|
20160112308 | SPARSE GRAPH CODING SCHEDULING FOR DETERMINISTIC ETHERNET - Embodiments provide techniques for transmitting data packets across a deterministic Ethernet network. Embodiments receive, at a first device in the deterministic Ethernet network, a deterministic binary schedule specifying timing information for transmitting data fragments relating to a plurality of data flows. Data packets to transmit to a destination device within the deterministic Ethernet network are received at the first device. Embodiments include fragmenting each of the data packets into two or more fragments and encoding at least one of the two or more fragments for each of the data packets with a respective sparse graph code. The encoded fragments are transmitted to the destination device, across multiple paths through the deterministic Ethernet network, according to timing information specified in the deterministic binary schedule. | 04-21-2016 |