Stuart Cheshire and Mary Baker. Consistent Overhead Byte Stuffing. IEEE/ACM Transactions on Networking. vol. 7 pp. 159-172 April 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....stuffed. By scanning the start of frame and end of frame markers in the received byte stream, the MAC layer can buffer a complete frame and then transmit it as payload of the MAC packet. This will work in most cases except when the received frame size is bigger than the link MTU. As pointed out in [9], this can happen even if the negotiated MTU at the PPP layer is smaller or equal to the link MTU. Whenever a higher layer packet contains escape characters, byte stuffing inserts extra characters into the frame, causing the frame size to double in the worst case. Consistent Overhead Byte Stuffing ....

....can happen even if the negotiated MTU at the PPP layer is smaller or equal to the link MTU. Whenever a higher layer packet contains escape characters, byte stuffing inserts extra characters into the frame, causing the frame size to double in the worst case. Consistent Overhead Byte Stuffing (COBS) [9] is a potential solution to this problem. COBS bounds the overhead of byte stuffing, ensuring that at most one extra byte is added for every 254 bytes of packet data. This allows the PPP MTU to be set within 0.4 of the link MTU without the danger of requiring fragmentation and reassembly. We ....

[Article contains additional citation context not shown here]

S. Cheshire and M. Baker. Consistent Overhead Byte Stuffing. In Proceedings of ACM SIGCOMM'97, pages 209-220, Cannes, France, 1997.

....stuffed. By scanning the start of frame and end of frame markers in the received byte stream, the MAC layer can buffer a complete frame and then transmit it as payload of the MAC packet. This will work in most cases except when the received frame size is bigger than the link MTU. As pointed out in [1], this can happen even if the negotiated MTU at the PPP layer is smaller or equal to the link MTU. Whenever a higher layer packet contains escape characters, byte stuffing inserts extra characters into the frame, causing the frame size to double in the worst case. Consistent Overhead Byte Stuffing ....

....can happen even if the negotiated MTU at the PPP layer is smaller or equal to the link MTU. Whenever a higher layer packet contains escape characters, byte stuffing inserts extra characters into the frame, causing the frame size to double in the worst case. Consistent Overhead Byte Stuffing (COBS) [1] is a potential solution to this problem. COBS bounds the overhead of byte stuffing, ensuring that at most one extra byte is added for every 254 bytes of packet data. This allows the PPP MTU to be set within 0.4 of the link MTU without the danger of requiring fragmentation and reassembly. We ....

[Article contains additional citation context not shown here]

Stuart Cheshire, Mary Baker. Consistent Overhead Byte Stuffing. Proceedings of ACM SIGCOMM `97, pp 209-220. Cannes, France 1997.

....drivers that enable Metricom Ricochet modems to be used as connectionless packet devices. It is under consideration for use in an open in car bus for accessing vehicle functions safely, and for deployment of inexpensive wireless networks in rural areas lacking wired Internet infrastructure. [4] . Robust Ad Hoc Networks: While there has been a great deal of work on routing algorithms for ad hoc networks, most of this work assumes that hosts in the network are well behaved and cooperate to route packets. I believe that such assumptions are not always reasonable given human nature and ....

S. Cheshire and M. Baker, Consistent Overhead Byte Stuffing." IEEE/ACM Transactions on Networking, Volume 7, Number 2, April

....of this paper is the minimal byte stuffing necessary to facilitate reliable unambiguous packet framing, not extensive byte stuffing to compensate for nontransparency of the underlying network. A more exhaustive treatment of framing and data stuffing can be found in the author s Ph.D. dissertation [9]. III. CONSISTENT OVERHEAD BYTE STUFFING ALGORITHMS This section begins by describing the data encoding format used by COBS, and the procedure for converting packet data to and from that encoded format. It then describes some of the properties and implications of using COBS encoding, and ....

....marginally better when it has many bytes to eliminate. However, elimination of some value other than zero can be achieved with only trivial changes to the algorithm, such as the addition of a simple post processing step (like XORing all the output bytes with the value to be eliminated) 8] [9]. COBS first takes its input data and logically appends a single zero byte. It is not necessary to add this zero byte to the end of the packet in memory; the encoding routine simply has to behave as if the added zero were there. COBS then locates all the zero bytes in the packet (including the ....

[Article contains additional citation context not shown here]

S. Cheshire, "Consistent overhead byte stuffing," Ph.D. dissertation, Stanford Univ., Stanford, CA, Mar. 1998.

No context found.

Stuart Cheshire and Mary Baker. Consistent Overhead Byte Stuffing. IEEE/ACM Transactions on Networking. vol. 7 pp. 159-172 April 1999.

No context found.

S. Cheshire and M. Baker, Consistent Overhead Byte Stuffing, IEEE Transactions on Networking, April 1999.

No context found.

S. Cheshire and M. Baker, Consistent Overhead Byte Stuffing, IEEE Transactions on Networking, April 1999.

No context found.

S. Cheshire and M. Baker, Consistent Overhead Byte Stuffing, IEEE Transactions on Networking, April 1999.

No context found.

S. Cheshire and M. Baker, Consistent Overhead Byte Stuffing, IEEE Transactions on Networking, April 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC