Bloom filters and Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error. Unlike Bloom filters, CBFs also support element deletions. In the first part of the talk, I will introduce a new general method based on variable increments to improve the efficiency of CBFs and their variants....

Transactional Memory (TM) systems ease multithreaded application development by giving the programmer the ability to specify that some regions of code, called transactions, must be executed atomically. To achieve high efficiency, TM systems optimistically try to execute multiple transactions concurrently and either stall or abort some of them if a conflict occurs. A conflict happens if two or m...

Designing secure data aggregation schemes, which are critical to many sensor network applications, imposes interesting and formidable challenges. In this paper, we propose a succinct and practical secure aggregation protocol by combining HMAC (associated with a cryptographic hash function) with Bloom filter, which then is defined as secure Bloom filter. Unlike most previous approaches, which ar...

The advertising network considered as the middle man in web advertising between advertisers and publishers. This paper presented an intelligent and memory efficient Fraud detection technique with intelligent classification engine to be used by the advertising networks to scan clicks and impressions offline streams happen on publisher side for the purpose of detecting click fraud and impression ...

In dynamic environment of data grid effective job scheduling methods consider location of required data in dispatching jobs to resources. Also, job scheduling methods are combined with data replication mechanisms to reduce remote data access as well as save network bandwidth. In this paper, we combine job scheduling method and dynamic data replication to reduce data access delay and job executi...

Bloom filters are heavily used in the literature for efficiently representing sets with elements from a large universe. However, the current literature lacks some important functionality on bloom filters which can be proven useful in several application domains, especially in distributed and P2P systems. This work presents some of these extensions. The work is motivated from our current researc...

We examine query based (QB) and Bloom filter based (BF) schemes for data retrieval in a partially connected ad hoc network. For the QB scheme, a node retrieves data from another node by querying. Search efficiency deteriorates when the query success probability is small. We propose a Bloom filter based (BF) scheme to improve search efficiency. A data holder summarizes its content by a Bloom fil...

Implementation of the Bloom filter for plagiarism detection in full text document has a problem on how to identify the same terms from different location. Location identifier can be hashed in offline mode since the collection is static. By this approach, the computation speed of the Bloom filter can be improved. Two new Bloom filter architectures are proposed in this study to overcome the probl...