Debian Codegraph @

rfc1662.html

raw
1 <pre>Network Working Group W. Simpson, Editor
2 Request for Comments: 1662 Daydreamer
3 STD: 51 July 1994
4 Obsoletes: <a href="./rfc1549">1549</a>
5 Category: Standards Track
6
7
8 <span class="h1">PPP in HDLC-like Framing</span>
9
10
11 Status of this Memo
12
13 This document specifies an Internet standards track protocol for the
14 Internet community, and requests discussion and suggestions for
15 improvements. Please refer to the current edition of the "Internet
16 Official Protocol Standards" (STD 1) for the standardization state
17 and status of this protocol. Distribution of this memo is unlimited.
18
19
20 Abstract
21
22 The Point-to-Point Protocol (PPP) [<a href="#ref-1" title="&quot;The Point-to-Point Protocol (PPP)&quot;">1</a>] provides a standard method for
23 transporting multi-protocol datagrams over point-to-point links.
24
25 This document describes the use of HDLC-like framing for PPP
26 encapsulated packets.
27
28
29 Table of Contents
30
31
32 <a href="#section-1">1</a>. Introduction .......................................... <a href="#page-1">1</a>
33 <a href="#section-1.1">1.1</a> Specification of Requirements ................... <a href="#page-2">2</a>
34 <a href="#section-1.2">1.2</a> Terminology ..................................... <a href="#page-2">2</a>
35
36 <a href="#section-2">2</a>. Physical Layer Requirements ........................... <a href="#page-3">3</a>
37
38 <a href="#section-3">3</a>. The Data Link Layer ................................... <a href="#page-4">4</a>
39 <a href="#section-3.1">3.1</a> Frame Format .................................... <a href="#page-5">5</a>
40 <a href="#section-3.2">3.2</a> Modification of the Basic Frame ................. <a href="#page-7">7</a>
41
42 <a href="#section-4">4</a>. Octet-stuffed framing ................................. <a href="#page-8">8</a>
43 <a href="#section-4.1">4.1</a> Flag Sequence ................................... <a href="#page-8">8</a>
44 <a href="#section-4.2">4.2</a> Transparency .................................... <a href="#page-8">8</a>
45 <a href="#section-4.3">4.3</a> Invalid Frames .................................. <a href="#page-9">9</a>
46 <a href="#section-4.4">4.4</a> Time Fill ....................................... <a href="#page-9">9</a>
47 <a href="#section-4.4.1">4.4.1</a> Octet-synchronous ............................... <a href="#page-9">9</a>
48 <a href="#section-4.4.2">4.4.2</a> Asynchronous .................................... <a href="#page-9">9</a>
49 <a href="#section-4.5">4.5</a> Transmission Considerations ..................... <a href="#page-10">10</a>
50 <a href="#section-4.5.1">4.5.1</a> Octet-synchronous ............................... <a href="#page-10">10</a>
51 <a href="#section-4.5.2">4.5.2</a> Asynchronous .................................... <a href="#page-10">10</a>
52
53
54 <span class="grey">Simpson [Page i]</span></pre>
55 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-1" ></span>
56 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
57
58
59 <a href="#section-5">5</a>. Bit-stuffed framing ................................... <a href="#page-11">11</a>
60 <a href="#section-5.1">5.1</a> Flag Sequence ................................... <a href="#page-11">11</a>
61 <a href="#section-5.2">5.2</a> Transparency .................................... <a href="#page-11">11</a>
62 <a href="#section-5.3">5.3</a> Invalid Frames .................................. <a href="#page-11">11</a>
63 <a href="#section-5.4">5.4</a> Time Fill ....................................... <a href="#page-11">11</a>
64 <a href="#section-5.5">5.5</a> Transmission Considerations ..................... <a href="#page-12">12</a>
65
66 <a href="#section-6">6</a>. Asynchronous to Synchronous Conversion ................ <a href="#page-13">13</a>
67
68 <a href="#section-7">7</a>. Additional LCP Configuration Options .................. <a href="#page-14">14</a>
69 <a href="#section-7.1">7.1</a> Async-Control-Character-Map (ACCM) .............. <a href="#page-14">14</a>
70
71 APPENDICES ................................................... <a href="#page-17">17</a>
72 <a href="#appendix-A">A</a>. Recommended LCP Options ............................... <a href="#page-17">17</a>
73 <a href="#appendix-B">B</a>. Automatic Recognition of PPP Frames ................... <a href="#page-17">17</a>
74 <a href="#appendix-C">C</a>. Fast Frame Check Sequence (FCS) Implementation ........ <a href="#page-18">18</a>
75 <a href="#appendix-C.1">C.1</a> FCS table generator ............................. <a href="#page-18">18</a>
76 <a href="#appendix-C.2">C.2</a> 16-bit FCS Computation Method ................... <a href="#page-19">19</a>
77 <a href="#appendix-C.3">C.3</a> 32-bit FCS Computation Method ................... <a href="#page-21">21</a>
78
79 SECURITY CONSIDERATIONS ...................................... <a href="#page-24">24</a>
80 REFERENCES ................................................... <a href="#page-24">24</a>
81 ACKNOWLEDGEMENTS ............................................. <a href="#page-25">25</a>
82 CHAIR'S ADDRESS .............................................. <a href="#page-25">25</a>
83 EDITOR'S ADDRESS ............................................. <a href="#page-25">25</a>
84
85
86
87
88 <span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span>
89
90 This specification provides for framing over both bit-oriented and
91 octet-oriented synchronous links, and asynchronous links with 8 bits
92 of data and no parity. These links MUST be full-duplex, but MAY be
93 either dedicated or circuit-switched.
94
95 An escape mechanism is specified to allow control data such as
96 XON/XOFF to be transmitted transparently over the link, and to remove
97 spurious control data which may be injected into the link by
98 intervening hardware and software.
99
100 Some protocols expect error free transmission, and either provide
101 error detection only on a conditional basis, or do not provide it at
102 all. PPP uses the HDLC Frame Check Sequence for error detection.
103 This is commonly available in hardware implementations, and a
104 software implementation is provided.
105
106
107
108
109
110
111 <span class="grey">Simpson [Page 1]</span></pre>
112 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span>
113 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
114
115
116 <span class="h3"><a class="selflink" id="section-1.1" href="#section-1.1">1.1</a>. Specification of Requirements</span>
117
118 In this document, several words are used to signify the requirements
119 of the specification. These words are often capitalized.
120
121 MUST This word, or the adjective "required", means that the
122 definition is an absolute requirement of the specification.
123
124 MUST NOT This phrase means that the definition is an absolute
125 prohibition of the specification.
126
127 SHOULD This word, or the adjective "recommended", means that there
128 may exist valid reasons in particular circumstances to
129 ignore this item, but the full implications must be
130 understood and carefully weighed before choosing a
131 different course.
132
133 MAY This word, or the adjective "optional", means that this
134 item is one of an allowed set of alternatives. An
135 implementation which does not include this option MUST be
136 prepared to interoperate with another implementation which
137 does include the option.
138
139
140 <span class="h3"><a class="selflink" id="section-1.2" href="#section-1.2">1.2</a>. Terminology</span>
141
142 This document frequently uses the following terms:
143
144 datagram The unit of transmission in the network layer (such as IP).
145 A datagram may be encapsulated in one or more packets
146 passed to the data link layer.
147
148 frame The unit of transmission at the data link layer. A frame
149 may include a header and/or a trailer, along with some
150 number of units of data.
151
152 packet The basic unit of encapsulation, which is passed across the
153 interface between the network layer and the data link
154 layer. A packet is usually mapped to a frame; the
155 exceptions are when data link layer fragmentation is being
156 performed, or when multiple packets are incorporated into a
157 single frame.
158
159 peer The other end of the point-to-point link.
160
161 silently discard
162 The implementation discards the packet without further
163 processing. The implementation SHOULD provide the
164 capability of logging the error, including the contents of
165 the silently discarded packet, and SHOULD record the event
166 in a statistics counter.
167
168
169 <span class="grey">Simpson [Page 2]</span></pre>
170 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span>
171 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
172
173
174 <span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Physical Layer Requirements</span>
175
176 PPP is capable of operating across most DTE/DCE interfaces (such as,
177 EIA RS-232-E, EIA RS-422, and CCITT V.35). The only absolute
178 requirement imposed by PPP is the provision of a full-duplex circuit,
179 either dedicated or circuit-switched, which can operate in either an
180 asynchronous (start/stop), bit-synchronous, or octet-synchronous
181 mode, transparent to PPP Data Link Layer frames.
182
183 Interface Format
184
185 PPP presents an octet interface to the physical layer. There is
186 no provision for sub-octets to be supplied or accepted.
187
188 Transmission Rate
189
190 PPP does not impose any restrictions regarding transmission rate,
191 other than that of the particular DTE/DCE interface.
192
193 Control Signals
194
195 PPP does not require the use of control signals, such as Request
196 To Send (RTS), Clear To Send (CTS), Data Carrier Detect (DCD), and
197 Data Terminal Ready (DTR).
198
199 When available, using such signals can allow greater functionality
200 and performance. In particular, such signals SHOULD be used to
201 signal the Up and Down events in the LCP Option Negotiation
202 Automaton [<a href="#ref-1" title="&quot;The Point-to-Point Protocol (PPP)&quot;">1</a>]. When such signals are not available, the
203 implementation MUST signal the Up event to LCP upon
204 initialization, and SHOULD NOT signal the Down event.
205
206 Because signalling is not required, the physical layer MAY be
207 decoupled from the data link layer, hiding the transient details
208 of the physical transport. This has implications for mobility in
209 cellular radio networks, and other rapidly switching links.
210
211 When moving from cell to cell within the same zone, an
212 implementation MAY choose to treat the entire zone as a single
213 link, even though transmission is switched among several
214 frequencies. The link is considered to be with the central
215 control unit for the zone, rather than the individual cell
216 transceivers. However, the link SHOULD re-establish its
217 configuration whenever the link is switched to a different
218 administration.
219
220 Due to the bursty nature of data traffic, some implementations
221 have choosen to disconnect the physical layer during periods of
222
223
224
225 <span class="grey">Simpson [Page 3]</span></pre>
226 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span>
227 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
228
229
230 inactivity, and reconnect when traffic resumes, without informing
231 the data link layer. Robust implementations should avoid using
232 this trick over-zealously, since the price for decreased setup
233 latency is decreased security. Implementations SHOULD signal the
234 Down event whenever "significant time" has elapsed since the link
235 was disconnected. The value for "significant time" is a matter of
236 considerable debate, and is based on the tariffs, call setup
237 times, and security concerns of the installation.
238
239
240
241 <span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. The Data Link Layer</span>
242
243 PPP uses the principles described in ISO 3309-1979 HDLC frame
244 structure, most recently the fourth edition 3309:1991 [<a href="#ref-2" title="&quot;Information Technology - Telecommunications and information exchange between systems - High-level data link control (HDLC) procedures - Frame structure&quot;">2</a>], which
245 specifies modifications to allow HDLC use in asynchronous
246 environments.
247
248 The PPP control procedures use the Control field encodings described
249 in ISO 4335-1979 HDLC elements of procedures, most recently the
250 fourth edition 4335:1991 [<a href="#ref-4" title="&quot;Information Technology - Telecommunications and information exchange between systems - High-level data link control (HDLC) procedures - Elements of procedures&quot;">4</a>].
251
252 This should not be construed to indicate that every feature of the
253 above recommendations are included in PPP. Each feature included
254 is explicitly described in the following sections.
255
256 To remain consistent with standard Internet practice, and avoid
257 confusion for people used to reading RFCs, all binary numbers in the
258 following descriptions are in Most Significant Bit to Least
259 Significant Bit order, reading from left to right, unless otherwise
260 indicated. Note that this is contrary to standard ISO and CCITT
261 practice which orders bits as transmitted (network bit order). Keep
262 this in mind when comparing this document with the international
263 standards documents.
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281 <span class="grey">Simpson [Page 4]</span></pre>
282 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span>
283 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
284
285
286 <span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a>. Frame Format</span>
287
288 A summary of the PPP HDLC-like frame structure is shown below. This
289 figure does not include bits inserted for synchronization (such as
290 start and stop bits for asynchronous links), nor any bits or octets
291 inserted for transparency. The fields are transmitted from left to
292 right.
293
294 +----------+----------+----------+
295 | Flag | Address | Control |
296 | 01111110 | 11111111 | 00000011 |
297 +----------+----------+----------+
298 +----------+-------------+---------+
299 | Protocol | Information | Padding |
300 | 8/16 bits| * | * |
301 +----------+-------------+---------+
302 +----------+----------+-----------------
303 | FCS | Flag | Inter-frame Fill
304 |16/32 bits| 01111110 | or next Address
305 +----------+----------+-----------------
306
307 The Protocol, Information and Padding fields are described in the
308 Point-to-Point Protocol Encapsulation [<a href="#ref-1" title="&quot;The Point-to-Point Protocol (PPP)&quot;">1</a>].
309
310 Flag Sequence
311
312 Each frame begins and ends with a Flag Sequence, which is the
313 binary sequence 01111110 (hexadecimal 0x7e). All implementations
314 continuously check for this flag, which is used for frame
315 synchronization.
316
317 Only one Flag Sequence is required between two frames. Two
318 consecutive Flag Sequences constitute an empty frame, which is
319 silently discarded, and not counted as a FCS error.
320
321 Address Field
322
323 The Address field is a single octet, which contains the binary
324 sequence 11111111 (hexadecimal 0xff), the All-Stations address.
325 Individual station addresses are not assigned. The All-Stations
326 address MUST always be recognized and received.
327
328 The use of other address lengths and values may be defined at a
329 later time, or by prior agreement. Frames with unrecognized
330 Addresses SHOULD be silently discarded.
331
332
333
334
335
336
337 <span class="grey">Simpson [Page 5]</span></pre>
338 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span>
339 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
340
341
342 Control Field
343
344 The Control field is a single octet, which contains the binary
345 sequence 00000011 (hexadecimal 0x03), the Unnumbered Information
346 (UI) command with the Poll/Final (P/F) bit set to zero.
347
348 The use of other Control field values may be defined at a later
349 time, or by prior agreement. Frames with unrecognized Control
350 field values SHOULD be silently discarded.
351
352 Frame Check Sequence (FCS) Field
353
354 The Frame Check Sequence field defaults to 16 bits (two octets).
355 The FCS is transmitted least significant octet first, which
356 contains the coefficient of the highest term.
357
358 A 32-bit (four octet) FCS is also defined. Its use may be
359 negotiated as described in "PPP LCP Extensions" [<a href="#ref-5" title="&quot;PPP LCP Extensions&quot;">5</a>].
360
361 The use of other FCS lengths may be defined at a later time, or by
362 prior agreement.
363
364 The FCS field is calculated over all bits of the Address, Control,
365 Protocol, Information and Padding fields, not including any start
366 and stop bits (asynchronous) nor any bits (synchronous) or octets
367 (asynchronous or synchronous) inserted for transparency. This
368 also does not include the Flag Sequences nor the FCS field itself.
369
370 When octets are received which are flagged in the Async-
371 Control-Character-Map, they are discarded before calculating
372 the FCS.
373
374 For more information on the specification of the FCS, see the
375 Appendices.
376
377 The end of the Information and Padding fields is found by locating
378 the closing Flag Sequence and removing the Frame Check Sequence
379 field.
380
381
382
383
384
385
386
387
388
389
390
391
392
393 <span class="grey">Simpson [Page 6]</span></pre>
394 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span>
395 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
396
397
398 <span class="h3"><a class="selflink" id="section-3.2" href="#section-3.2">3.2</a>. Modification of the Basic Frame</span>
399
400 The Link Control Protocol can negotiate modifications to the standard
401 HDLC-like frame structure. However, modified frames will always be
402 clearly distinguishable from standard frames.
403
404 Address-and-Control-Field-Compression
405
406 When using the standard HDLC-like framing, the Address and Control
407 fields contain the hexadecimal values 0xff and 0x03 respectively.
408 When other Address or Control field values are in use, Address-
409 and-Control-Field-Compression MUST NOT be negotiated.
410
411 On transmission, compressed Address and Control fields are simply
412 omitted.
413
414 On reception, the Address and Control fields are decompressed by
415 examining the first two octets. If they contain the values 0xff
416 and 0x03, they are assumed to be the Address and Control fields.
417 If not, it is assumed that the fields were compressed and were not
418 transmitted.
419
420 By definition, the first octet of a two octet Protocol field
421 will never be 0xff (since it is not even). The Protocol field
422 value 0x00ff is not allowed (reserved) to avoid ambiguity when
423 Protocol-Field-Compression is enabled and the first Information
424 field octet is 0x03.
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449 <span class="grey">Simpson [Page 7]</span></pre>
450 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span>
451 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
452
453
454 <span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Octet-stuffed framing</span>
455
456 This chapter summarizes the use of HDLC-like framing with 8-bit
457 asynchronous and octet-synchronous links.
458
459
460
461 <span class="h3"><a class="selflink" id="section-4.1" href="#section-4.1">4.1</a>. Flag Sequence</span>
462
463 The Flag Sequence indicates the beginning or end of a frame. The
464 octet stream is examined on an octet-by-octet basis for the value
465 01111110 (hexadecimal 0x7e).
466
467
468
469 <span class="h3"><a class="selflink" id="section-4.2" href="#section-4.2">4.2</a>. Transparency</span>
470
471 An octet stuffing procedure is used. The Control Escape octet is
472 defined as binary 01111101 (hexadecimal 0x7d), most significant bit
473 first.
474
475 As a minimum, sending implementations MUST escape the Flag Sequence
476 and Control Escape octets.
477
478 After FCS computation, the transmitter examines the entire frame
479 between the two Flag Sequences. Each Flag Sequence, Control Escape
480 octet, and any octet which is flagged in the sending Async-Control-
481 Character-Map (ACCM), is replaced by a two octet sequence consisting
482 of the Control Escape octet followed by the original octet
483 exclusive-or'd with hexadecimal 0x20.
484
485 This is bit 5 complemented, where the bit positions are numbered
486 76543210 (the 6th bit as used in ISO numbered 87654321 -- BEWARE
487 when comparing documents).
488
489 Receiving implementations MUST correctly process all Control Escape
490 sequences.
491
492 On reception, prior to FCS computation, each octet with value less
493 than hexadecimal 0x20 is checked. If it is flagged in the receiving
494 ACCM, it is simply removed (it may have been inserted by intervening
495 data communications equipment). Each Control Escape octet is also
496 removed, and the following octet is exclusive-or'd with hexadecimal
497 0x20, unless it is the Flag Sequence (which aborts a frame).
498
499 A few examples may make this more clear. Escaped data is transmitted
500 on the link as follows:
501
502
503
504
505 <span class="grey">Simpson [Page 8]</span></pre>
506 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span>
507 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
508
509
510
511 0x7e is encoded as 0x7d, 0x5e. (Flag Sequence)
512 0x7d is encoded as 0x7d, 0x5d. (Control Escape)
513 0x03 is encoded as 0x7d, 0x23. (ETX)
514
515 Some modems with software flow control may intercept outgoing DC1 and
516 DC3 ignoring the 8th (parity) bit. This data would be transmitted on
517 the link as follows:
518
519 0x11 is encoded as 0x7d, 0x31. (XON)
520 0x13 is encoded as 0x7d, 0x33. (XOFF)
521 0x91 is encoded as 0x7d, 0xb1. (XON with parity set)
522 0x93 is encoded as 0x7d, 0xb3. (XOFF with parity set)
523
524
525
526
527 <span class="h3"><a class="selflink" id="section-4.3" href="#section-4.3">4.3</a>. Invalid Frames</span>
528
529 Frames which are too short (less than 4 octets when using the 16-bit
530 FCS), or which end with a Control Escape octet followed immediately
531 by a closing Flag Sequence, or in which octet-framing is violated (by
532 transmitting a "0" stop bit where a "1" bit is expected), are
533 silently discarded, and not counted as a FCS error.
534
535
536
537 <span class="h3"><a class="selflink" id="section-4.4" href="#section-4.4">4.4</a>. Time Fill</span>
538
539 <span class="h4"><a class="selflink" id="section-4.4.1" href="#section-4.4.1">4.4.1</a>. Octet-synchronous</span>
540
541 There is no provision for inter-octet time fill.
542
543 The Flag Sequence MUST be transmitted during inter-frame time fill.
544
545
546 <span class="h4"><a class="selflink" id="section-4.4.2" href="#section-4.4.2">4.4.2</a>. Asynchronous</span>
547
548 Inter-octet time fill MUST be accomplished by transmitting continuous
549 "1" bits (mark-hold state).
550
551 Inter-frame time fill can be viewed as extended inter-octet time
552 fill. Doing so can save one octet for every frame, decreasing delay
553 and increasing bandwidth. This is possible since a Flag Sequence may
554 serve as both a frame end and a frame begin. After having received
555 any frame, an idle receiver will always be in a frame begin state.
556
557
558
559
560 <span class="grey">Simpson [Page 9]</span></pre>
561 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span>
562 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
563
564
565 Robust transmitters should avoid using this trick over-zealously,
566 since the price for decreased delay is decreased reliability. Noisy
567 links may cause the receiver to receive garbage characters and
568 interpret them as part of an incoming frame. If the transmitter does
569 not send a new opening Flag Sequence before sending the next frame,
570 then that frame will be appended to the noise characters causing an
571 invalid frame (with high reliability).
572
573 It is suggested that implementations will achieve the best results by
574 always sending an opening Flag Sequence if the new frame is not
575 back-to-back with the last. Transmitters SHOULD send an open Flag
576 Sequence whenever "appreciable time" has elapsed after the prior
577 closing Flag Sequence. The maximum value for "appreciable time" is
578 likely to be no greater than the typing rate of a slow typist, about
579 1 second.
580
581
582
583 <span class="h3"><a class="selflink" id="section-4.5" href="#section-4.5">4.5</a>. Transmission Considerations</span>
584
585 <span class="h4"><a class="selflink" id="section-4.5.1" href="#section-4.5.1">4.5.1</a>. Octet-synchronous</span>
586
587 The definition of various encodings and scrambling is the
588 responsibility of the DTE/DCE equipment in use, and is outside the
589 scope of this specification.
590
591
592 <span class="h4"><a class="selflink" id="section-4.5.2" href="#section-4.5.2">4.5.2</a>. Asynchronous</span>
593
594 All octets are transmitted least significant bit first, with one
595 start bit, eight bits of data, and one stop bit. There is no
596 provision for seven bit asynchronous links.
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615 <span class="grey">Simpson [Page 10]</span></pre>
616 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-11" ></span>
617 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
618
619
620 <span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. Bit-stuffed framing</span>
621
622 This chapter summarizes the use of HDLC-like framing with bit-
623 synchronous links.
624
625
626
627 <span class="h3"><a class="selflink" id="section-5.1" href="#section-5.1">5.1</a>. Flag Sequence</span>
628
629 The Flag Sequence indicates the beginning or end of a frame, and is
630 used for frame synchronization. The bit stream is examined on a
631 bit-by-bit basis for the binary sequence 01111110 (hexadecimal 0x7e).
632
633 The "shared zero mode" Flag Sequence "011111101111110" SHOULD NOT be
634 used. When not avoidable, such an implementation MUST ensure that
635 the first Flag Sequence detected (the end of the frame) is promptly
636 communicated to the link layer. Use of the shared zero mode hinders
637 interoperability with bit-synchronous to asynchronous and bit-
638 synchronous to octet-synchronous converters.
639
640
641
642 <span class="h3"><a class="selflink" id="section-5.2" href="#section-5.2">5.2</a>. Transparency</span>
643
644 After FCS computation, the transmitter examines the entire frame
645 between the two Flag Sequences. A "0" bit is inserted after all
646 sequences of five contiguous "1" bits (including the last 5 bits of
647 the FCS) to ensure that a Flag Sequence is not simulated.
648
649 On reception, prior to FCS computation, any "0" bit that directly
650 follows five contiguous "1" bits is discarded.
651
652
653
654 <span class="h3"><a class="selflink" id="section-5.3" href="#section-5.3">5.3</a>. Invalid Frames</span>
655
656 Frames which are too short (less than 4 octets when using the 16-bit
657 FCS), or which end with a sequence of more than six "1" bits, are
658 silently discarded, and not counted as a FCS error.
659
660
661
662 <span class="h3"><a class="selflink" id="section-5.4" href="#section-5.4">5.4</a>. Time Fill</span>
663
664 There is no provision for inter-octet time fill.
665
666 The Flag Sequence SHOULD be transmitted during inter-frame time fill.
667 However, certain types of circuit-switched links require the use of
668
669
670
671 <span class="grey">Simpson [Page 11]</span></pre>
672 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-12" ></span>
673 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
674
675
676 mark idle (continuous ones), particularly those that calculate
677 accounting based on periods of bit activity. When mark idle is used
678 on a bit-synchronous link, the implementation MUST ensure at least 15
679 consecutive "1" bits between Flags during the idle period, and that
680 the Flag Sequence is always generated at the beginning of a frame
681 after an idle period.
682
683 This differs from practice in ISO 3309, which allows 7 to 14 bit
684 mark idle.
685
686
687
688 <span class="h3"><a class="selflink" id="section-5.5" href="#section-5.5">5.5</a>. Transmission Considerations</span>
689
690 All octets are transmitted least significant bit first.
691
692 The definition of various encodings and scrambling is the
693 responsibility of the DTE/DCE equipment in use, and is outside the
694 scope of this specification.
695
696 While PPP will operate without regard to the underlying
697 representation of the bit stream, lack of standards for transmission
698 will hinder interoperability as surely as lack of data link
699 standards. At speeds of 56 Kbps through 2.0 Mbps, NRZ is currently
700 most widely available, and on that basis is recommended as a default.
701
702 When configuration of the encoding is allowed, NRZI is recommended as
703 an alternative, because of its relative immunity to signal inversion
704 configuration errors, and instances when it MAY allow connection
705 without an expensive DSU/CSU. Unfortunately, NRZI encoding
706 exacerbates the missing x1 factor of the 16-bit FCS, so that one
707 error in 2**15 goes undetected (instead of one in 2**16), and triple
708 errors are not detected. Therefore, when NRZI is in use, it is
709 recommended that the 32-bit FCS be negotiated, which includes the x1
710 factor.
711
712 At higher speeds of up to 45 Mbps, some implementors have chosen the
713 ANSI High Speed Synchronous Interface [HSSI]. While this experience
714 is currently limited, implementors are encouraged to cooperate in
715 choosing transmission encoding.
716
717
718
719
720
721
722
723
724
725
726
727 <span class="grey">Simpson [Page 12]</span></pre>
728 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-13" ></span>
729 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
730
731
732 <span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. Asynchronous to Synchronous Conversion</span>
733
734 There may be some use of asynchronous-to-synchronous converters (some
735 built into modems and cellular interfaces), resulting in an
736 asynchronous PPP implementation on one end of a link and a
737 synchronous implementation on the other. It is the responsibility of
738 the converter to do all stuffing conversions during operation.
739
740 To enable this functionality, synchronous PPP implementations MUST
741 always respond to the Async-Control-Character-Map Configuration
742 Option with the LCP Configure-Ack. However, acceptance of the
743 Configuration Option does not imply that the synchronous
744 implementation will do any ACCM mapping. Instead, all such octet
745 mapping will be performed by the asynchronous-to-synchronous
746 converter.
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783 <span class="grey">Simpson [Page 13]</span></pre>
784 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-14" ></span>
785 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
786
787
788 <span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. Additional LCP Configuration Options</span>
789
790 The Configuration Option format and basic options are already defined
791 for LCP [<a href="#ref-1" title="&quot;The Point-to-Point Protocol (PPP)&quot;">1</a>].
792
793 Up-to-date values of the LCP Option Type field are specified in the
794 most recent "Assigned Numbers" RFC [<a href="#ref-10" title="&quot;Assigned Numbers&quot;">10</a>]. This document concerns the
795 following values:
796
797 2 Async-Control-Character-Map
798
799
800
801
802 <span class="h3"><a class="selflink" id="section-7.1" href="#section-7.1">7.1</a>. Async-Control-Character-Map (ACCM)</span>
803
804 Description
805
806 This Configuration Option provides a method to negotiate the use
807 of control character transparency on asynchronous links.
808
809 Each end of the asynchronous link maintains two Async-Control-
810 Character-Maps. The receiving ACCM is 32 bits, but the sending
811 ACCM may be up to 256 bits. This results in four distinct ACCMs,
812 two in each direction of the link.
813
814 For asynchronous links, the default receiving ACCM is 0xffffffff.
815 The default sending ACCM is 0xffffffff, plus the Control Escape
816 and Flag Sequence characters themselves, plus whatever other
817 outgoing characters are flagged (by prior configuration) as likely
818 to be intercepted.
819
820 For other types of links, the default value is 0, since there is
821 no need for mapping.
822
823 The default inclusion of all octets less than hexadecimal 0x20
824 allows all ASCII control characters [<a href="#ref-6" title="&quot;American National Standard Code for Information Interchange&quot;">6</a>] excluding DEL (Delete)
825 to be transparently communicated through all known data
826 communications equipment.
827
828 The transmitter MAY also send octets with values in the range 0x40
829 through 0xff (except 0x5e) in Control Escape format. Since these
830 octet values are not negotiable, this does not solve the problem
831 of receivers which cannot handle all non-control characters.
832 Also, since the technique does not affect the 8th bit, this does
833 not solve problems for communications links that can send only 7-
834 bit characters.
835
836
837
838
839 <span class="grey">Simpson [Page 14]</span></pre>
840 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-15" ></span>
841 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
842
843
844 Note that this specification differs in detail from later
845 amendments, such as 3309:1991/Amendment 2 [<a href="#ref-3" title="&quot;Information Technology - Telecommunications and information exchange between systems - High-level data link control (HDLC) procedures - Frame structure - Amendment 2: Extended transparency options for start/stop transmission&quot;">3</a>]. However, such
846 "extended transparency" is applied only by "prior agreement".
847 Use of the transparency methods in this specification
848 constitute a prior agreement with respect to PPP.
849
850 For compatibility with 3309:1991/Amendment 2, the transmitter
851 MAY escape DEL and ACCM equivalents with the 8th (most
852 significant) bit set. No change is required in the receiving
853 algorithm.
854
855 Following ACCM negotiation, the transmitter SHOULD cease
856 escaping DEL.
857
858 However, it is rarely necessary to map all control characters, and
859 often it is unnecessary to map any control characters. The
860 Configuration Option is used to inform the peer which control
861 characters MUST remain mapped when the peer sends them.
862
863 The peer MAY still send any other octets in mapped format, if it
864 is necessary because of constraints known to the peer. The peer
865 SHOULD Configure-Nak with the logical union of the sets of mapped
866 octets, so that when such octets are spuriously introduced they
867 can be ignored on receipt.
868
869 A summary of the Async-Control-Character-Map Configuration Option
870 format is shown below. The fields are transmitted from left to
871 right.
872
873 0 1 2 3
874 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
875 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
876 | Type | Length | ACCM
877 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
878 ACCM (cont) |
879 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
880
881
882 Type
883
884 2
885
886 Length
887
888 6
889
890
891
892
893
894
895 <span class="grey">Simpson [Page 15]</span></pre>
896 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-16" ></span>
897 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
898
899
900 ACCM
901
902 The ACCM field is four octets, and indicates the set of control
903 characters to be mapped. The map is sent most significant octet
904 first.
905
906 Each numbered bit corresponds to the octet of the same value. If
907 the bit is cleared to zero, then that octet need not be mapped.
908 If the bit is set to one, then that octet MUST remain mapped. For
909 example, if bit 19 is set to zero, then the ASCII control
910 character 19 (DC3, Control-S) MAY be sent in the clear.
911
912 Note: The least significant bit of the least significant octet
913 (the final octet transmitted) is numbered bit 0, and would map
914 to the ASCII control character NUL.
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951 <span class="grey">Simpson [Page 16]</span></pre>
952 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-17" ></span>
953 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
954
955
956 <span class="h2"><a class="selflink" id="appendix-A" href="#appendix-A">A</a>. Recommended LCP Options</span>
957
958 The following Configurations Options are recommended:
959
960 High Speed links
961
962 Magic Number
963 Link Quality Monitoring
964 No Address and Control Field Compression
965 No Protocol Field Compression
966
967
968 Low Speed or Asynchronous links
969
970 Async Control Character Map
971 Magic Number
972 Address and Control Field Compression
973 Protocol Field Compression
974
975
976
977 <span class="h2"><a class="selflink" id="appendix-B" href="#appendix-B">B</a>. Automatic Recognition of PPP Frames</span>
978
979 It is sometimes desirable to detect PPP frames, for example during a
980 login sequence. The following octet sequences all begin valid PPP
981 LCP frames:
982
983 7e ff 03 c0 21
984 7e ff 7d 23 c0 21
985 7e 7d df 7d 23 c0 21
986
987 Note that the first two forms are not a valid username for Unix.
988 However, only the third form generates a correctly checksummed PPP
989 frame, whenever 03 and ff are taken as the control characters ETX and
990 DEL without regard to parity (they are correct for an even parity
991 link) and discarded.
992
993 Many implementations deal with this by putting the interface into
994 packet mode when one of the above username patterns are detected
995 during login, without examining the initial PPP checksum. The
996 initial incoming PPP frame is discarded, but a Configure-Request is
997 sent immediately.
998
999
1000
1001
1002
1003
1004
1005
1006
1007 <span class="grey">Simpson [Page 17]</span></pre>
1008 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-18" ></span>
1009 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
1010
1011
1012 <span class="h2"><a class="selflink" id="appendix-C" href="#appendix-C">C</a>. Fast Frame Check Sequence (FCS) Implementation</span>
1013
1014 The FCS was originally designed with hardware implementations in
1015 mind. A serial bit stream is transmitted on the wire, the FCS is
1016 calculated over the serial data as it goes out, and the complement of
1017 the resulting FCS is appended to the serial stream, followed by the
1018 Flag Sequence.
1019
1020 The receiver has no way of determining that it has finished
1021 calculating the received FCS until it detects the Flag Sequence.
1022 Therefore, the FCS was designed so that a particular pattern results
1023 when the FCS operation passes over the complemented FCS. A good
1024 frame is indicated by this "good FCS" value.
1025
1026
1027
1028 <span class="h3"><a class="selflink" id="appendix-C.1" href="#appendix-C.1">C.1</a>. FCS table generator</span>
1029
1030 The following code creates the lookup table used to calculate the
1031 FCS-16.
1032
1033 /*
1034 * Generate a FCS-16 table.
1035 *
1036 * Drew D. Perkins at Carnegie Mellon University.
1037 *
1038 * Code liberally borrowed from Mohsen Banan and D. Hugh Redelmeier.
1039 */
1040
1041 /*
1042 * The FCS-16 generator polynomial: x**0 + x**5 + x**12 + x**16.
1043 */
1044 #define P 0x8408
1045
1046
1047 main()
1048 {
1049 register unsigned int b, v;
1050 register int i;
1051
1052 printf("typedef unsigned short u16;\n");
1053 printf("static u16 fcstab[256] = {");
1054 for (b = 0; ; ) {
1055 if (b % 8 == 0)
1056 printf("\n");
1057
1058 v = b;
1059 for (i = 8; i--; )
1060
1061
1062
1063 <span class="grey">Simpson [Page 18]</span></pre>
1064 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-19" ></span>
1065 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
1066
1067
1068 v = v &amp; 1 ? (v &gt;&gt; 1) ^ P : v &gt;&gt; 1;
1069
1070 printf("\t0x%04x", v &amp; 0xFFFF);
1071 if (++b == 256)
1072 break;
1073 printf(",");
1074 }
1075 printf("\n};\n");
1076 }
1077
1078
1079
1080 <span class="h3"><a class="selflink" id="appendix-C.2" href="#appendix-C.2">C.2</a>. 16-bit FCS Computation Method</span>
1081
1082 The following code provides a table lookup computation for
1083 calculating the Frame Check Sequence as data arrives at the
1084 interface. This implementation is based on [<a href="#ref-7" title="&quot;Byte-wise CRC Calculations&quot;">7</a>], [<a href="#ref-8" title="&quot;Calculating CRC's by Bits and Bytes&quot;">8</a>], and [<a href="#ref-9" title="&quot;A Fast CRC&quot;">9</a>].
1085
1086 /*
1087 * u16 represents an unsigned 16-bit number. Adjust the typedef for
1088 * your hardware.
1089 */
1090 typedef unsigned short u16;
1091
1092 /*
1093 * FCS lookup table as calculated by the table generator.
1094 */
1095 static u16 fcstab[256] = {
1096 0x0000, 0x1189, 0x2312, 0x329b, 0x4624, 0x57ad, 0x6536, 0x74bf,
1097 0x8c48, 0x9dc1, 0xaf5a, 0xbed3, 0xca6c, 0xdbe5, 0xe97e, 0xf8f7,
1098 0x1081, 0x0108, 0x3393, 0x221a, 0x56a5, 0x472c, 0x75b7, 0x643e,
1099 0x9cc9, 0x8d40, 0xbfdb, 0xae52, 0xdaed, 0xcb64, 0xf9ff, 0xe876,
1100 0x2102, 0x308b, 0x0210, 0x1399, 0x6726, 0x76af, 0x4434, 0x55bd,
1101 0xad4a, 0xbcc3, 0x8e58, 0x9fd1, 0xeb6e, 0xfae7, 0xc87c, 0xd9f5,
1102 0x3183, 0x200a, 0x1291, 0x0318, 0x77a7, 0x662e, 0x54b5, 0x453c,
1103 0xbdcb, 0xac42, 0x9ed9, 0x8f50, 0xfbef, 0xea66, 0xd8fd, 0xc974,
1104 0x4204, 0x538d, 0x6116, 0x709f, 0x0420, 0x15a9, 0x2732, 0x36bb,
1105 0xce4c, 0xdfc5, 0xed5e, 0xfcd7, 0x8868, 0x99e1, 0xab7a, 0xbaf3,
1106 0x5285, 0x430c, 0x7197, 0x601e, 0x14a1, 0x0528, 0x37b3, 0x263a,
1107 0xdecd, 0xcf44, 0xfddf, 0xec56, 0x98e9, 0x8960, 0xbbfb, 0xaa72,
1108 0x6306, 0x728f, 0x4014, 0x519d, 0x2522, 0x34ab, 0x0630, 0x17b9,
1109 0xef4e, 0xfec7, 0xcc5c, 0xddd5, 0xa96a, 0xb8e3, 0x8a78, 0x9bf1,
1110 0x7387, 0x620e, 0x5095, 0x411c, 0x35a3, 0x242a, 0x16b1, 0x0738,
1111 0xffcf, 0xee46, 0xdcdd, 0xcd54, 0xb9eb, 0xa862, 0x9af9, 0x8b70,
1112 0x8408, 0x9581, 0xa71a, 0xb693, 0xc22c, 0xd3a5, 0xe13e, 0xf0b7,
1113 0x0840, 0x19c9, 0x2b52, 0x3adb, 0x4e64, 0x5fed, 0x6d76, 0x7cff,
1114 0x9489, 0x8500, 0xb79b, 0xa612, 0xd2ad, 0xc324, 0xf1bf, 0xe036,
1115 0x18c1, 0x0948, 0x3bd3, 0x2a5a, 0x5ee5, 0x4f6c, 0x7df7, 0x6c7e,
1116
1117
1118
1119 <span class="grey">Simpson [Page 19]</span></pre>
1120 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-20" ></span>
1121 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
1122
1123
1124 0xa50a, 0xb483, 0x8618, 0x9791, 0xe32e, 0xf2a7, 0xc03c, 0xd1b5,
1125 0x2942, 0x38cb, 0x0a50, 0x1bd9, 0x6f66, 0x7eef, 0x4c74, 0x5dfd,
1126 0xb58b, 0xa402, 0x9699, 0x8710, 0xf3af, 0xe226, 0xd0bd, 0xc134,
1127 0x39c3, 0x284a, 0x1ad1, 0x0b58, 0x7fe7, 0x6e6e, 0x5cf5, 0x4d7c,
1128 0xc60c, 0xd785, 0xe51e, 0xf497, 0x8028, 0x91a1, 0xa33a, 0xb2b3,
1129 0x4a44, 0x5bcd, 0x6956, 0x78df, 0x0c60, 0x1de9, 0x2f72, 0x3efb,
1130 0xd68d, 0xc704, 0xf59f, 0xe416, 0x90a9, 0x8120, 0xb3bb, 0xa232,
1131 0x5ac5, 0x4b4c, 0x79d7, 0x685e, 0x1ce1, 0x0d68, 0x3ff3, 0x2e7a,
1132 0xe70e, 0xf687, 0xc41c, 0xd595, 0xa12a, 0xb0a3, 0x8238, 0x93b1,
1133 0x6b46, 0x7acf, 0x4854, 0x59dd, 0x2d62, 0x3ceb, 0x0e70, 0x1ff9,
1134 0xf78f, 0xe606, 0xd49d, 0xc514, 0xb1ab, 0xa022, 0x92b9, 0x8330,
1135 0x7bc7, 0x6a4e, 0x58d5, 0x495c, 0x3de3, 0x2c6a, 0x1ef1, 0x0f78
1136 };
1137
1138 #define PPPINITFCS16 0xffff /* Initial FCS value */
1139 #define PPPGOODFCS16 0xf0b8 /* Good final FCS value */
1140
1141 /*
1142 * Calculate a new fcs given the current fcs and the new data.
1143 */
1144 u16 pppfcs16(fcs, cp, len)
1145 register u16 fcs;
1146 register unsigned char *cp;
1147 register int len;
1148 {
1149 ASSERT(sizeof (u16) == 2);
1150 ASSERT(((u16) -1) &gt; 0);
1151 while (len--)
1152 fcs = (fcs &gt;&gt; 8) ^ fcstab[(fcs ^ *cp++) &amp; 0xff];
1153
1154 return (fcs);
1155 }
1156
1157 /*
1158 * How to use the fcs
1159 */
1160 tryfcs16(cp, len)
1161 register unsigned char *cp;
1162 register int len;
1163 {
1164 u16 trialfcs;
1165
1166 /* add on output */
1167 trialfcs = pppfcs16( PPPINITFCS16, cp, len );
1168 trialfcs ^= 0xffff; /* complement */
1169 cp[len] = (trialfcs &amp; 0x00ff); /* least significant byte first */
1170 cp[len+1] = ((trialfcs &gt;&gt; 8) &amp; 0x00ff);
1171
1172
1173
1174
1175 <span class="grey">Simpson [Page 20]</span></pre>
1176 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-21" ></span>
1177 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
1178
1179
1180 /* check on input */
1181 trialfcs = pppfcs16( PPPINITFCS16, cp, len + 2 );
1182 if ( trialfcs == PPPGOODFCS16 )
1183 printf("Good FCS\n");
1184 }
1185
1186
1187
1188 <span class="h3"><a class="selflink" id="appendix-C.3" href="#appendix-C.3">C.3</a>. 32-bit FCS Computation Method</span>
1189
1190 The following code provides a table lookup computation for
1191 calculating the 32-bit Frame Check Sequence as data arrives at the
1192 interface.
1193
1194 /*
1195 * The FCS-32 generator polynomial: x**0 + x**1 + x**2 + x**4 + x**5
1196 * + x**7 + x**8 + x**10 + x**11 + x**12 + x**16
1197 * + x**22 + x**23 + x**26 + x**32.
1198 */
1199
1200 /*
1201 * u32 represents an unsigned 32-bit number. Adjust the typedef for
1202 * your hardware.
1203 */
1204 typedef unsigned long u32;
1205
1206 static u32 fcstab_32[256] =
1207 {
1208 0x00000000, 0x77073096, 0xee0e612c, 0x990951ba,
1209 0x076dc419, 0x706af48f, 0xe963a535, 0x9e6495a3,
1210 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,
1211 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91,
1212 0x1db71064, 0x6ab020f2, 0xf3b97148, 0x84be41de,
1213 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,
1214 0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec,
1215 0x14015c4f, 0x63066cd9, 0xfa0f3d63, 0x8d080df5,
1216 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,
1217 0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b,
1218 0x35b5a8fa, 0x42b2986c, 0xdbbbc9d6, 0xacbcf940,
1219 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,
1220 0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116,
1221 0x21b4f4b5, 0x56b3c423, 0xcfba9599, 0xb8bda50f,
1222 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
1223 0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d,
1224 0x76dc4190, 0x01db7106, 0x98d220bc, 0xefd5102a,
1225 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,
1226 0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818,
1227 0x7f6a0dbb, 0x086d3d2d, 0x91646c97, 0xe6635c01,
1228
1229
1230
1231 <span class="grey">Simpson [Page 21]</span></pre>
1232 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-22" ></span>
1233 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
1234
1235
1236 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,
1237 0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457,
1238 0x65b0d9c6, 0x12b7e950, 0x8bbeb8ea, 0xfcb9887c,
1239 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,
1240 0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2,
1241 0x4adfa541, 0x3dd895d7, 0xa4d1c46d, 0xd3d6f4fb,
1242 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,
1243 0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9,
1244 0x5005713c, 0x270241aa, 0xbe0b1010, 0xc90c2086,
1245 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
1246 0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4,
1247 0x59b33d17, 0x2eb40d81, 0xb7bd5c3b, 0xc0ba6cad,
1248 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,
1249 0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683,
1250 0xe3630b12, 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8,
1251 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,
1252 0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe,
1253 0xf762575d, 0x806567cb, 0x196c3671, 0x6e6b06e7,
1254 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,
1255 0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5,
1256 0xd6d6a3e8, 0xa1d1937e, 0x38d8c2c4, 0x4fdff252,
1257 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,
1258 0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60,
1259 0xdf60efc3, 0xa867df55, 0x316e8eef, 0x4669be79,
1260 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
1261 0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f,
1262 0xc5ba3bbe, 0xb2bd0b28, 0x2bb45a92, 0x5cb36a04,
1263 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,
1264 0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a,
1265 0x9c0906a9, 0xeb0e363f, 0x72076785, 0x05005713,
1266 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,
1267 0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21,
1268 0x86d3d2d4, 0xf1d4e242, 0x68ddb3f8, 0x1fda836e,
1269 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,
1270 0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c,
1271 0x8f659eff, 0xf862ae69, 0x616bffd3, 0x166ccf45,
1272 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,
1273 0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db,
1274 0xaed16a4a, 0xd9d65adc, 0x40df0b66, 0x37d83bf0,
1275 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
1276 0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6,
1277 0xbad03605, 0xcdd70693, 0x54de5729, 0x23d967bf,
1278 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,
1279 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d
1280 };
1281
1282 #define PPPINITFCS32 0xffffffff /* Initial FCS value */
1283 #define PPPGOODFCS32 0xdebb20e3 /* Good final FCS value */
1284
1285
1286
1287 <span class="grey">Simpson [Page 22]</span></pre>
1288 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-23" ></span>
1289 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
1290
1291
1292 /*
1293 * Calculate a new FCS given the current FCS and the new data.
1294 */
1295 u32 pppfcs32(fcs, cp, len)
1296 register u32 fcs;
1297 register unsigned char *cp;
1298 register int len;
1299 {
1300 ASSERT(sizeof (u32) == 4);
1301 ASSERT(((u32) -1) &gt; 0);
1302 while (len--)
1303 fcs = (((fcs) &gt;&gt; 8) ^ fcstab_32[((fcs) ^ (*cp++)) &amp; 0xff]);
1304
1305 return (fcs);
1306 }
1307
1308 /*
1309 * How to use the fcs
1310 */
1311 tryfcs32(cp, len)
1312 register unsigned char *cp;
1313 register int len;
1314 {
1315 u32 trialfcs;
1316
1317 /* add on output */
1318 trialfcs = pppfcs32( PPPINITFCS32, cp, len );
1319 trialfcs ^= 0xffffffff; /* complement */
1320 cp[len] = (trialfcs &amp; 0x00ff); /* least significant byte first */
1321 cp[len+1] = ((trialfcs &gt;&gt;= 8) &amp; 0x00ff);
1322 cp[len+2] = ((trialfcs &gt;&gt;= 8) &amp; 0x00ff);
1323 cp[len+3] = ((trialfcs &gt;&gt; 8) &amp; 0x00ff);
1324
1325 /* check on input */
1326 trialfcs = pppfcs32( PPPINITFCS32, cp, len + 4 );
1327 if ( trialfcs == PPPGOODFCS32 )
1328 printf("Good FCS\n");
1329 }
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343 <span class="grey">Simpson [Page 23]</span></pre>
1344 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-24" ></span>
1345 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
1346
1347
1348 Security Considerations
1349
1350 As noted in the Physical Layer Requirements section, the link layer
1351 might not be informed when the connected state of the physical layer
1352 has changed. This results in possible security lapses due to over-
1353 reliance on the integrity and security of switching systems and
1354 administrations. An insertion attack might be undetected. An
1355 attacker which is able to spoof the same calling identity might be
1356 able to avoid link authentication.
1357
1358
1359
1360 References
1361
1362 [<a id="ref-1">1</a>] Simpson, W., Editor, "The Point-to-Point Protocol (PPP)",
1363 STD 50, <a href="./rfc1661">RFC 1661</a>, Daydreamer, July 1994.
1364
1365 [<a id="ref-2">2</a>] ISO/IEC 3309:1991(E), "Information Technology -
1366 Telecommunications and information exchange between systems -
1367 High-level data link control (HDLC) procedures - Frame
1368 structure", International Organization For Standardization,
1369 Fourth edition 1991-06-01.
1370
1371 [<a id="ref-3">3</a>] ISO/IEC 3309:1991/Amd.2:1992(E), "Information Technology -
1372 Telecommunications and information exchange between systems -
1373 High-level data link control (HDLC) procedures - Frame
1374 structure - Amendment 2: Extended transparency options for
1375 start/stop transmission", International Organization For
1376 Standardization, 1992-01-15.
1377
1378 [<a id="ref-4">4</a>] ISO/IEC 4335:1991(E), "Information Technology -
1379 Telecommunications and information exchange between systems -
1380 High-level data link control (HDLC) procedures - Elements of
1381 procedures", International Organization For Standardization,
1382 Fourth edition 1991-09-15.
1383
1384 [<a id="ref-5">5</a>] Simpson, W., Editor, "PPP LCP Extensions", <a href="./rfc1570">RFC 1570</a>,
1385 Daydreamer, January 1994.
1386
1387 [<a id="ref-6">6</a>] ANSI X3.4-1977, "American National Standard Code for
1388 Information Interchange", American National Standards
1389 Institute, 1977.
1390
1391 [<a id="ref-7">7</a>] Perez, "Byte-wise CRC Calculations", IEEE Micro, June 1983.
1392
1393 [<a id="ref-8">8</a>] Morse, G., "Calculating CRC's by Bits and Bytes", Byte,
1394 September 1986.
1395
1396
1397
1398
1399 <span class="grey">Simpson [Page 24]</span></pre>
1400 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-25" ></span>
1401 <span class="grey"><a href="./rfc1662">RFC 1662</a> HDLC-like Framing July 1994</span>
1402
1403
1404 [<a id="ref-9">9</a>] LeVan, J., "A Fast CRC", Byte, November 1987.
1405
1406 [<a id="ref-10">10</a>] Reynolds, J., and J. Postel, "Assigned Numbers", STD 2, <a href="./rfc1340">RFC</a>
1407 <a href="./rfc1340">1340</a>, USC/Information Sciences Institute, July 1992.
1408
1409
1410
1411 Acknowledgements
1412
1413 This document is the product of the Point-to-Point Protocol Working
1414 Group of the Internet Engineering Task Force (IETF). Comments should
1415 be submitted to the [email protected] mailing list.
1416
1417 This specification is based on previous RFCs, where many
1418 contributions have been acknowleged.
1419
1420 The 32-bit FCS example code was provided by Karl Fox (Morning Star
1421 Technologies).
1422
1423 Special thanks to Morning Star Technologies for providing computing
1424 resources and network access support for writing this specification.
1425
1426
1427
1428 Chair's Address
1429
1430 The working group can be contacted via the current chair:
1431
1432 Fred Baker
1433 Advanced Computer Communications
1434 315 Bollay Drive
1435 Santa Barbara, California 93117
1436
1437 [email protected]
1438
1439
1440 Editor's Address
1441
1442 Questions about this memo can also be directed to:
1443
1444 William Allen Simpson
1445 Daydreamer
1446 Computer Systems Consulting Services
1447 1384 Fontaine
1448 Madison Heights, Michigan 48071
1449
1450 [email protected]
1451 [email protected]
1452
1453
1454 Simpson [Page 25]
1455 </pre>