首页 | 本学科首页   官方微博 | 高级检索  
     


Palmtree: An IP alias resolution algorithm with linear probing complexity
Authors:M. Engin Tozal  Kamil Sarac
Affiliation:The University of Texas at Dallas, Department of Computer Science Richardson, TX 75080, USA
Abstract: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.
Keywords:Internet   Topology   Map   Alias   Router
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号