Bandwidth-efficient byte stuffing

• Type: Article in International Conference Proceedings Book
• Date: 2007

Authors

Jaime S Cardoso (Author) FEUP

Conference proceedings International

Title: 2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14

Pages: 6175-6180

IEEE International Conference on Communications (ICC 2007)

Glasgow, SCOTLAND, JUN 24-28, 2007

Indexing

ISI Web of Knowledge - 1 Citation

Scopus - 1 Citation

Scientific classification

FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering

CORDIS: Technological sciences

Other information

Authenticus ID: P-004-F1W

DOI: 10.1109/icc.2007.1022

Abstract (EN): Byte stuffing is a technique to allow the transparent transmission of arbitrary sequences with constrained sequences. To date, most of the existing algorithms, such as PPP, attain a low average overhead by sacrificing the worst-case scenario. An exception is COBS which was designed for a low worst-case overhead; however, it imposes always a nonzero overhead, even on small packets. In this work is proposed a byte stuffing algorithm that simultaneously controls the average and worst-case overhead, performing close to the theoretical bound. It is shown analytically that the proposed algorithm achieves improved average and worst-case rates over state of the art methods. Furthermore, this technique is generalized to hybrid methods, with lower computing complexity. It is further analysed and compared experimentally the behaviour of the proposed algorithm against established algorithms in terms of byte overhead and computational time.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 6