Dynamic probabilistic packet marking with partial non-preemption

被引:0
|
作者
Yen, Wei [1 ]
Sung, Jeng-Shian [1 ]
机构
[1] Tatung Univ, Dept Comp Sci & Engn, Taipei 104, Taiwan
关键词
DDoS; IP traceback; probabilistic packet marking; re-marking; convergence packet number;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper studies the technique of probabilistic packet marking. The main purpose is for the receiver to trace the true sources of the marked packets and rebuild their paths rapidly. In many existing schemes, marked packets are overwritten by other marking routers because of the nature of probabilistic packet marking. Although some IP traceback schemes can improve the overwriting problem, they usually make unrealistic assumption[11] or do not consider the load balancing issue of the routers. In probabilistic packet marking, how to address the re-mark problem and how to balance routers' overhead are two important design considerations. A scheme is proposed in this paper to address these problems in probabilistic packet marking. Using computer simulation, we observe that our scheme can greatly reduce re-marking. When compared with the current IP traceback schemes, our scheme can reduce 65% marked packets than the other scheme. Moreover, the overhead of marking packet in each router is even out in the proposed scheme than the other.
引用
收藏
页码:732 / 745
页数:14
相关论文
共 50 条
  • [1] Dynamic Probabilistic Packet Marking Based On PPM
    Bo, Feng
    Fan, Guo
    Min, Yu
    [J]. PROCEEDINGS OF THE 2009 SECOND PACIFIC-ASIA CONFERENCE ON WEB MINING AND WEB-BASED APPLICATION, 2009, : 289 - 292
  • [2] Dynamic probabilistic packet marking for efficient IP traceback
    Liu, Jenshiuh
    Lee, Zhi-Jian
    Chung, Yeh-Ching
    [J]. COMPUTER NETWORKS, 2007, 51 (03) : 866 - 882
  • [3] Efficient dynamic probabilistic packet marking for IP traceback
    Liu, JS
    Lee, ZJ
    Chung, YC
    [J]. ICON 2003: 11TH IEEE INTERNATIONAL CONFERENCE ON NETWORKS, 2003, : 475 - 480
  • [4] Probabilistic packet marking with non-preemptive compensation
    Tseng, YK
    Chen, HH
    Hsieh, WS
    [J]. IEEE COMMUNICATIONS LETTERS, 2004, 8 (06) : 359 - 361
  • [5] Optimizing Peak Age of Information in MEC Systems: Computing Preemption and Non-Preemption
    Zhu, Jianhang
    Gong, Jie
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2024, 32 (04) : 3285 - 3300
  • [6] Analysis of adjusted probabilistic packet marking
    Rizvi, B
    Fernandez-Gaucherand, E
    [J]. PROCEEDINGS OF THE 3RD IEEE WORKSHOP ON IP OPERATIONS & MANAGEMENT (IPOM2003), 2003, : 9 - 13
  • [7] An Optimized Probabilistic Packet Marking Schemes
    Wang, Xiaodong
    Lin, Jianhui
    [J]. PROCEEDINGS OF 2008 INTERNATIONAL COLLOQUIUM ON ARTIFICIAL INTELLIGENCE IN EDUCATION, 2008, : 201 - 205
  • [8] A Device for Transparent Probabilistic Packet Marking
    Okada, Masayuki
    Goto, Nasato
    Kanaoka, Akira
    Okamoto, Eiji
    [J]. 2013 IEEE 37TH ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE WORKSHOPS (COMPSACW), 2013, : 242 - 247
  • [9] Enhanced Probabilistic packet marking for IP traceback
    Gao, ZQ
    Ansari, N
    [J]. GLOBECOM '05: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6: DISCOVERY PAST AND FUTURE, 2005, : 1676 - 1680
  • [10] The evaluation of the probabilistic packet marking for path bifurcation
    Fu, JM
    Zhu, Q
    Zhang, HG
    [J]. DCABES 2004, Proceedings, Vols, 1 and 2, 2004, : 182 - 185