动态网络的代数回溯
On Algebraic Traceback in Dynamic Networks
摘要：
本文介绍了增量回溯的概念，用于确定网络随时间演变的轨迹变化。基于Dean等人提出的代数回溯方法，提出了一种分布式算法，该算法可以用O（d）标记的数据包完全确定d个节点/路由器的路径，然后用O（log d）标记的数据包以高概率确定其拓扑结构的变化.该算法被建立为逐阶最优，即，没有其它分布式算法可以使用较低阶的比特来确定路径拓扑的变化（即，标记的分组）。该算法被证明有一个计算复杂性的O（d log d），这是显着低于任何现有的非增量算法的代数回溯。该算法的扩展设置与节点身份欺骗和网络编码。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
