摘要
大多数概率包标记IP追踪方案因为固定标记概率而存在最弱链问题,从而导致重构路径的弱收敛性,动态概率包标记虽然在这些方面有所改善,但仍有路由器的负担过重和存储空间要求过高的问题。可以用一种动-静态结合的概率包标记方案来解决上述问题,通过分析表明该方案在收敛时间和最弱链问题上优于静态概率包标记,而在存储空间和路由器负担上优于动态概率包标记。
The weakest link problem,because of the fixed marking probability in most probabilistic packet marking based IP traceback schemes,results in poor convergence of path reconstruction.Although dynamic probabilistic packet marking has some improvements on these aspects,the problems of an excessive burden of router and demanding of memory space still exist.A combined dynamic and static probabilistic packet marking scheme can be used to solve the above-mentioned problems.The analysis shows that the scheme is superior to static probabilistic packet marking on the aspects of convergence time and the weakest link,and superior to dynamic probabilistic packet marking on the aspects of memory space and burden of router by contrasting qualities.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第9期103-105,共3页
Computer Engineering and Applications
基金
国家自然科学基金面上项目(No.60673165)
湖南省科技计划基金资助项目(No.2006JT1040)
关键词
概率包标记
收敛时间
最弱链
存储空间
路由器负担
probabilistic packet marking
convergence time
weakest link
memory space
burden of router
