Richard G. Clegg

Learn More
Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Internet, from security and content naming and resolution, to caching at routers, and new flow models. In this paper, we study the caching part of the proposed networking paradigm in(More)
This paper describes, in detail, techniques for measuring the Hurst parameter. Measurements are given on artificial data both in a raw form and corrupted in various ways to check the robustness of the tools in question. Measurements are also given on real data, both new data sets and well-studied data sets. All data and tools used are freely available for(More)
This thesis describes describes a small number of problems arising from the applied study of networks in various contexts. The work can be split into two main areas: telecommunications networks (particularly the Internet) and road networks. In the area of telecom networks, this research focuses on current mathematical developments concerning long-range(More)
This paper takes a critical look at the usefulness of power law models of the Internet. The twin focuses of the paper are Internet traffic and topology generation. The aim of the paper is twofold. Firstly it summarises the state of the art in power law modelling particularly giving attention to existing open research questions. Secondly it provides insight(More)
Virtual Networks are characterised as highly dynamic network environments, where topologies and nodes adapt rapidly to changes in user and service demands, user location and context changes, or resource constraints. This paper presents a rigorous assessment of an Information Management Overlay (IMO) suitable for monitoring virtual networks. The IMO system(More)
As Software Defined Networking (SDN) and in particular OpenFlow (OF) availability increases, the desire to extend its use in other scenarios appears. It would be appealing to include substantial parts of the network under OF control but until recently this implied replacing much of the hardware with OF enabled versions. There are some cases, such as access(More)
When designing distributed systems and Internet protocols, designers can benefit from statistical models of the Internet that can be used to estimate their performance. However, it is frequently impossible for these models to include every property of interest. In these cases, model builders have to select a reduced subset of network properties, and the(More)
Existing methods for traffic resilience at the network and transport layers typically work in isolation, often resorting to inference in fault detection and recovery respectively. This both duplicates functionality across layers, eroding efficiency, and leads to protracted recovery cycles, affecting responsiveness. Such misalignment is particularly at odds(More)
This paper considers fundamental measurements which drive TCP flows: throughput, RTT and loss. It is clear that throughput is, in some sense, a function of both RTT and loss. In their seminal paper Padyhe et al [1] begin with a mathematical model of the TCP sliding window evolution process and come up with an equation showing that TCP throughput is(More)
Although direct reciprocity (Tit-for-Tat) contribution systems have been successful in reducing freeloading in peerto-peer overlays, it has been shown that, unless the contribution network is dense, they tend to be slow (or may even fail) to converge [1]. On the other hand, current indirect reciprocity mechanisms based on reputation systems tend to be(More)