The advancement of technologies such as IPTV, online gaming and content delivery networks require efficient bandwidth utilization for scalability and resource conservation. IP multicast, an elusive solution, is a thoroughly explored research area. The stateful nature of IP multicast and other problems such as complexity of management make it a questionable solution for deployment on global scal...

Prior studies of the phytoplankton dynamics in South San Francisco Bay, California, USA have hypothesized that bivalve filter-feeders are responsible for the limited phytoplankton blooms in the system. This study was designed to examine the effects of benthic grazing and light attenuation on this shallow, turbid, and nutrient replete system. We found that grazing by shallow water bivalves was i...

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy EFFICIENT DATA STRUCTURES AND PROTOCOLS WITH APPLICATIONS IN SPACE-TIME CONSTRAINED SYSTEMS By Yan Qiao May 2014 Chair: Shigang Chen Major: Computer Engineering Space-time efficient data structures can benefit many application systems. S...

The first several packets of a flow play key role in the on-line traffic managements. Early traffic sampling, extracting the first several packets of every flow, is raised. This paper proposes a structure named CTBF, combination of counting Bloom Filter and time Bloom Filter. Based on it, the algorithm is designed to realize automatically removing the space occupied by the timeout flow. The ana...

Within packet processing systems, lengthy memory accesses greatly reduce performance. To overcome this limitation, network processors utilize many different techniques, for example, utilizing multilevel memory hierarchies, special hardware architectures, and hardware threading. In this paper, we introduce a multilevel memory architecture for counting Bloom filters. Based on the probabilities of...

In this paper we consider the problem of designing a data structure that can perform fast multiset membership testing in deterministic time. Our primary goal is to develop a hardware implementation of the data structure which uses only embedded memory blocks. Prior efforts to solve this problem involve hashing into multiple Bloom filters. Such approach needs a priori knowledge of the number of ...

Bloom filters are a probabilistic data structure used to evaluate set membership. A group of hash functions are used to map elements into a Bloom filter and to test elements for membership. In this paper, we propose using multiple groups of hash functions and selecting the group that generates the Bloom filter instance with the smallest number of bits set to 1. We evaluate the performance of th...

AnoNotify is a service for private, timely and low-cost online notifications. We present the design and security arguments behind AnoNotify, as well as an evaluation of its cost. AnoNotify is based on mixnetworks, Bloom filters and shards. We present a security definition and security proofs for AnoNotify. We then discuss a number of applications, including notifications for incoming messages i...

0141-9331/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.micpro.2009.09.002 * Corresponding author. Tel.: +82 2 3290 4843. E-mail addresses: [email protected] (G. Lee), ysh uic.edu (H. Lin). 1 Tel.: +1 312 413 3148. This paper presents a micro-architectural enhancement, named Indirect Branch Validation Unit (IBVU), to prevent malicious attacks from compromising the control data of the pr...

The ability to discovery services is the major prerequisite for effective usability of MANETs. Broadcasting and caching service advertisements is an essential component in service discovery protocols for MANETs. To fully utilize the advantage of the cache service advertisements, the cached service description can be advertised with the local service description in a vicinity, which however will...