An Inference Routing Tree Topology Algorithm for Reducing Overhead in Packet Probing

Network structure (Topology) and Node dynamics (Links) are essential components of a secure robust network monitoring and application design. Packet probing is an important network measurement technique, used to understand packet delays, paths, and loss. In this paper, the authors propose an RNJ (Route Neighbor Joining) algorithm which is a grouping type algorithm that recovers the tree topology by recursively joining the neighbors on the tree by using the concept of additive metrics which is a general adaptive framework for analyzing and designing routing topology in an efficient scalable network structure.

Provided by: International Journal of Computer Science and Information Technologies Topic: Networking Date Added: Nov 2011 Format: PDF

Find By Topic