A lossless compression method for Internet packet headers

R. Holanda, J. Garcia
{"title":"A lossless compression method for Internet packet headers","authors":"R. Holanda, J. Garcia","doi":"10.1109/NGI.2005.1431671","DOIUrl":null,"url":null,"abstract":"A critical requirement for performance evaluation and design of network elements is the availability of realistic traffic traces. There are, however, several reasons that makes it difficult to have access to them. Firstly, Internet providers are usually reluctant to make real traces public, secondly, hardware for collecting traces at high speed is usually expensive, and finally, with the increase of link rates, the required storage for packet traces of meaningful duration becomes too large. In this paper we address the problem of compression of these potentially huge packet traces. We propose a novel packet header compression, focused not on the problem of reducing transmission bandwidth or latency, but on the problem of saving storage space. As far as we know, ours is the first method specifically oriented to this goal. With our proposed method, storage size requirements for .tsh packet headers are reduced to 16% of its original size. The compression proposed here is more efficient than any other existing method and simple to implement. Others known methods have their compression ratio bounded to 50% and 32%.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Next Generation Internet Networks, 2005","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGI.2005.1431671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A critical requirement for performance evaluation and design of network elements is the availability of realistic traffic traces. There are, however, several reasons that makes it difficult to have access to them. Firstly, Internet providers are usually reluctant to make real traces public, secondly, hardware for collecting traces at high speed is usually expensive, and finally, with the increase of link rates, the required storage for packet traces of meaningful duration becomes too large. In this paper we address the problem of compression of these potentially huge packet traces. We propose a novel packet header compression, focused not on the problem of reducing transmission bandwidth or latency, but on the problem of saving storage space. As far as we know, ours is the first method specifically oriented to this goal. With our proposed method, storage size requirements for .tsh packet headers are reduced to 16% of its original size. The compression proposed here is more efficient than any other existing method and simple to implement. Others known methods have their compression ratio bounded to 50% and 32%.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种无损的因特网包头压缩方法
对网元进行性能评估和设计的一个关键要求是提供真实的流量轨迹。然而,有几个原因使得很难获得它们。首先,互联网提供商通常不愿意公开真实的痕迹,其次,高速收集痕迹的硬件通常很昂贵,最后,随着链路速率的增加,有意义持续时间的数据包痕迹所需的存储空间变得太大。在本文中,我们解决了压缩这些可能巨大的数据包轨迹的问题。我们提出了一种新的包头压缩,重点不是减少传输带宽或延迟的问题,而是节省存储空间的问题。据我们所知,我们的方法是第一个专门针对这一目标的方法。使用我们提出的方法,.tsh包头的存储大小要求减少到原始大小的16%。这里提出的压缩比任何其他现有方法都更有效,并且易于实现。其他已知方法的压缩比限制在50%和32%之间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Users and services in intelligent networks Classification of Internet users using discriminant analysis and neural networks Optimal tree structures for large service networks Multicast versus private flows: an efficient pricing scheme for congestion control A new direction for quality of service: flow-aware networking
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1