Efficient Doubletree: An Algorithm for Large-Scale Topology Discovery
Ranjit Kumar Nukathati · IOSR Journal of Computer Engineering · 2013
Monitoring Internet topology was a tractable problem.Topology discovery systems are starting to be introduced in the form of easily and widely deployed software.Unfortunately, they have a problem of how to perform such measurements efficiently and in a network-friendly manner.When scaled up, such methods will generate so much traffic that they will begin to resemble distributed denial-of-service attacks.The existing Doubletree algorithm faces the problem of redundancy.To solve this, the Efficient Doubletree algorithm is proposed which reduces redundancy while maintaining nearly the same level of nodes and link coverage.Algorithm quantifies the amount of redundancy in classic Internet topology discovery approaches by taking into account the perspective of a single monitor (intramonitor) and that of an entire system (intermonitor).Efficient Doubletree simultaneously meets the conflicting demands of reducing intramonitor and intermonitor redundancy.In both the above cases a hop in the middle that is between monitor and destination will be selected by Hop Selection to increase efficiency.