• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computer Communication and Networks >Redundancy Elimination on Unidirectional Lossy Links
【24h】

Redundancy Elimination on Unidirectional Lossy Links

机译：单向损失链接上的冗余消除

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Redundant data transmission, which is very common in computer networks, degrades bandwidth efficiency and wastes energy. To reduce such redundancy, many redundancy elimination (RE) techniques have been proposed. Most of them require strict history synchronization between the sender and receiver, and therefore assume the existence of bidirectional links to maintain the synchronization. This paper presents MinMax, a new RE mechanism that is specially designed for unidirectional lossy links. Using an existing fingerprinting algorithm, MinMax eliminates a region of payload in an outgoing packet only when the region is common in a certain number of previous packets. Thus over a lossy link, MinMax significantly reduces decompression failures at the receiver without resorting to any forms of feedback and retransmission. Experiments on synthetic data and real-world traffic show that MinMax is able to maintain fair bandwidth savings while inducing negligible decompression failures even when the packet loss rate of the link is as high as 20%.
机译：在计算机网络中非常常见的冗余数据传输降低了带宽效率并浪费能量。为了降低这种冗余，已经提出了许多冗余消除（重复）技术。其中大多数都需要发件人和接收器之间的严格历史同步，因此假设存在双向链路以保持同步。本文介绍了Minmax，这是一种专门为单向损失链接设计的新型RE机制。使用现有的指纹算法，MinMax仅在该区域在一定数量的先前数据包中常见时，才能在输出分组中消除有效载荷区域。因此，通过损失链接，MinMax显着降低了接收器处的减压故障，而不借助任何形式的反馈和重传。合成数据和现实世界流量的实验表明，即使链接的零件损耗率高达20％，MinMax也能够保持公平的带宽节省，同时诱导可忽略的减压失败。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号