Error Resilient Packet Header Compression
they have no payload, and a majority of packets are less than 300 bytes long [1]. Thus, headers impose a heavy overhead in terms of bitrate. In another study it was found that over 55% of packets have length less than 200 bytes. Thankfully the header fields in successive packets are redundant, so it is possible to compress them. Many header compression algorithms have been proposed and studied over the past 15 years. These methods depend on the similarity between successive packet headers, in a manner similar to DPCM. Thus, packet header compression shares the strengths and weaknesses of DPCM: excellent compression is achieved when headers are strongly correlated (as they usually are), but any errors will propagate and contaminate future packets. We propose to use error correcting codes [2-4] to limit error propagation in header compression schemes. We present coding techniques based on well known error correcting codes such as Reed-Solomon and convolutional codes for the uni-directional links. For the feedback case we construct a predictive ARQ with multiple retransmission within a convolutional codeword. We also design and use a delay-limited interleaver. Using this structure, very attractive throughput-delay trade off is obtained in the presence of noise in both forward and reverse links. In fact, both the throughput and delay of the proposed system is superior to previous solutions under a large set of channel conditions. Basic Header Compression Some header fields stay static throughout a session whereas some header fields can be inferred from header fields belonging to a previous packet. Other fields such as the checksum are almost random in the sense that they cannot be inferred easily from other available information. At the start of a session the transmitter sends an uncompressed header which initializes the decompressor. Static fields are not included in the compressed header whereas random fields are included verbatim. The remaining fields are differentially encoded or not transmitted at all (e.g., inferred fields). A basic header compression system has a CONTEXT buffer on each side of the link as shown in Figure 1. At the transmitter and receiver, the last available header (in uncompressed form) is kept in the CONTEXT as a reference. At the transmitter each incoming packet is compressed with reference to the CONTEXT . The CONTEXT is then updated with an uncompressed version of the most recently compressed packet header. Similarly at the receiver decompression of a packet header takes place with respect to CONTEXT at the receiver side. On a
Communication, Networking & Broadcasting Components, Circuits, Devices & Systems Computing & Processing Engineered Materials, Dielectrics & Plasmas Engineering Profession Fields, Waves & Electromagnetics General Topics for Engineers Geoscience Nuclear Engineering Photonics & Electro-Optics Power, Energy, & Industry Applications Robotics & Control Systems Signal Processing http://www.utdallas.edu/~aria/mcl/headercomp/ & Analysis Transportation Browse Books & eBooks Conference Publications Courses Journals & Magazines Standards By Topic My Settings Content Alerts My Projects Search Alerts Preferences Purchase History Search History What can I access? Get Help About IEEE Xplore Feedback http://ieeexplore.ieee.org/abstract/document/1378258/ Technical Support Resources and Help Terms of Use What Can I Access? Subscribe Personal Sign In Create Account IEEE Account Change Username/Password Update Address Purchase Details Payment Options Order History View Purchased Documents Profile Information Communications Preferences Profession and Education Technical Interests Need Help? US & Canada: +1 800 678 4333 Worldwide: +1 732 981 0060 Contact & Support About IEEE Xplore Contact Us Help Terms of Use Nondiscrimination Policy Sitemap Privacy & Opting Out of Cookies A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.© Copyright 2016 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
be down. Please try the request again. Your cache administrator is webmaster. Generated Fri, 14 Oct 2016 17:35:38 GMT by s_ac15 (squid/3.5.20)