Packet framing using cyclic redundancy checking

Details Packet framing using cyclic redundancy checking Packet framing using cyclic redundancy checking

1990-02-15

1991-12-10

Beausoliel, Robert W.

Excavating

370 942, 3701051, 375108, G06F 1110, H04J 324

Patent

active

050724495

ABSTRACT:
Packets transported over a serial data stream need to have their start and stop information encoded so that they can be parsed by the receiving device. Techniques used in various standards require extra bandwidth to carry this information. For framed data streams like T1, proprietary protocols have used the frame structure to mark packet boundaries. Both types of solutions are undesirable for unframed, long distance data streams like the CCITT G.703 2.048 Mbps unframed service, subrate trunks, or fractional T1 services. The present invention provides a packet framing method that uses the Cyclic Redundancy Check (CRC) found in most packet formats. The protocol does not require any extra bandwidth and can work with any serial data stream physical layer.

REFERENCES:
patent: 4316285 (1982-02-01), Bobilin
patent: 4397020 (1983-08-01), Howson
patent: 4468752 (1984-08-01), Chatham
patent: 4754451 (1988-06-01), Eng
patent: 4897835 (1990-01-01), Gaskill
patent: 4914654 (1990-04-01), Matsuda
patent: 4962498 (1990-10-01), May

Affiliated with

Also associated with

Rating

Packet framing using cyclic redundancy checking does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Packet framing using cyclic redundancy checking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packet framing using cyclic redundancy checking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1046405