Documentation Hypergraph Routing Consensus Paths Latency cost functions

Latency cost functions

We compute path costs using weight functions over active hyperedges.

Weight Formulation

The latency cost $C(e)$ for a hyperedge $e$ connecting nodes ${n_1, n_2, \dots, n_k}$ is formulated as:

$$C(e) = \sum_{i=1}^{k} \omega(n_i) + \delta(e)$$

Where $\omega(n_i)$ represents node processing delay and $\delta(e)$ represents propagation delay.