MoN16 2017: Sixteenth Mathematics of Networks meeting– University of Sussex

The 16th Mathematics of Networks meeting (MoN16) was be held at the University of Sussex, on Tuesday 12th September 2017 hosted by the Informatics Department. Thanks to Luc Berthouze, George Parisis, Ian Wakeman for acting as local hosts for MoN16. MoN16 was sponsored by Moogsoft. The theme of this meeting was control and management of networks.

About Mathematics of Networks

MoN is an informal series of meetings that has now been running since 2003. The series encourages interdisciplinary communication in networking research. It is an excellent venue for presenting new ideas or gaining a wider audience for established research. Presentations on any aspect of networking are welcomed, particularly if the techniques or conclusions are applicable in other networking disciplines. Attendance is free of charge.

Information and slides from previous meetings are available.

Attending Mathematics of Networks

Mathematics of Networks is always free to attend but you must register to do so. To register please email Richard G. Clegg and mailto:keith.briggst_at_bt_dot_com. To receive updates on this meeting or to hear about future meetings in the series, please join the mailing list.

MoN16 timetable

The abstracts and talks are linked from this timetable.

10:45-11:20 Welcome, registration and coffee
11:20-11:30 Opening remarks
Session 1: Design problems in networks
11:30-12:15 Sotiris Skaperas – Change point detection analysis for load balancing based on content popularity (abstract) (slides – PDF) (video)
12:15-13:00 Ben Parker – Optimal design of experiments on connected units (abstract) (slides – PDF) (video)
13:00-14:00 Lunch
Session 2: Modelling computer networks
14:00-14:45 Antoine Messager – Inferring the functional topology of a computer network from sparse alert time series emitted by its nodes (abstract) (slides – pptx) (video)
14:45-15:30 James Hodgson – Queue-based metamorphosis: Outlining a challenge in reproducing the real-world computer network (abstract) (slides – PDF) (video)
15:30-16:00 Coffee break
Session 3: Control of cellular networks
16:00-16:45 Alexander Kartun-Giles – Euclidean matchings in ultra-dense spatial communication networks (abstract) (slides – PDF)
16:45-17:30 Aaron Pim – Stability and rate of convergence of resource allocation within a cellular network (abstract) (slides – PDF)
17:30 Closing remarks – drinks in nearby hostelry


Registered participants

Contact: Keith Briggs (mailto:keith.briggs_at_bt_dot_com) or Richard G. Clegg (