WHIT: A More Efficient Hybrid Method for Single-Packet IP Traceback Using Walsh Matrix and Router Degree Distribution

被引:2
作者
Wang, Yulong [1 ]
Ren, Ji [1 ]
机构
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
network security; IP traceback; Walsh matrix; router degree distribution; POWER LAWS; SCHEMES; MARKING; ORIGIN;
D O I
10.1587/transcom.E96.B.1896
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Single-packet attack can be tracked with logging-based IP traceback approaches, whereas DDoS attack can be tracked with marking-based approaches. However, both approaches have their limits. Logging-based approaches incur heavy overhead for packet-digest storage as well as time overhead for both path recording and recovery. Marking-based approaches incur little traceback overhead but are unable to track single packets. Simply deploying both approaches in the same network to deal with single-packet and DDoS attacks is not an efficient solution due to the heavy traceback overhead. Recent studies suggest that hybrid approaches are more efficient as they consume less router memory to store packet digests and require fewer attack packets to recover attack paths. Thus, the hybrid single packet traceback approach is more promising in efficiently tracking both single-packet and DDoS attacks. The major challenge lies in reducing storage and time overhead while maintaining single-packet traceback capability. We present in this paper a new hybrid approach to efficiently track single-packet attacks by designing a novel path fragment encoding scheme using the orthogonality of Walsh matrix and the degree distribution characteristic of router-level topologies. Compared to HIT (Hybrid IP Traceback), which, to the best of our knowledge, is the most efficient hybrid approach for single-packet traceback, our approach has three advantages. First, it reduces the overhead by 2/3 in both storage and time for recording packet paths. Second, the time overhead for recovering packet paths is also reduced by a calculatable amount. Finally, our approach generates no more than 2/3 of the false-positive paths generated by HIT.
引用
收藏
页码:1896 / 1907
页数:12
相关论文
共 24 条
  • [1] Novel hybrid schemes employing packet marking and logging for IP traceback
    Al-Duwairi, B
    Govindarasu, M
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2006, 17 (05) : 403 - 418
  • [2] [Anonymous], 2003, Internet mathematics, DOI [10.1080/15427951.2004.10129088, DOI 10.1080/15427951.2004.10129088]
  • [3] On deterministic packet marking
    Belenky, Andrey
    Ansari, Nirwan
    [J]. COMPUTER NETWORKS, 2007, 51 (10) : 2677 - 2700
  • [4] Broder Andrei, 2002, Internet mathematics, P636, DOI DOI 10.1080/15427951.2004.10129096
  • [5] *CAIDA, ROUT LEV TOP DEGR DI
  • [6] Chen Q, 2002, IEEE INFOCOM SER, P608, DOI 10.1109/INFCOM.2002.1019306
  • [7] Dean D., 2002, ACM Transactions on Information and Systems Security, V5, P119, DOI 10.1145/505586.505588
  • [8] Faloutsos M, 1999, COMP COMM R, V29, P251, DOI 10.1145/316194.316229
  • [9] Gamer T., REASE
  • [10] GONG C, 2006, P BROADNETS SAN JOS