End-to-End Header Compression over Software-Defined Networks: A Low Latency Network Architecture

Supalerk Jivorasetkul, M. Shimamura, K. Iida
{"title":"End-to-End Header Compression over Software-Defined Networks: A Low Latency Network Architecture","authors":"Supalerk Jivorasetkul, M. Shimamura, K. Iida","doi":"10.1109/iNCoS.2012.80","DOIUrl":null,"url":null,"abstract":"The overhead portion especially for a small packet is one of the most significant parameters that can lower the efficiency of the link utilization. Therefore, many traditional hop-by-hop header compression techniques were introduced to reduce the amount of packet header before transmission. However, those techniques still cannot overcome the time performance issue as compression mechanism requires longer processing time. In the time-sensitive applications such as VoIP, high network latency can lead to voice quality problems. To improve the time performance, instead of using hop-by-hop basis, the authors propose a new header compression mechanism which can be deployed in end-to-end nodes using the Software-Defined Network concept. This mechanism can reduce both packet size and time delay. This research will show the results of round-trip time between our end-to-end header compression mechanism, multiple hop-by-hop header compression mechanism, and normal IP routing algorithm.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iNCoS.2012.80","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

The overhead portion especially for a small packet is one of the most significant parameters that can lower the efficiency of the link utilization. Therefore, many traditional hop-by-hop header compression techniques were introduced to reduce the amount of packet header before transmission. However, those techniques still cannot overcome the time performance issue as compression mechanism requires longer processing time. In the time-sensitive applications such as VoIP, high network latency can lead to voice quality problems. To improve the time performance, instead of using hop-by-hop basis, the authors propose a new header compression mechanism which can be deployed in end-to-end nodes using the Software-Defined Network concept. This mechanism can reduce both packet size and time delay. This research will show the results of round-trip time between our end-to-end header compression mechanism, multiple hop-by-hop header compression mechanism, and normal IP routing algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
端到端报头压缩在软件定义网络:一个低延迟的网络架构
开销部分是降低链路利用率的最重要参数之一,特别是对于小数据包而言。因此,为了减少传输前的包头数量,引入了许多传统的逐跳报头压缩技术。然而,这些技术仍然不能克服时间性能问题,因为压缩机制需要更长的处理时间。在VoIP等对时间敏感的应用中,高网络延迟会导致语音质量问题。为了提高报头压缩的时间性能,作者提出了一种新的报头压缩机制,该机制可以使用软件定义网络的概念部署在端到端节点上。这种机制可以减少数据包大小和时间延迟。本研究将展示端到端报头压缩机制、多跳逐跳报头压缩机制和普通IP路由算法之间往返时间的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Comparative Evaluation of Private Information Retrieval Techniques in Location-Based Services SOSCast: Location Estimation of Immobilized Persons through SOS Message Propagation Unsupervised Human Action Categorization Using Latent Dirichlet Markov Clustering A P2P Traffic Localization Method with Additional Delay Insertion Evaluation for Acquiring Method for Agents' Actions with Ant Colony Optimization in Robo Cup Rescue Simulation System
×
引用
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