Submitted by richard on
This paper looks the problem of releasing time-series data when privacy is a concern. It uses information theory to look at what extra information could "leak" if our device sends motion data. For example, can users be reidentified or can features such as height and weight be determined. A machine learning framework is given that can produce a tradeoff between allowing useful data to pass through while distorting the signal minimally to disguise information we wish to be private.
Submitted by richard on
This paper describes the Raphtory system which is used to analysis large-scale time-varying graph systems. It can ingest streaming graph information and store the complete graph history. It enables queries to be made over the graphs at different points in that graph's history.
Submitted by richard on
This work in progress was accepted as a Demo and at the Doctoral workshop for DEBS (Distributed and Event-Based Systems). It shows the early development of a system that ingests events and can create (and eventually query) a dynamic graph.
Submitted by richard on
This paper describes a C# library that can be used to build networked programs which can compile to several target hardware and software platforms. This greatly eases development and debugging. The system is tested using NetFPGA as a target and performs almost as well as hand tuned code.
Submitted by richard on
This demo shows how Apple's iBeacon technology can be used to track groups of people who are moving together in a crowd.
Submitted by richard on
This paper is a simulation based study of cloud assisted multi-user video streaming. It is based upon two use cases (one related to video poker the other related to MOOCs). The paper looks at strategies for placing cloud locations to facilitate streaming using Amazon EC2 cloud locations. The paper compares a strategy that dynamically picks new locations for cloud hosts as time goes on. Interestingly this seems to provide little benefit compared with simply having a good initial choice of sites even when users may drop into and out of a cloud chat session over the course of many hours.
Submitted by richard on
This paper is a considerably expanded version of the INFOCOM paper.
Again it argues that TCP is no longer mainly controlled by loss and congestion but instead by algorithms and settings under the control of the sender or receiver deliberately or accidentally designed to restrict throughput for a variety of reasons (for example limiting video sending to the rate at which the viewer is watching).
It contains extended discussion of the methodology and in particular how flight and RTT data was extracted from passive traces.
Submitted by richard on
This paper looks at how sensor measurements in mobile phones can be used to determine when people are talking in a group.
Submitted by richard on
This paper describes a system for middleboxes that process application level data -- that is reconstructed TCP flows not packets. The system consists of three parts:
1) A language specific to middleboxes that can quickly express data formats and how to process them but in a "safe" way that allows middleboxes to co-exist on the same physical hardware.
2) An abstraction, the task graph, that breaks middlebox logic into small, parallelisable logical units (tasks) connected by channels through which data flows.
3) A system that allows the compiled code to execute in a performant way.
Submitted by richard on
This talk describes FLICK a system for the application-specific middlebox. It consists of three parts:
1) A domain specific language for the middlebox that allows easy development of typical middlebox functions.
2) An abstraction, the task graph, that allows the breaking of middlebox functions into easily parallelisable work units.
3) The system -- this implements the compiled language, handles TCP connections and memory management.
The whole system is comparable in speed to a specialist implementation.