This is a talk about TCP throughput and how it relates to network parameters such as delay, loss and flow length. The full paper is the ICC paper.
- Workshop paperDemo and Doctoral Workshop DEBS (Distributed and Event Based Systems)
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.
- Conference paperProc. USENIX ATC
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.
- Workshop paperACM MobiSys (Demo)
This demo shows how Apple's iBeacon technology can be used to track groups of people who are moving together in a crowd.
- Journal PaperTransactions on Cloud Computing (to appear)
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.
- Journal PaperComputer Networks
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.
- Workshop paperHuman Activity Sensing Corpus and Applications Workshop
This paper looks at how sensor measurements in mobile phones can be used to determine when people are talking in a group.
- Conference paperUSENIX ATC
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.
- Conference presentationLocation:USENIX ATCSlides:Comments:
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.
- Journal PaperTransactions on Networks and Service Management
This paper considers auction mechanisms that can allow people to bid for resources in cloud computing environments when resources are constrained.
- Conference paperProc. of International Conference on Telecommunications
This paper looks at a new way to use multiple channels in ad-hoc sensor networks. It consists of two parts:
1) A protocol that allows a node, when sent a particular message, to attempt to change channel (reliably with a fall-back if the new channel is subject to interference).
2) An algorithm run at a single "command" node that selects which nodes should change channel according to a graph colouring problem.
The work is tested in simulation using Cooja (which simulates Contiki based sensor nodes).