Consistent Overhead Byte Stuffing

@inproceedings{Cheshire1997ConsistentOB,
  title={Consistent Overhead Byte Stuffing},
  author={Stuart Cheshire and Mary Baker},
  booktitle={SIGCOMM},
  year={1997}
}
Byte stuffing is a process that transforms a sequence of data bytes that may contain 'illegal' or 'reserved' values into a potentially longer sequence that contains no occurrences of those values. The extra length is referred to in this paper as the overhead of the algorithm.To date, byte stuffing algorithms, such as those used by SLIP [RFC1055], PPP [RFC1662] and AX.25 [ARRL84], have been designed to incur low average overhead but have made little effort to minimize worst case overhead.Some… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS
24 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

Similar Papers

Loading similar papers…