Kadupul: Livin' on the edge with virtual currencies and time-locked puzzles

Devices connected to the Internet today have a wide range of local communication channels available, such as wireless Wifi, Bluetooth or NFC, as well as wired backhaul. In densely populated areas it is possible to create heterogeneous, multihop communication paths using a combination of these technologies, and often transmit data with lower latency than via a wired Internet connection. However, the potential for sharing meshed wireless radios in this way has never been realised due to the lack of economic incentives to do so on the part of individual nodes. In this paper, we explore how virtual currencies such as Bitcoin might be used to provide an end-to-end incentive scheme to convince forwarding nodes that it is profitable to send packets on via the lowest latency mechanism available. Clients inject a small amount of money to transmit a datagram, and forwarding engines compete to solve a time-locked puzzle that can be claimed by the node that delivers the result in the lowest latency. This approach naturally extends congestion control techniques to a surge pricing model when available bandwidth is low. We conclude by discussing several latency-sensitive applications that would benefit for this, such as video streaming and local augmented reality systems.The research leading to these results has received funding from the European Union's Seventh Framework Programme FP7/2007-2013 under Trilogy 2 project, grant agreement no 317756.This is the author accepted manuscript. The final version is available from ACM via http://dx.doi.org/10.1145/2753488.275349

Privacy Butler: A personal privacy rights manager for online presence.

The online presence projected by a person is comprised of all the information about them available on the Internet. In online communities and social networking services, it is often possible for third-parties to modify this content by, for example, commenting on existing content or uploading new content. This has the potential to negatively impact the privacy of a presence owner (the person referred to by the on-line content) by disclosing information about them without consent. In this paper we propose a Privacy Butler, an automated service that can monitor a persons online presence and attempt to make corrections based on policies specified by the owner of the online presence. © 2010 IEEE.Accepted versio

Personal Data: Thinking Inside the Box

We are in a ‘personal data gold rush’ driven by advertising being the primary revenue source for most online companies. These companies accumulate extensive personal data about individuals with minimal concern for us, the subjects of this process. This can cause many harms: privacy infringement, personal and professional embarrassment, restricted access to labour markets, restricted access to highest value pricing, and many others. There is a critical need to provide technologies that enable alternative practices, so that individuals can par- ticipate in the collection, management and consumption of their personal data. In this paper we discuss the Databox, a personal networked device (and associated services) that col- lates and mediates access to personal data, allowing us to re- cover control of our online lives. We hope the Databox is a first step to re-balancing power between us, the data subjects, and the corporations that collect and use our data.Work supported in part by the EU FP7UCN project, grant agreement no 611001

FLICK: developing and running application-specific network services

Data centre networks are increasingly programmable, with application-specific network services proliferating, from custom load-balancers to middleboxes providing caching and aggregation. Developers must currently implement these services using traditional low-level APIs, which neither support natural operations on application data nor provide efficient performance isolation. We describe FLICK, a framework for the programming and execution of application-specific network services on multi-core CPUs. Developers write network services in the FLICK language, which offers high-level processing constructs and application-relevant data types. FLICK programs are translated automatically to efficient, parallel task graphs, implemented in C++ on top of a user-space TCP stack. Task graphs have bounded resource usage at runtime, which means that the graphs of multiple services can execute concurrently without interference using cooperative scheduling. We evaluate FLICK with several services (an HTTP load-balancer, a Memcached router and a Hadoop data aggregator), showing that it achieves good performance while reducing development effort

A modular foreign function interface

Foreign function interfaces are typically organised monolithically, tying together the $\textit{specification}$ of each foreign function with the $\textit{mechanism }$ used to make the function available in the host language. This leads to inflexible systems, where switching from one binding mechanism to another (say from dynamic binding to static code generation) often requires changing tools and rewriting large portions of code. We show that ML-style module systems support exactly the kind of abstraction needed to separate these two aspects of a foreign function binding, leading to declarative foreign function bindings that support switching between a wide variety of binding mechanisms — static and dynamic, synchronous and asynchronous, etc. — with no changes to the function specifications. Note. This is a revised and expanded version of an earlier paper, $\textit{Declarative Foreign Function Binding Through Generic Programming.}$ This paper brings a greater focus on modularity, and adds new sections on error handling, and on the practicality of the approach we describe