P2P traffic localization by forcing packet loss

Hiep Hoang-Van, Koki Mizutani, Takumi Miyoshi, Olivier Fourmaux

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Recently, peer-to-peer (P2P) traffic is increasing rapidly in volume day by day. One of the main causes is that most of P2P applications including file sharing and streaming applications often form overlay networks for exchanging data that are oblivious to the underlay network topology. As a result, they generate a large amount of inter-domain traffic causing higher cost for internet service providers (ISPs). This raises a problem of traffic localization. To optimize the cross-ISP/AS traffic, existing approaches focus on solving the problem on the application layer where each P2P application must be equipped with an additional protocol to obtain underlay network information from an "oracle" server or an additional locality-aware procedure to estimate location by itself. Therefore some modifications of application software are required for these approaches. In this paper, we propose a novel solution for addressing the problem, called PLS, forcing packet loss to each P2P packet based on geographical location of each destination at the network layer. Since PLS is implemented at a network router, no software modification is required. This proposal can be applied to all types of P2P applications in order to localize the traffic. The experiments evaluated on popular P2P streaming applications show that our proposed method significantly reduces the cross-domain traffic by suppressing the connections with faraway peers.

Original languageEnglish
Pages (from-to)251-259
Number of pages9
JournalInternational Journal of Networked and Distributed Computing
Volume1
Issue number4
DOIs
Publication statusPublished - 2013 Nov 1

Fingerprint

Packet loss
Internet service providers
Overlay networks
Network layers
Routers
Application programs
Servers
Topology
Network protocols
Costs
Experiments

Keywords

  • P2P
  • P2PTV
  • Packet loss
  • Router aided
  • Traffic localization

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

P2P traffic localization by forcing packet loss. / Hoang-Van, Hiep; Mizutani, Koki; Miyoshi, Takumi; Fourmaux, Olivier.

In: International Journal of Networked and Distributed Computing, Vol. 1, No. 4, 01.11.2013, p. 251-259.

Research output: Contribution to journalArticle

Hoang-Van, Hiep ; Mizutani, Koki ; Miyoshi, Takumi ; Fourmaux, Olivier. / P2P traffic localization by forcing packet loss. In: International Journal of Networked and Distributed Computing. 2013 ; Vol. 1, No. 4. pp. 251-259.
@article{41c9b6676e014b44ba1e66fbfc47020d,
title = "P2P traffic localization by forcing packet loss",
abstract = "Recently, peer-to-peer (P2P) traffic is increasing rapidly in volume day by day. One of the main causes is that most of P2P applications including file sharing and streaming applications often form overlay networks for exchanging data that are oblivious to the underlay network topology. As a result, they generate a large amount of inter-domain traffic causing higher cost for internet service providers (ISPs). This raises a problem of traffic localization. To optimize the cross-ISP/AS traffic, existing approaches focus on solving the problem on the application layer where each P2P application must be equipped with an additional protocol to obtain underlay network information from an {"}oracle{"} server or an additional locality-aware procedure to estimate location by itself. Therefore some modifications of application software are required for these approaches. In this paper, we propose a novel solution for addressing the problem, called PLS, forcing packet loss to each P2P packet based on geographical location of each destination at the network layer. Since PLS is implemented at a network router, no software modification is required. This proposal can be applied to all types of P2P applications in order to localize the traffic. The experiments evaluated on popular P2P streaming applications show that our proposed method significantly reduces the cross-domain traffic by suppressing the connections with faraway peers.",
keywords = "P2P, P2PTV, Packet loss, Router aided, Traffic localization",
author = "Hiep Hoang-Van and Koki Mizutani and Takumi Miyoshi and Olivier Fourmaux",
year = "2013",
month = "11",
day = "1",
doi = "10.2991/ijndc.2013.1.4.6",
language = "English",
volume = "1",
pages = "251--259",
journal = "International Journal of Networked and Distributed Computing",
issn = "2211-7938",
publisher = "Atlantis Press",
number = "4",

}

TY - JOUR

T1 - P2P traffic localization by forcing packet loss

AU - Hoang-Van, Hiep

AU - Mizutani, Koki

AU - Miyoshi, Takumi

AU - Fourmaux, Olivier

PY - 2013/11/1

Y1 - 2013/11/1

N2 - Recently, peer-to-peer (P2P) traffic is increasing rapidly in volume day by day. One of the main causes is that most of P2P applications including file sharing and streaming applications often form overlay networks for exchanging data that are oblivious to the underlay network topology. As a result, they generate a large amount of inter-domain traffic causing higher cost for internet service providers (ISPs). This raises a problem of traffic localization. To optimize the cross-ISP/AS traffic, existing approaches focus on solving the problem on the application layer where each P2P application must be equipped with an additional protocol to obtain underlay network information from an "oracle" server or an additional locality-aware procedure to estimate location by itself. Therefore some modifications of application software are required for these approaches. In this paper, we propose a novel solution for addressing the problem, called PLS, forcing packet loss to each P2P packet based on geographical location of each destination at the network layer. Since PLS is implemented at a network router, no software modification is required. This proposal can be applied to all types of P2P applications in order to localize the traffic. The experiments evaluated on popular P2P streaming applications show that our proposed method significantly reduces the cross-domain traffic by suppressing the connections with faraway peers.

AB - Recently, peer-to-peer (P2P) traffic is increasing rapidly in volume day by day. One of the main causes is that most of P2P applications including file sharing and streaming applications often form overlay networks for exchanging data that are oblivious to the underlay network topology. As a result, they generate a large amount of inter-domain traffic causing higher cost for internet service providers (ISPs). This raises a problem of traffic localization. To optimize the cross-ISP/AS traffic, existing approaches focus on solving the problem on the application layer where each P2P application must be equipped with an additional protocol to obtain underlay network information from an "oracle" server or an additional locality-aware procedure to estimate location by itself. Therefore some modifications of application software are required for these approaches. In this paper, we propose a novel solution for addressing the problem, called PLS, forcing packet loss to each P2P packet based on geographical location of each destination at the network layer. Since PLS is implemented at a network router, no software modification is required. This proposal can be applied to all types of P2P applications in order to localize the traffic. The experiments evaluated on popular P2P streaming applications show that our proposed method significantly reduces the cross-domain traffic by suppressing the connections with faraway peers.

KW - P2P

KW - P2PTV

KW - Packet loss

KW - Router aided

KW - Traffic localization

UR - http://www.scopus.com/inward/record.url?scp=85018873146&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85018873146&partnerID=8YFLogxK

U2 - 10.2991/ijndc.2013.1.4.6

DO - 10.2991/ijndc.2013.1.4.6

M3 - Article

VL - 1

SP - 251

EP - 259

JO - International Journal of Networked and Distributed Computing

JF - International Journal of Networked and Distributed Computing

SN - 2211-7938

IS - 4

ER -