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
L'introduction d'une compression adaptative des données en ligne au niveau des nœuds internes du réseau est envisagée pour réduire la congestion du trafic sur le réseau. Dans cet article, nous supposons que les nœuds relais avancés, qui possèdent à la fois une fonction de relais (ressource réseau) et une fonction de traitement (ressources de calcul et de stockage), sont placés à l'intérieur du réseau, et nous proposons un schéma adaptatif de compression de paquets en ligne sans perte utilisé à ces nœuds. Ce schéma compresse sélectivement un paquet en fonction de son temps d'attente dans la file d'attente lors d'une congestion. Grâce à une enquête préliminaire utilisant des ensembles de données de trafic réels, nous étudions le taux de compression et le temps de traitement de la compression paquet par paquet dans des environnements réseau réels. Ensuite, au moyen de simulations informatiques, nous montrons que le schéma proposé réduit le temps de retard des paquets et le taux de rejet et étudions les facteurs nécessaires pour obtenir un relais de paquets efficace.
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
Masayoshi SHIMAMURA, Hiroyuki KOGA, Takeshi IKENAGA, Masato TSURU, "Compressing Packets Adaptively Inside Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 3, pp. 501-515, March 2010, doi: 10.1587/transcom.E93.B.501.
Abstract: Introducing adaptive online data compression at network-internal nodes is considered for alleviating traffic congestion on the network. In this paper, we assume that advanced relay nodes, which possess both a relay function (network resource) and a processing function (computational and storage resources), are placed inside the network, and we propose an adaptive online lossless packet compression scheme utilized at these nodes. This scheme selectively compresses a packet according to its waiting time in the queue during congestion. Through preliminary investigation using actual traffic datasets, we investigate the compression ratio and processing time of packet-by-packet compression in actual network environments. Then, by means of computer simulations, we show that the proposed scheme reduces the packet delay time and discard rate and investigate factors necessary in achieving efficient packet relay.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.501/_p
Copier
@ARTICLE{e93-b_3_501,
author={Masayoshi SHIMAMURA, Hiroyuki KOGA, Takeshi IKENAGA, Masato TSURU, },
journal={IEICE TRANSACTIONS on Communications},
title={Compressing Packets Adaptively Inside Networks},
year={2010},
volume={E93-B},
number={3},
pages={501-515},
abstract={Introducing adaptive online data compression at network-internal nodes is considered for alleviating traffic congestion on the network. In this paper, we assume that advanced relay nodes, which possess both a relay function (network resource) and a processing function (computational and storage resources), are placed inside the network, and we propose an adaptive online lossless packet compression scheme utilized at these nodes. This scheme selectively compresses a packet according to its waiting time in the queue during congestion. Through preliminary investigation using actual traffic datasets, we investigate the compression ratio and processing time of packet-by-packet compression in actual network environments. Then, by means of computer simulations, we show that the proposed scheme reduces the packet delay time and discard rate and investigate factors necessary in achieving efficient packet relay.},
keywords={},
doi={10.1587/transcom.E93.B.501},
ISSN={1745-1345},
month={March},}
Copier
TY - JOUR
TI - Compressing Packets Adaptively Inside Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 501
EP - 515
AU - Masayoshi SHIMAMURA
AU - Hiroyuki KOGA
AU - Takeshi IKENAGA
AU - Masato TSURU
PY - 2010
DO - 10.1587/transcom.E93.B.501
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2010
AB - Introducing adaptive online data compression at network-internal nodes is considered for alleviating traffic congestion on the network. In this paper, we assume that advanced relay nodes, which possess both a relay function (network resource) and a processing function (computational and storage resources), are placed inside the network, and we propose an adaptive online lossless packet compression scheme utilized at these nodes. This scheme selectively compresses a packet according to its waiting time in the queue during congestion. Through preliminary investigation using actual traffic datasets, we investigate the compression ratio and processing time of packet-by-packet compression in actual network environments. Then, by means of computer simulations, we show that the proposed scheme reduces the packet delay time and discard rate and investigate factors necessary in achieving efficient packet relay.
ER -