A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On algebraic traceback in dynamic networks
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
doi:10.1109/isit.2010.5513409
dblp:conf/isit/DasAV10
fatcat:egfm4nhybbg3fgdamsyvgemyqa