On algebraic traceback in dynamic networks

Abhik Das, Shweta Agrawal, Sriram Vishwanath
2010 2010 IEEE International Symposium on Information Theory  
This paper discusses 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 that can determine a path of d nodes using O(d) marked packets, and subsequently determine the changes in it using O(log d) marked packets. The algorithm is established to be order-wise optimal i.e. no other distributed algorithm can determine changes in
more » ... termine 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 for algebraic traceback. The extension of traceback mechanisms to systems deploying network coding is also considered.
doi:10.1109/isit.2010.5513409 dblp:conf/isit/DasAV10 fatcat:egfm4nhybbg3fgdamsyvgemyqa