Hopscotchreaching the target hop by hop
We study algebras for the verification of routing protocols in wireless networks. We treat matrices that carry routing information, such as the next hop on a path towards a destination. By this, we can use algebra not only for determining the length of paths, but also the concrete paths. We show how paths can be reconstructed from these matrices, hop by hop. Last, we further sketch an application for message passing in wireless networks.
routing semiring kleene algebra path algebra