Compressing Packets Adaptively Inside Networks

Masayoshi SHIMAMURA  Hiroyuki KOGA  Takeshi IKENAGA  Masato TSURU  

Publication
IEICE TRANSACTIONS on Communications   Vol.E93-B   No.3   pp.501-515
Publication Date: 2010/03/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E93.B.501
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Section on New Generation Network towards Innovative Future Society)
Category: 
Keyword: 
advanced relay node,  adaptive online lossless packet compression scheme,  network resource,  computational resource,  

Full Text: PDF(1.4MB)>>
Buy this Article




Summary: 
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.