Download now Free registration required
Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. This paper proposes a general framework for designing topology inference algorithms based on additive metrics. The framework allows the integration of both end-to-end packet probing measurements and trace route type measurements. Based on this framework authors design several computationally efficient topology inference algorithms. In particular, they propose a novel sequential topology inference algorithm to address the probing scalability problem and handle dynamic node joining and leaving.
- Format: PDF
- Size: 181.5 KB