Skip to main content
New proof prices the release of a single device from a network rule

New proof prices the release of a single device from a network rule

Dr Clemency Tredinnick's new paper in pure mathematics proves that a rule stated once, high in a cloud, fog and edge hierarchy, is cheap to impose and dear to lift from any single device beneath it.

A School of Settled Matters paper shows that lifting a constraint from one device in a fog hierarchy costs far more than imposing it

What does it cost to let one device off a rule that binds all of its neighbours? In Burdens That Run with the Subtree, Dr Clemency Tredinnick, Lecturer in the School of Settled Matters, gives that question an exact answer, and a proof to go with it.

The paper treats the layered networks that carry connected devices, from the cloud through intermediate fog nodes to the edge, as mathematical objects in their own right, and follows a single constraint as it is stated high up and inherited by everything below. Its theorems establish when the most economical way of stating such a constraint is the only one, when finding it becomes intractable, and why releasing a single device can oblige an operator to restate the rule for every one of its siblings.

A burden is easy to put on and a great deal of work to take off, and I wanted to know precisely how much work. It turns out you can count it.

— Dr Clemency Tredinnick, Lecturer, School of Settled Matters

The publication extends the School’s standing interest in what binds, and for how long, into the infrastructure of connected computing, and the University regards that kind of reach across disciplines as the natural habit of a research culture that takes its questions wherever they lead. Dr Tredinnick described the paper as “the land-law course, conducted in lemmas”, and said she expected its open conjecture to keep her occupied for some time.

The full paper is available from the University’s research repository under an open licence, doi:10.5555/slop.ncrgdv.