检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京邮电大学通达学院,南京210003 [2]南京邮电大学计算机学院,南京210003
出 处:《计算机应用》2009年第12期3185-3187,3200,共4页journal of Computer Applications
基 金:南京邮电大学青蓝计划基金资助项目(NY206055)
摘 要:为了提高受害端重构攻击路径的效率,提出了一种周期式确定包标记的复合式方案。该方案以5个分片一组表示边信息,路由器周期式地对数据包进行标记。对于边状态的变化,方案采用路由器检测标记信息的方法进行同步,以确保标记的准确性和鲁棒性。与传统的概率包标记方案相比较,该方案只需要标记较少的数据包即可重建攻击路径,较好处理含伪造地址的数据包,有效地解决了数据包遗失的问题。理论分析与实验结果证明了该方案的有效性。In order to improve the efficiency of path reconstruction, a novel scheme was proposed. In this scheme, one edge was constituted by five fragments. Packets were deterministically marked by routers in a cyclical fashion. The state of edge was synchronized by checking the marked packets in order to keep accurate and robust marking. Analyses and simulations show the scheme is effective. Compared with traditional probabilistic marking techniques, this scheme requires less marked packets to reconstruct the attacking-path. And it is also more resilient to packet spoofing, and solves the issue of packet loss well.
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7