We introduce the Deletable Bloom filter (DlBF) as a new spin on the popular data structure based on compactly encoding the information of where collisions happen when inserting elements. The DlBF design enables false-negative-free deletions at a fraction of the cost in memory consumption, which turns to be appealing for certain probabilistic filter applications.

No abstract

Abstract-In this paper we present an in-network caching architecture based on content routers to improve the traffic efficiency in the Internet. The main idea is to provide a forwarding fabric where data requests are forwarded towards the closest caches in the network path. Conversely, data chunks from the servers are cached in the content routers along the path, serving further data requests. In addition, content routers store a neighborhood mapping of available routers, leveraging resource discovery in the network proximity. Some benefits of the architecture include multi-source content retrieval, better traffic efficiency and gradual deployment. As proof-of-concept, we implemented a content router prototype and evaluated it in different scenarios comparing the bandwidth, latency and neighborhood search. The experimental results show that the content router can leverage multi-source content retrieval with bandwidth reduction without incurring in increased latency.

No abstract

Today, the most important aspect related with the Internet architecture is its ossification representing the difficulties to introduce evolutions in the architecture as a way to meet the demands posed by the new requirements as mobility, security, heterogeneity, etc. In this paper we discuss how the network virtualization can be used to support the interdomain QoS-enabled routing. We present the Virtual Topology Service (VTS), a new approach to provide interdomain services taking into account QoS and Traffic Engineering (TE) constraints. We advocate in favor of a service layer that offers new mechanisms for interdomain routing without affecting the underlying Internet infrastructure. The VTS abstracts the physical network details of each Autonomous System (AS) and is totally integrated with BGP. Two models to obtain VTs were defined, the Push Model and the Pull Model. The latter one uses the Internet hierarchy to get more alternative routes towards a destination. We will show how the VTS and other services such as the end-toend negotiation service work together to provide a complete mechanism for provisioning of interdomain QoS- enabled routes in IP networks. Preliminary evaluation results are also presented.

No abstract

The Bloom filter (BF) is a well-known space-efficient data structure that answers set membership queries with some probability of false positives. In an attempt to solve many of the limitations of current inter-networking architectures, some recent proposals rely on including small BFs in packet headers for routing, security, accountability or other purposes that move application states into the packets themselves. In this paper, we consider the design of such inpacket Bloom filters (iBF). Our main contributions are exploring the design space and the evaluation of a series of extensions (1) to increase the practicality and performance of iBFs, (2) to enable false-negative-free element deletion, and (3) to provide security enhancements. In addition to the theoretical estimates, extensive simulations of the multiple design parameters and implementation alternatives validate the usefulness of the extensions, providing for enhanced and novel iBF networking applications.

No abstract