Research about modelling aspects of networks.

Likelihood based framework for evolving graphs

Submitted by richard on Wed, 01/15/2014 - 15:40
UCL Statistics

This talk is the latest of my talks about FETA the framework for evolving topology analysis. This uses updated notation. The core of the work is a likelihood based model which can assess how likely it is that observations of the evolution of a graph arise from a particular probabilistic model, for example a model such as the Barabassi-Albert preferential attachment model. Analysis is given to data from Facebook and from Enron as well as from artificial models.

Criticisms of modelling packet traffic using long-range dependence (extended version)

Submitted by richard on Sun, 10/27/2013 - 16:16
Journal of Computer and System Sciences, 77(5)

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.

Balancing by PREFLEX: Congestion Aware Traffic Engineering

Submitted by richard on Sun, 10/27/2013 - 00:59
Networking 2011, Lecture Notes in Computer Science (6641)

This paper considers the problem of balancing traffic across network egresses. It achieves a workable solution using a scalable packet market scheme which couples end-hosts controlling their own connection with an overall controller which can select routes appropriately for each flow.

The flows are balanced to seek paths which minimise loss.