The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Vues en texte intégral
96
Nous observons que le trafic P2P présente des caractéristiques particulières par rapport aux autres types de trafic tels que la navigation Web et le transfert de fichiers. Puisqu'ils exploitent effet d'essaim -- une multitude de points finaux téléchargeant le même contenu morceau par morceau presque en même temps, augmentant ainsi l'efficacité de la mise en cache -- les mêmes éléments de données finissent par traverser le réseau encore et encore dans un laps de temps généralement court. A la lumière de ce constat, nous proposons une mise en cache au niveau des paquets au niveau de la couche réseau pour réduire le volume du trafic P2P émergent, de manière transparente pour les applications P2P -- sans affecter du tout les opérations des applications P2P -- plutôt que de l'interdire, de le restreindre ou de modifier les systèmes P2P eux-mêmes. Contrairement aux autres techniques de mise en cache, notre objectif est de fournir un mécanisme de mise en cache aussi générique que possible au niveau de la couche réseau - sans connaître beaucoup de détails sur les protocoles d'application P2P - afin d'étendre l'applicabilité aux protocoles P2P arbitraires. Notre évaluation préliminaire montre que notre approche devrait réduire une quantité significative de trafic P2P de manière transparente pour les applications P2P.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Akihiro NAKAO, Kengo SASAKI, Shu YAMAMOTO, "A Remedy for Network Operators against Increasing P2P Traffic: Enabling Packet Cache for P2P Applications" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 12, pp. 3810-3820, December 2008, doi: 10.1093/ietcom/e91-b.12.3810.
Abstract: We observe that P2P traffic has peculiar characteristics as opposed to the other type of traffic such as web browsing and file transfer. Since they exploit swarm effect -- a multitude of end points downloading the same content piece by piece nearly at the same time, thus, increasing the effectiveness of caching -- the same pieces of data end up traversing the network over and over again within mostly a short time window. In the light of this observation, we propose a network layer packet-level caching for reducing the volume of emerging P2P traffic, transparently to the P2P applications -- without affecting operations of the P2P applications at all -- rather than banning it, restricting it, or modifying P2P systems themselves. Unlike the other caching techniques, we aim to provide as generic a caching mechanism as possible at network layer -- without knowing much detail of P2P application protocols -- to extend applicability to arbitrary P2P protocols. Our preliminary evaluation shows that our approach is expected to reduce a significant amount of P2P traffic transparently to P2P applications.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.12.3810/_p
Copier
@ARTICLE{e91-b_12_3810,
author={Akihiro NAKAO, Kengo SASAKI, Shu YAMAMOTO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Remedy for Network Operators against Increasing P2P Traffic: Enabling Packet Cache for P2P Applications},
year={2008},
volume={E91-B},
number={12},
pages={3810-3820},
abstract={We observe that P2P traffic has peculiar characteristics as opposed to the other type of traffic such as web browsing and file transfer. Since they exploit swarm effect -- a multitude of end points downloading the same content piece by piece nearly at the same time, thus, increasing the effectiveness of caching -- the same pieces of data end up traversing the network over and over again within mostly a short time window. In the light of this observation, we propose a network layer packet-level caching for reducing the volume of emerging P2P traffic, transparently to the P2P applications -- without affecting operations of the P2P applications at all -- rather than banning it, restricting it, or modifying P2P systems themselves. Unlike the other caching techniques, we aim to provide as generic a caching mechanism as possible at network layer -- without knowing much detail of P2P application protocols -- to extend applicability to arbitrary P2P protocols. Our preliminary evaluation shows that our approach is expected to reduce a significant amount of P2P traffic transparently to P2P applications.},
keywords={},
doi={10.1093/ietcom/e91-b.12.3810},
ISSN={1745-1345},
month={December},}
Copier
TY - JOUR
TI - A Remedy for Network Operators against Increasing P2P Traffic: Enabling Packet Cache for P2P Applications
T2 - IEICE TRANSACTIONS on Communications
SP - 3810
EP - 3820
AU - Akihiro NAKAO
AU - Kengo SASAKI
AU - Shu YAMAMOTO
PY - 2008
DO - 10.1093/ietcom/e91-b.12.3810
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2008
AB - We observe that P2P traffic has peculiar characteristics as opposed to the other type of traffic such as web browsing and file transfer. Since they exploit swarm effect -- a multitude of end points downloading the same content piece by piece nearly at the same time, thus, increasing the effectiveness of caching -- the same pieces of data end up traversing the network over and over again within mostly a short time window. In the light of this observation, we propose a network layer packet-level caching for reducing the volume of emerging P2P traffic, transparently to the P2P applications -- without affecting operations of the P2P applications at all -- rather than banning it, restricting it, or modifying P2P systems themselves. Unlike the other caching techniques, we aim to provide as generic a caching mechanism as possible at network layer -- without knowing much detail of P2P application protocols -- to extend applicability to arbitrary P2P protocols. Our preliminary evaluation shows that our approach is expected to reduce a significant amount of P2P traffic transparently to P2P applications.
ER -