11 citations · 11 across the 1 of their papers we have counts for
3 papers
cs.CR2016
The Mathematical Foundations for Mapping Policies to Network Devices (Technical Report)
Dinesha Ranathunga, Matthew Roughan, Phil Kernick +1
A common requirement in policy specification languages is the ability to map policies to the underlying network devices. Doing so, in a provably correct way, is important in a secu…
math.ST2015
Estimating the Parameters of the Waxman Random Graph
Matthew Roughan, Jonathan Tuke, Eric Parsonage
The Waxman random graph is a generalisation of the simple Erdős-Rényi or Gilbert random graph. It is useful for modelling physical networks where the increased cost of longer links…
cs.DB2015★ 11 cited
Unravelling Graph-Exchange File Formats
Matthew Roughan, Jonathan Tuke
A graph is used to represent data in which the relationships between the objects in the data are at least as important as the objects themselves. Over the last two decades nearly a…