On Algebraic Traceback in Dynamic Networks

TL;DR

This paper presents an efficient distributed algebraic traceback algorithm for dynamic networks that accurately determines path changes with minimal packet overhead, improving upon existing methods in complexity and adaptability.

Contribution

It introduces an incremental traceback algorithm for dynamic networks based on algebraic traceback, with optimal packet complexity and extensions for spoofing and network coding.

Findings

Determines network path changes using O(log d) marked packets.

Achieves computational complexity of O(d log d).

Extends to scenarios with node spoofing and network coding.

Abstract

This paper introduces the concept of incremental traceback for determining changes in the trace of a network as it evolves with time. A distributed algorithm, based on the methodology of algebraic traceback developed by Dean et al, is proposed which can completely determine a path of d nodes/routers using O(d) marked packets, and subsequently determine the changes in its topology using O(log d) marked packets with high probability. The algorithm is established to be order-wise optimal i.e., no other distributed algorithm can determine changes in the path topology using lesser order of bits (i.e., marked packets). The algorithm is shown to have a computational complexity of O(d log d), which is significantly less than that of any existing non-incremental algorithm of algebraic traceback. Extensions of this algorithm to settings with node identity spoofing and network coding are also presented.