3 papers
cs.DC2019
Improving In-Network Computing in IoT Through Degeneracy
Merim Dzaferagic, Neal McBride, Ryan Thomas +2
We present a novel way of considering in-network computing (INC), using ideas from statistical physics. We define degeneracy for INC as the multiplicity of possible options availab…
cs.DM2017
A local graph rewiring algorithm for sampling spanning trees
Neal McBride, John Bulava
We introduce a Markov Chain Monte Carlo algorithm which samples from the space of spanning trees of complete graphs using local rewiring operations only. The probability distributi…
cs.SI2016
A Functional Complexity Framework for the Analysis of Telecommunication Networks
Merim Dzaferagic, Nicholas Kaminski, Neal McBride +2
The rapid evolution of network services demands new paradigms for studying and designing networks. In order to understand the underlying mechanisms that provide network functions,…