Benefit of Network Coding for Probabilistic Packet Marking and Collecting Coupons from Different Perspectives at the Collector

Dung Tien NGO; Tuan Anh LE; Choong Seon HONG; Sungwon LEE; Won-Tae LEE; Jae-Jo LEE

doi:10.1587/transcom.E96.B.489

Benefit of Network Coding for Probabilistic Packet Marking and Collecting Coupons from Different Perspectives at the Collector

Dung Tien NGO, Tuan Anh LE, Choong Seon HONG, Sungwon LEE, Won-Tae LEE, Jae-Jo LEE

Full Text Views

0

Share
Cite this

Summary :

Probabilistic Packet Marking (PPM) is a scheme for IP traceback where each packet is marked randomly with an IP address of one router on the attack path in order for the victim to trace the source of attacks. In previous work, a network coding approach to PPM (PPM+NC) where each packet is marked with a random linear combination of router IP addresses was introduced to reduce number of packets required to infer the attack path. However, the previous work lacks a formal proof for benefit of network coding to PPM and its proposed scheme is restricted. In this paper, we propose a novel method to prove a strong theorem for benefit of network coding to PPM in the general case, which compares different perspectives (interests of collecting) at the collector in PPM+NC scheme. Then we propose Core PPM+NC schemes based on our core network coding approach to PPM. From experiments, we show that our Core PPM+NC schemes actually require less number of packets than previous schemes to infer the attack path. In addition, based on the relationship between Coupon Collector's Problem (CCP) and PPM, we prove that there exists numerous designs that CCP still benefits from network coding.

Publication: IEICE TRANSACTIONS on Communications Vol.E96-B No.2 pp.489-499

Publication Date: 2013/02/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E96.B.489

Type of Manuscript: Special Section PAPER (Special Section on Quality of Communication Services Improving Quality of Life)

Category

Cite this

Copy

Dung Tien NGO, Tuan Anh LE, Choong Seon HONG, Sungwon LEE, Won-Tae LEE, Jae-Jo LEE, "Benefit of Network Coding for Probabilistic Packet Marking and Collecting Coupons from Different Perspectives at the Collector" in IEICE TRANSACTIONS on Communications, vol. E96-B, no. 2, pp. 489-499, February 2013, doi: 10.1587/transcom.E96.B.489.
Abstract: Probabilistic Packet Marking (PPM) is a scheme for IP traceback where each packet is marked randomly with an IP address of one router on the attack path in order for the victim to trace the source of attacks. In previous work, a network coding approach to PPM (PPM+NC) where each packet is marked with a random linear combination of router IP addresses was introduced to reduce number of packets required to infer the attack path. However, the previous work lacks a formal proof for benefit of network coding to PPM and its proposed scheme is restricted. In this paper, we propose a novel method to prove a strong theorem for benefit of network coding to PPM in the general case, which compares different perspectives (interests of collecting) at the collector in PPM+NC scheme. Then we propose Core PPM+NC schemes based on our core network coding approach to PPM. From experiments, we show that our Core PPM+NC schemes actually require less number of packets than previous schemes to infer the attack path. In addition, based on the relationship between Coupon Collector's Problem (CCP) and PPM, we prove that there exists numerous designs that CCP still benefits from network coding.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E96.B.489/_p

Copy

@ARTICLE{e96-b_2_489,
author={Dung Tien NGO, Tuan Anh LE, Choong Seon HONG, Sungwon LEE, Won-Tae LEE, Jae-Jo LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Benefit of Network Coding for Probabilistic Packet Marking and Collecting Coupons from Different Perspectives at the Collector},
year={2013},
volume={E96-B},
number={2},
pages={489-499},
abstract={Probabilistic Packet Marking (PPM) is a scheme for IP traceback where each packet is marked randomly with an IP address of one router on the attack path in order for the victim to trace the source of attacks. In previous work, a network coding approach to PPM (PPM+NC) where each packet is marked with a random linear combination of router IP addresses was introduced to reduce number of packets required to infer the attack path. However, the previous work lacks a formal proof for benefit of network coding to PPM and its proposed scheme is restricted. In this paper, we propose a novel method to prove a strong theorem for benefit of network coding to PPM in the general case, which compares different perspectives (interests of collecting) at the collector in PPM+NC scheme. Then we propose Core PPM+NC schemes based on our core network coding approach to PPM. From experiments, we show that our Core PPM+NC schemes actually require less number of packets than previous schemes to infer the attack path. In addition, based on the relationship between Coupon Collector's Problem (CCP) and PPM, we prove that there exists numerous designs that CCP still benefits from network coding.},
keywords={},
doi={10.1587/transcom.E96.B.489},
ISSN={1745-1345},
month={February},}

Copy

TY - JOUR
TI - Benefit of Network Coding for Probabilistic Packet Marking and Collecting Coupons from Different Perspectives at the Collector
T2 - IEICE TRANSACTIONS on Communications
SP - 489
EP - 499
AU - Dung Tien NGO
AU - Tuan Anh LE
AU - Choong Seon HONG
AU - Sungwon LEE
AU - Won-Tae LEE
AU - Jae-Jo LEE
PY - 2013
DO - 10.1587/transcom.E96.B.489
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E96-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2013
AB - Probabilistic Packet Marking (PPM) is a scheme for IP traceback where each packet is marked randomly with an IP address of one router on the attack path in order for the victim to trace the source of attacks. In previous work, a network coding approach to PPM (PPM+NC) where each packet is marked with a random linear combination of router IP addresses was introduced to reduce number of packets required to infer the attack path. However, the previous work lacks a formal proof for benefit of network coding to PPM and its proposed scheme is restricted. In this paper, we propose a novel method to prove a strong theorem for benefit of network coding to PPM in the general case, which compares different perspectives (interests of collecting) at the collector in PPM+NC scheme. Then we propose Core PPM+NC schemes based on our core network coding approach to PPM. From experiments, we show that our Core PPM+NC schemes actually require less number of packets than previous schemes to infer the attack path. In addition, based on the relationship between Coupon Collector's Problem (CCP) and PPM, we prove that there exists numerous designs that CCP still benefits from network coding.
ER -