Sciweavers

Share
COMCOM
2011

Palmtree: An IP alias resolution algorithm with linear probing complexity

3 years 3 months ago
Palmtree: An IP alias resolution algorithm with linear probing complexity
Internet topology mapping studies utilize large scale topology maps to analyze various characteristics of the Internet. IP alias resolution, the task of mapping IP addresses to their corresponding routers, is an important task in building such topology maps. In this paper, we present a new probe-based IP alias resolution tool called palmtree. Palmtree can be used to complement the existing schemes in improving the overall success of alias resolution process during topology map construction. In addition, palmtree incurs a linear probing overhead to identify IP aliases. The experimental results obtained over Internet2 and GEANT networks as well as four major Internet Service Providers (ISPs) present quite promising results on the utility of palmtree in obtaining more accurate network topology maps.
M. Engin Tozal, Kamil Saraç
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2011
Where COMCOM
Authors M. Engin Tozal, Kamil Saraç
Comments (0)
books