Parallel d-Pipeline: A Cuckoo Hashing Implementation for Increased Throughput

Pontarelli, Salvatore; Reviriego, Pedro; Maestro, Juan Antonio

doi:10.1109/tc.2015.2417524

Cited by 31 publications

(18 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we give a brief overview of these protocols. [18], k-anonymity [19], and cuckoo filter [11] are three techniques that can be used to protect the privacy of SUs. Gao et al [20] proposed a PIR-based protocol, in which SUs can obtain available spectrum information from the DB without sending geographic location information.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore, it is urgent to protect the location privacy of the SU during the spectrum query in CRNs. Some protocols based on private information retrieval (PIR) [11,12] or kanonymity [13,14] have been proposed to protect the location privacy of SUs. However, these protocols might cause high computation or communication overheads or cannot provide enough safeguards for location privacy of SUs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Lightweight Privacy Preservation for Securing Large-Scale Database-Driven Cognitive Radio Networks with Location Verification

Zhu

Zeng

et al. 2019

Security and Communication Networks

View full text Add to dashboard Cite

The database-driven cognitive radio networks (CRNs) are regarded as a promising approach to utilizing limited spectrum resources in large-scale Internet of Things (IoT). However, database-driven CRNs face some security and privacy threats. Firstly, secondary users (SUs) should send identity and location information to the database (DB) to obtain a list of available channels, such that the curious DB might easily misuse and threaten the privacy of SUs. Secondly, malicious SUs might send fake location information to the DB in order to occupy channels with better quantity in advance and so gain benefits. This might also cause serious interference to primary users (PUs). In this paper, we propose a lightweight privacy-preserving location verification protocol to protect the identity and location privacy of each SU and to verify the location of SUs. In the proposed protocol, the SU does not need to provide location information to request an available channel from the DB. Therefore, the DB cannot get the location information of any SU. In the proposed protocol, the base station (BS) selects some SUs as witnesses to generate location proofs for each other in a distributed fashion. This new witness selection mechanism makes the proposed protocol reliable when a malicious SU generates fake location information to cheat the BS and also prevents SU-Witness collusion attacks. The results also show that the proposed protocol can provide strong privacy preservation for SUs and can effectively verify the location of the SUs. The security analysis shows that the proposed protocol can resist various types of attacks. Moreover, compared with previous protocols, the proposed protocol is lightweight because it relies on symmetric cryptography and it is unaffected by the area covered by the DB.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Lightweight Privacy Preservation for Securing Large-Scale Database-Driven Cognitive Radio Networks with Location Verification

Zhu

Zeng

et al. 2019

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…The single-table and d-table alternatives provide the same asymptotic performance in terms of memory utilization. When each subtable is placed on a different memory device this enables a parallel search operation that can be completed in one memory access cycle [20]. However, as discussed in the introduction, this is not desirable for external memories, as supporting several external memory interfaces requires increasing the number of pins and memory controllers.…”

Section: Insertionmentioning

confidence: 99%

EMOMA: Exact Match in One Memory Access

Pontarelli

Reviriego

Mitzenmacher

2018

IEEE Trans. Knowl. Data Eng.

Self Cite

View full text Add to dashboard Cite

An important function in modern routers and switches is to perform a lookup for a key. Hash-based methods, and in particular cuckoo hash tables, are popular for such lookup operations, but for large structures stored in off-chip memory, such methods have the downside that they may require more than one off-chip memory access to perform the key lookup. Although the number of off-chip memory accesses can be reduced using on-chip approximate membership structures such as Bloom filters, some lookups may still require more than one off-chip memory access. This can be problematic for some hardware implementations, as having only a single off-chip memory access enables a predictable processing of lookups and avoids the need to queue pending requests.We provide a data structure for hash-based lookups based on cuckoo hashing that uses only one off-chip memory access per lookup, by utilizing an on-chip pre-filter to determine which of multiple locations holds a key. We make particular use of the flexibility to move elements within a cuckoo hash table to ensure the pre-filter always gives the correct response. While this requires a slightly more complex insertion procedure and some additional memory accesses during insertions, it is suitable for most packet processing applications where key lookups are much more frequent than insertions. An important feature of our approach is its simplicity. Our approach is based on simple logic that can be easily implemented in hardware, and hardware implementations would benefit most from the single off-chip memory access per lookup.• S. Pontarelli is with Consorzio Nazionale Interuniversitario per le Telecomunicazioni (CNIT),

show abstract

“…The most direct implementation is to store the d hash tables in a single memory [16]. Another option is to have d memories such that each table is stored in a different memory and all the memories are accessed in parallel [17]. For the case of a single memory, accesses can be sequential or concurrent depending on the implementation.…”

Section: Cuckoo Hashingmentioning

confidence: 99%

Cuckoo Cache: A Technique to Improve Flow Monitoring Throughput

Pontarelli

Reviriego

2016

IEEE Internet Comput.

Self Cite

View full text Add to dashboard Cite

Flow identification is commonly used in traffic monitoring applications as it provides valuable insights into the nature of the traffic. However, implementing it for high speed links is challenging due to the large number of both packets and flows that need to be analyzed. Flow identification can be implemented with Content Addressable Memories (CAMs) or alternatively with hash based data structures. One of the most efficient hash based structures is Cuckoo hashing. This scheme is able to perform a query operation with a fixed number of memory accesses and achieves a very high memory utilization ratio. In this paper, we leverage the uneven distribution of traffic among the network flows to improve the query throughput of Cuckoo hashing. This is done by placing the most frequently used items in the table that is accessed first during the Cuckoo query operation. The proposed scheme is named Cuckoo Cache as conceptually is similar to a cache but that is implemented inside the Cuckoo hash with little additional cost. Cuckoo cache is evaluated using a traffic monitoring application fed with real traces. The results are compared with existing Cuckoo hashing implementations and show significant improvements. Therefore, the proposed scheme can be useful for high speed traffic monitoring implementations.

show abstract

Parallel d-Pipeline: A Cuckoo Hashing Implementation for Increased Throughput

Cited by 31 publications

References 17 publications

Lightweight Privacy Preservation for Securing Large-Scale Database-Driven Cognitive Radio Networks with Location Verification

Lightweight Privacy Preservation for Securing Large-Scale Database-Driven Cognitive Radio Networks with Location Verification

EMOMA: Exact Match in One Memory Access

Cuckoo Cache: A Technique to Improve Flow Monitoring Throughput

Contact Info

Product

Resources

About