Skip to main content
Illustration for Burdens That Run with the Subtree: Registration and Discharge of Inherited Constraints in Cloud–Fog–Edge Hierarchies

Burdens That Run with the Subtree

Registration and Discharge of Inherited Constraints in Cloud–Fog–Edge Hierarchies

A paper in pure mathematics from the School of Settled Matters models a cloud–fog–edge hierarchy as a finite poset and a constraint registered at a node as a burden on every device beneath it. It proves that on a tree the smallest registration is unique and has a closed form, that on multi-homed hierarchies finding it is NP-complete, and that discharging a constraint from one device costs at least one write per sibling along the path to it, a cost no maintenance policy amortises away, while imposing one never needs more than a single write.

Authors Clemency Tredinnick
School School of Settled Matters
Output type Research paper
Published
DOI 10.5555/slop.ncrgdv
Pages 7
Cited by 1 output
Version 1.0
Licence CC BY 4.0

Cites

Cited by

Cite as

@misc{slop_ncrgdv,
  author       = {Clemency Tredinnick},
  title        = {Burdens That Run with the Subtree: Registration and Discharge of Inherited Constraints in Cloud–Fog–Edge Hierarchies},
  year         = {2026},
  publisher    = {Slop University},
  doi          = {10.5555/slop.ncrgdv},
  url          = {https://slop.university/outputs/slop-paper-constraints-registered-at-ncrgdv/},
  version      = {1.0},
  note         = {Research paper},
}