| 一种动-静态结合的概率包标记IP追踪方案 |
| |
| 引用本文： | 费洪晓,李文兴,覃思明,李钦秀.一种动-静态结合的概率包标记IP追踪方案[J].计算机工程与应用,2011,47(9):103-105. |
| |
| 作者姓名： | 费洪晓 李文兴 覃思明 李钦秀 |
| |
| 作者单位： | 中南大学信息科学与工程学院,长沙,410075 |
| |
| 基金项目： | 国家自然科学基金面上项目，湖南省科技计划基金资助项目 |
| |
| 摘 要： | 大多数概率包标记IP追踪方案因为固定标记概率而存在最弱链问题,从而导致重构路径的弱收敛性,动态概率包标记虽然在这些方面有所改善,但仍有路由器的负担过重和存储空间要求过高的问题。可以用一种动-静态结合的概率包标记方案来解决上述问题,通过分析表明该方案在收敛时间和最弱链问题上优于静态概率包标记,而在存储空间和路由器负担上优于动态概率包标记。
|
| 关 键 词： | 概率包标记 收敛时间 最弱链 存储空间 路由器负担 |
| 修稿时间： | |
Combined dynamic and static probabilistic packet marking scheme for IP traceback |
| |
| FEI Hongxiao,LI Wenxing,QIN Siming,LI Qinxiu.Combined dynamic and static probabilistic packet marking scheme for IP traceback[J].Computer Engineering and Applications,2011,47(9):103-105. |
| |
| Authors: | FEI Hongxiao LI Wenxing QIN Siming LI Qinxiu |
| |
| Affiliation: | School of Information Science and Engineering,Central South University,Changsha 410075,China |
| |
| Abstract: | 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. |
| |
| Keywords: | probabilistic packet marking convergence time weakest link memory space burden of router
|
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
