Earticle

초록

영어

Header compression increases efficiency. Further increase in efficiency is obtained by differential header compression. But subsequent packets have to be discarded if the context is not synchronized in differential header compression. Many algorithms had been proposed earlier to reduce discarding of subsequent packets. One of the basic techniques is use of reference value through which packets are encoded and decoded in compressor and decompressor respectively. Major disadvantage of this technique is that if the reference value is lost or erroneous then receiver cannot decompress the packets correctly. We have addressed this problem in the proposed scheme. In the proposed scheme even if the reference value or packets are lost or erroneous, receiver can regenerate the reference value and the packets. We have also shown that the proposed scheme has low average delay in high packet error rate and also works well in long round trip time. Some level of burst error is also handled by the proposed scheme.

목차

Abstract
 1. Introduction
 2. Motivation and Background
  2.1 Basic of Header Compression
  2.2 Differential Header Compression
 3. Existing Methods
 4. Proposed Scheme
 5. Simulation and Result
  5.1 Packet Discard Rate
  5.2 Average Delay
 6. Conclusion
 Appendix
 References

키워드

Differential Header Compression Header Compression Coding PDR Delay Latency Common base Packet Error TCP IP Discard RTT ROHC

저자

• Koj Sambyo [ Department of Computer Science and Engineering, National Institute of Technology, Arunachal Pradesh- 791112, India ]
• Anish Kumar Saha [ Department of Computer Science and Engineering, National Institute of Technology, Arunachal Pradesh- 791112, India ]
• C. T. Bhunia [ Department of Computer Science and Engineering, National Institute of Technology, Arunachal Pradesh- 791112, India ]

참고문헌

발행기관

간행물