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.
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.
This paper considers auction mechanisms that can allow people to bid for resources in cloud computing environments when resources are constrained.
This paper used a likelihood based framework to create a rigorous way to assess models of networks. Network evolution is broken down into an operation model (it decides the 'type' of change to be made to the network, e.g. "add node" "add link" "remove node" "remove link") and an object model (that decides the exact change -- which node/link to add).
The system is shown to be able to recover known parameters on artificial models and to be useful in analysis of real data.
This work can generate graphs from a very large family with the aim of fitting those graph to parameters of real data sets.
This paper is a development of the earlier ideas in PREFLEX -- http://www.richardclegg.org/node/18
In this case the focus is resilience within a data centre. In particular resilience at the network layer. If several paths are available to a destination the system known as INFLEX can support fail over between paths seamlessly using OpenFlow. In this case the system is tested using Openvswitch.
This paper looks at a markov chain based model and uses queuing theory to analyse its performance. The system is D-BMAP/D/1 and a closed form solution is found
The aim of this paper is to provide a summary and a critique of power law modelling in the internet. Long-range dependence and self-similarity are considered as well as scale-free topology analysis.
This paper looks at the phenomenon of long-range dependence. It shows that certain long-range dependent models give answers which contain infinities and also that this behaviour will not be detected by a naive modelling approach. The work is an extension of an earlier published PMECT paper.
This paper creates software models of how P2P network topologies could wire up. It considers the possible strategies such as connecting to close nodes, connecting to random links and so on. Resilience and delay are considered.