Chapter3 DataLink

7/21/2019 Chapter3 DataLink

http://slidepdf.com/reader/full/chapter3-datalink 1/112

Computer Networks



Computer Networks

Prof. Lin Weiguo

College of ComputingCopyleft© 2003~2015

[email protected]

http://icourse.cuc.edu.cn/computernetworks/



Attention

!

The materials below are available for use by others.

Instructors are welcome to use them in their own

courses, download them to their own class' web site,

or modify them to suit. However, you mustacknowledge the source of the original and not

attempt to place your own copyright on this

material.

! Thanks to：

http://authors.phptr.com/tanenbaumcn4/

3/31/15 [email protected]



[email protected] 4

Roadmap

Introduction

Medium Access Sublayer

Network Layer

Transport Layer

Application Layer

Data Link Layer

Physical Layer

3/31/15



The Data Link Layer

Chapter 3



Ch-3 The Data Link Layer

! 3.1 Data Link Layer Design Issues

!

3.2 Error detection and correction

! 3.3 Elementary data link protocols

!

3.4 Sliding window protocols

! 3.5 Example Data Link Protocols




What Is Data Link

! Communication channels that connect adjacentnodes along communication path are links

! By adjacent, we mean that the two machines are

connected by a communication channel that actsconceptually like a wire.

! Data-link layer deals with algorithms forachieving reliable, efficient communication of

whole units of information called frames betweentwo adjacent machines.




Properties and Limitations for a link

! Essential Property:

! The bits are delivered in exactly the same order inwhich they are sent.

!

Limitations

!

Communication circuits make errors occasionally

!

They have only a finite data rate, and

! There is a nonzero propagation delay betweenthe time bit sent and the time it is received




3.1 DLL Design Issues

! Functions of the Data Link Layer ! Providing a well-defined service interface

to the network layer! Dealing with transmission errors

! Regulating data flow

• Slow receivers not swamped by fastsenders

3/31/15 [email protected] 9



Frame

Relationship between packets and frames.

!

DLL takes the packets it gets from the network layer

and encapsulates them into frames for transmission




Reliability is an overall goal

! The goal is achieved when all the layers work together.

! Many of the principles we will study in the data

link layer, such as error control and flow control,

are found in transport and other protocols as well.

! In fact, in many networks, these functions are found mostly in the upper layers, with the data

link layer doing the minimal job that is “good

enough”.3/31/15

[email protected] 11



Services Provided to the Network Layer

(a) Virtual communication.

(b) Actual communication.




Types of Common Services

! Unacknowledged connectionless service.! used on low bit error link. ( Ethernet or real-time traffic )

! Acknowledged connectionless service.! Used on high error rates link (Wireless)

! Acknowledged connection-oriented service.! guarantee that each frame sent is indeed received and

is received exactly once and that all frames arereceived in the right order..

!

provides the network layer processes with theequivalent of a reliable bit stream

! Used on long, unreliable links.(satellite channel)3/31/15

[email protected]



Is Acknowledgement a Must ?

! Providing acknowledgements in the data link

layer is just an optimization, never a

requirement.

! Recovery is left to higher layers in many

cases.

!

E.g.: The network layer can always send a packet and

wait for it to be acknowledged. If the ack is not forthcoming before the timer expires, the sender can

just send the entire message again.




The DLL translates the physical layer's raw bit stream into

discrete units (messages) called frames. How can frame be

transmitted so the receiver can detect frame boundaries? That

is, how can the receiver recognize the start and end of a frame? We will discuss four ways:

•

Byte Count

•

Flag bytes with byte stuffing

•

Flag bits with bit stuffing•

Physical layer coding Violations

Framing




Byte Count

A byte stream. (a) Without errors. (b) With one error.




Flag bytes with byte stuffing

(a) A frame delimited by flag bytes.

(b) Four examples of byte sequences before and after stuffing.




Flag bits with bit stuffing


Bit stuffing bits pattern : 01111110

(a) The original data.

(b) The data as they appear on the line.

The data as they are stored in the receiver’s memory after destuffing.



Physical layer coding Violations

! Send a signal that doesn't conform to any legal bitrepresentation. For example, in the 4B/5B line code 4

data its are mapped to 5 signal bits to ensure sufficient

bit transitions. This means that 16 out of 32 signal

possibilities are not used. We can use some reserved

signals to indicate the start and end of frames.

!

The advantage of encoding violations is that it is easy to

find the start and end of frames and there is no need to

stuff the data.




Combination of framing methods

! Many data link protocols use a combination

of these methods for safety. A common

pattern used for Ethernet and 802.11 is to

have a frame begin with a well-defined

pattern called a preamble. The preamble is

then followed by a length (i.e. count) field in

the header that is used to locate the end ofthe frame.




Error Control

! Must ensure that all frames are eventually

delivered to the network layer at the

destination and in the proper order.

! Three components are required to do this:

Acknowledgments

TimersSequence Numbers




Acknowledgments

!

Reliable delivery is achieved using the"acknowledgments with retransmission"paradigm.

!

The receiver returns a special acknowledgment (ACK)frame to the sender indicating the correct receipt of aframe.

!

In some systems, the receiver also returns a negativeacknowledgment (NACK) for incorrectly-receivedframes.

!

This is only a hint to the sender so that it canretransmit a frame right away without waiting for atimer to expire.




Timers

!

One problem that simple ACK/NACK schemes fail to

address is recovering from a frame that is lost, and

as a result, fails to solicit an ACK or NACK.

! What happens if an ACK or NACK becomes lost?

!

Retransmission timers are used to resend framesthat don't produce an ACK. When sending a frame,

schedule a timer to expire at some time after the

ACK should have been returned. If the timer goesoff, retransmit the frame.




Sequence Numbers

! Retransmissions introduce the possibility of

duplicate frames.

! To suppress duplicates, add sequence

numbers to each frame, so that a receiver

can distinguish between new frames and

repeats of old frames.

! Bits used for sequence numbers depend onthe number of frames that can be outstanding

at any one time. 3/31/15 [email protected]



Flow Control

! Flow control deals with throttling the speed of

the sender to match that of the receiver.

Usually, this is a dynamic process, as the

receiving speed depends on such changingfactors as the load, and availability of buffer

space.

! Feedback-based flow control

!

Rate-based flow control (never used in data link

layer)




3.2 Error Detection and Correction

! Error-Correcting Codes

! Error-Detecting Codes

putting in enough redundancy

along with the data to be able to detect (and correct) data errors.




Errors

• In data communication, line noise is a fact

of life (e.g., signal attenuation, natural

phenomenon such as lightning, and the

telephone worker).• Low error rates: fiber optical

• High error rates: wireless




Error Correcting/Detecting Codes

! Detecting and correcting errors requires

redundancy - sending additional information

along with the data.

! Two basic strategies:

!

Error Correcting Codes: Include enough

redundancy to detect and correct errors.

! Error Detecting Codes(FEC, Forward ErrorCorrection): Include enough redundancy bits to

detect errors and use ACKs and retransmissions

to recover from the errors.3/31/15 [email protected] 28



Modeling errors

! One model is that errors are caused by extreme values of thermal noise that overwhelm the

signal briefly and occasionally, giving rise to

isolated single-bit errors.! Another model is that errors tend to come in

bursts rather than singly. This model follows

from the physical processes that generate them

– such as a deep fade on a wireless channel.

! Both models matter in practice, and they have

different trade-offs.3/31/15 [email protected] 29



Error-Correcting Codes

1. Hamming codes.

2. Binary convolutional codes.

3. Reed-Solomon codes.

4. Low-Density Parity Check codes.


Codeword (n,m): n bits=m bits data + r bits redundant

Code rate: m/n



Hamming Distance

! Given any two codewords, we can determine

how many of the bits differ by Exclusive OR

(XOR) of the two words. The number of 1 bits

in the result is the Hamming Distance.

!

If two codewords are d bits apart, d errors

are required to convert one to the other.3/31/15 [email protected]

1000100110110001

---------------------

00111000



Hamming Distance

!

In general, all 2m possible data words are legal.

However, by choosing check bits carefully, the

resulting codeword will have a large Hamming

Distance. The larger the Hamming distance, thebetter the codes are able to detect errors.

!

To detect d 1-bit errors requires having a Hamming

Distance of at least d + 1 bits.

! To correct d errors requires distance of 2d + 1 bits.Intuitively, after d errors, the garbled messages is

still closer to the original message than any other

legal codeword.3/31/15 [email protected]



Correcting errors

! As an example, consider a 10-bit code used to represent 4 possiblevalues:

"00000 00000", "00000 11111", "11111 00000", and "11111 11111".

Its Hamming distance is 5, and we can correct 2 single-bit errors.

Example: "10111 00010" becomes "11111 00000" by changing onlytwo bits.

However, if the sender transmits "11111 00000" and the receiver

sees "00011 00000", the receiver will not correct the errorproperly.

Finally, in this example we are guaranteed to catch all 2-bit errors,but we might do better: if "00111 00111" contains 4 single-biterrors, we will reconstruct the block correctly.




Hamming code


Example of an (11, 7) Hamming codecorrecting a single-bit error.



Convolutional code


The NASA binary convolutional code used in 802.11.



Error-Detecting Codes

! Linear, systematic block codes

1. Parity.

2. Checksums.

3.

Cyclic Redundancy Checks (CRCs).




Parity Bits

! A single parity bit is appended to each data block (e.g.

each character in ASCII systems) so that the number

of 1 bits always adds up to an even (odd) number.

1000000(1) 1111101(0)

! The Hamming Distance for parity is 2, and it cannot

correct even single-bit errors (but can detect single-biterrors).




Interleaving of parity bits


Interleaving of parity bits to detect a burst error.



Checksum

! Checksum means a group of check bits associated with a message, regardless of how

they are calculated.

! The checksum is usually placed at the end of the message, as the complement of the sum function. So errors may be detected by

summing the entire received codeword, both

data and checksum. If the result comes out to

be zero, no error has been detected.

!

16bit Internet checksum3/31/15 [email protected] 39



Cyclic Redundancy Check

! The most popular error detection code at the link layer is based on polynomial code, also known

as Cyclic Redundancy Check .

! Allows us to acknowledge correctly received frames and to discard incorrect ones.





!

Detects! All single bit errors

! All double-bit errors if C(x) has a factor with at least 3 terms

! Any odd number of errors, if (x+1) divides C(x)

! Any burst error of length < length of FCS

! Most large burst errors

! Three polynomials are in common use they are:! CRC-16 = x16+x15+x2+1 (used in HDLC)

! CRC-CCITT = x16+x12+x5+1

! CRC-32 = x32+x26+x23+ x22+x16+x12+ x11+x10+x8+ x7+x5+x4+

x2+x1+1 (used in Ethernet)




Example calculation of the CRC




A hardware implementation for a 16-bit CRC(Shift Register Sequences)





3.3 Elementary Data Link Protocols

! Utopian Simplex Protocol

! Simplex Stop-and-Wait Protocol

! Error-Free Channel

! Simplex Stop-and-Wait Protocol

! Noisy Channel




Services to Network Layer

!

Data handed to a DLL by a Network Layer on one module, are

handed to the Network Layer on another module by that DLL.

! The remote Network Layer peer should receive the identicalmessage generated by the sender (e.g., if the data link layer adds

control information, the header information must be removed beforethe message is passed to the Network Layer).

!

The Network Layer may want to be sure that all messages it sends,

will be delivered correctly (e.g., none lost, no corruption). Note that

arbitrary errors may result in the loss of both data and control

frames.! The Network Layer may want messages to be delivered to the

remote peer in the exact same order as they are sent.




Implementation of Layers


Implementation of the physical, data link, and network layers.



Key Assumptions

! Physical Layer, data link layer, and network layerare independent processes that communicate bypassing messages back and forth.

! Machine A wants to send a long stream of datato machine B, using a reliable, connection-oriented service.

! A is assumed to have an infinite supply of data

ready to send and never has to wait for data tobe produce.

! Machines do not crash




Protocol Definitions

Some definitions needed in the protocols to follow.

These are located in the file protocol.h.


. . .



Protocol

Definitions

(ctd.)

Some definitions

needed in the

protocols to follow.

These are located in

the file protocol.h.




Utopian Simplex Protocol

! Assumptions:

! Data transmission in one direction only (simplex).

! No errors take place on the physical channel.

!

The sender/receiver can generate/consume an

infinite amount of data.

!

Always ready for sending/receiving.




Utopian Simplex Protocol -1




Utopian Simplex Protocol -2


A Si l S d W i P l



A Simplex Stop and Wait Protocol

for an Error-Free Channel

!

Assumptions:!

No longer assume receiver can process incoming

data infinitely fast.

!

Sender ships one frame and then waits for

acknowledgment (stop and wait.)

!

The contents of the acknowledgment frame are

unimportant.

!

Data transmission is one directional, but must

have bi-directional line. A half-duplex (one

direction at a time) physical channel would suffice.3/31/15 [email protected]



A Simplex Stop and Wait Protocol for

an Error-Free Channel -1


A simplex stop-and-wait protocol.



A Simplex Stop and Wait Protocol for

an Error-Free Channel -2


Si l St d W it P t l



Simplex Stop-and-Wait Protocol

for a Noisy Channel

!

Assumptions:! The channel is noisy and we can lose

frames (they never arrive).

! Simple approach:!

add a timer to the sender so if no ACK aftera certain period, it retransmits the frame.




Particular Scenario

! Scenario of a bug that could happen if we’re not careful:

! A transmits frame one

!

B receives A1

! B generates ACK

! ACK is lost

!

A times out, retransmits

! B gets duplicate copy of A1 (and sends it on to network layer.)

(another duplicate copy is caused by long delay)




Sequence number

! Use a sequence number:

! Have the sender put sequence number in the header

of each frame it sends. Then the receiver can check

the sequence number of each arriving frame to see ifit is new frame or a duplicate to be discarded.

! The minimum number of bits needed for SEQ

! The only ambiguity in this protocol is between a

frame, m, and its direct successor, m+1.! 1-bit is sufficient for this simple case because only

concerned about two successive frames.




ARQ

! Positive Acknowledgment with Retransmission (PAR)/ Automatic Repeat reQuest (ARQ):

! Sender waits for positive acknowledgment before

advancing to the next data item.


Simplex Stop and Wait Protocol




for a Noisy Channel -1

A positive acknowledgement with retransmission protocol.

Continued"


Simplex Stop and Wait Protocol






. . .

S S





A positive acknowledgement with retransmission protocol.




Efficiency Problem

!

Problem with stop and wait protocols is that sender can onlyhave one unACKed frame outstanding.

Example: Long Fat Network

Short frame length: 1000 bit frames

High bandwidth: 1 Mbps channel (satellite)Long transit time: 270 ms propagation delay

!

Frame takes 1msec ( 1000 bits/(1,000,000 bits/sec) = 0.001 sec= 1 msec ) to send. With propagation delay the ACK is not seenat the sender again until time 541msec. Very poor channelutilization.

! We can use larger frames, but the maximum size is limited by the

bit error rate of the channel. The larger the frame, the higher theprobability that it will become damaged during transmission.




Performance evaluation

!

Performance evaluation! F = frame size (bits)

!

C = channel capacity (Bandwidth in bits/second)

! I = propagation delay plus processor service time (second)

Time to transmit a single frame= F/C

Total Delay= 2I

In Stop and wait the line is busy for F/C and idle for 2I, giving

line utilization=F/(F+2CI) < 50% if F<2CI

a network is considered an LFN if its bandwidth-delay product is significantly larger than 105 bits (~12 kB).




3.4 Sliding Window Protocols

!

Assumptions:!

Use more realistic two-way communication

!

Use a separate link for data in both directions

#

the reverse channel has the same capacity as the forward channeland is almost entirely wasted.

! Interleave two kinds of frames on the same link(containing a "kind" field):# Data frame

#

Control frame:#

ACK ( containing sequence number of last correctly receivedframe).




Piggybacking

!

Piggybacking !

The technique of temporarily delaying outgoingacks so that they can be hooked onto the next

outgoing data frame.! The principal advantage :

! a better use of the available channel bandwidth.

!

Piggybacking issue:!

For better use of bandwidth, how long should wewait for outgoing data frame before sending the ACK on its own.




Sliding Window Protocols

!

3 bidirectional protocols

! A One-Bit Sliding Window Protocol

! A Protocol Using Go Back N

! A Protocol Using Selective Repeat

!

Differ in terms of

! efficiency, complexity, and buffer

requirements




Sending/Receiving Window

!

The sender maintains a set of sequencenumbers corresponding to frames it ispermitted to send. These frames are said to fallwithin the sending window.

! Similarly, the receiver also maintains areceiving window corresponding to the set offrames it is permitted to accept.

! The two windows need not have the same lower

and upper limits or even have the same size. And need not have the fixed size, they can growor shrink over the course of time as frames aresent and received.




Example of a sliding window protocol

!

For stop-and-wait sliding windowprotocol,! MaxSeq = 2n – 1, n>=1

! Window size = 1.

! Protocol works, all frames delivered incorrect order.! Easy to implement

! Requires little buffer space.

! Poor line utilization due to stop-and-wait. (Tobe solved in next example.)




An Example of size 1

A sliding window of size 1, with a 3-bit sequence number.

(a) Initially.(b) After the first frame has been sent.

(c) After the first frame has been received.

(d) After the first acknowledgement has been received.


The sequence numbers within the sender's window represent frames that havebeen sent or can be sent but are as yet not acknowledged.



Sender’s Window

! Since frames currently within the sender’s

window may be lost or damaged in transit,

the sender must keep all those frames in its

memory for possible retransmission.! If the max window size is n, the sender needs

n buffers (at least) to hold the unacked

frames. If the window ever grows to its maxsize, the sending DLL must shut off the

network layer until another buffer free.




Receiver’s window

!

The receiver’s window corresponds to theframes it may accept. Any frame fallingoutside the window is discarded.

! When a frame whose seq num is equal to thelower edge of the window is received, it ispassed to the network layer, an ack isgenerated and the window is rotated by one.

! Note that a receiver’s window size of 1means that the DLL only accepts frames inorder, but for larger windows this is not so.


A One-Bit Sliding Window



A One Bit Sliding Window

Protocol

Continued"






Protocol (ctd.)




A peculiar situation

Two scenarios for protocol 4. (a) Normal case. (b) Abnormal case. The notation is (seq, ack, packet number ). Anasterisk indicates where a network layer accepts a packet.




Pipelining Strategies

! Allow multiple frames to be in transmission

simultaneously.

!

Sender does not wait for each frame to be

ACK'ed. Rather it sends many frames with the assumption that they will arrive. Must still get

back ACKs for each frame.

!

Provides more efficient use of transmit bandwidth,

but error handling is more complex.




Problem and Solution

! What if 20 frames transmitted, and the 2nd

has an error.

!

Frames 3-20 will be ignored at receiver side?

Sender will have to retransmit.!

What are the possibilities?

! Two strategies for receive Window size:

! Go back n

!

Selective repeat


A P t l U i G B k N



A Protocol Using Go Back NGo back n - equivalent to receiver's window size of one.If receiver sees bad frames or missing sequence numbers,

subsequent frames are discarded.No ACKs for discarded frames.


Pipelining and error recovery. Effect on an error when(a)Receiver’s window size is 1.

S l ti R t



Selective Repeat

Selective repeat - receiver's window size larger than one.Store all received frames after the bad one.ACK only last one received in sequence.


Pipelining and error recovery. Effect on an error when(b) Receiver’s window size is large.



! These two alternative approaches are tradeoffbetween bandwidth and data link layer bufferspace on the receiver side.

! In either case will need buffer space on the sender

side. Cannot release until an ACK is received.!

Use a timer for each unACK'ed frame that has beensent.

!

Must be able to enable/disable network layer because

may not be able to handle more send data if there aremany unACK’d frames

Bandwidth & buffer space




MAX Seq No. vs. Window Size

! MaxSeq is 7 (Valid Seq No. 0~7) . How big can

window size be?

consider the following scenario:

!

The sender sends frames 0 through 7. !

A piggybacked acknowledgement for frame 7

eventually comes back to the sender.

! The sender sends another eight frames, again with

sequence numbers 0 through 7. ! Now another piggybacked acknowledgement for

frame 7 comes in.




Max Sending Window Size = MAX_SEQ

!

The question is this: Did all eight framesbelonging to the second batch arrive

successfully, or did all eight get lost (counting

discards following an error as lost)?!

In both cases the receiver would be sendingframe 7 as the acknowledgement. The sender

has no way of telling. For this reason the

maximum number of outstanding frames must

be restricted to MAX_SEQ (not MAX_SEQ+1).




Sliding

Window Protocol

Using Go

Back N

Continued"


Sliding Window Protocol Using Go



g g

Back N

Continued"






Back N

Continued"






Back N




timers

Simulation of multiple timers in software.


A Sliding Window Protocol Using Selective Repeat



A Sliding Window Protocol Using Selective Repeat

Continued "


A Sliding Window Protocol Using Selective Repeat (2)



Continued "

g g p ( )





Continued " 3/31/15 [email protected]








Nonsequential receiving problems

(a) Initial situation with a window size 7.

(b) After seven frames sent and received, but not acknowledged.

(acks all lost, sender times out and resend f0, 0 is within the newwindow[7,0,1,2,3,4,5])

(c) Initial situation with a window size of four.

(d) After four frames sent and received, but not acknowledged.


round-ribbon buffer space

window new window



Max Receiving Window Size = (MAX_SEQ + 1)/2

!

Nonsequential receive introduces certainproblems not present in protocols in whichframes are only accepted in order.

! The essence of the problem is that after thereceiver advanced its window, the new rangeof valid sequence numbers overlapped theold one.

! the max window size for selective repreat willbe (MAX_SEQ + 1)/2. Thus, for 3-bitsequence numbers, the window size is 4.




Windows size

Protocol WS: Sending Window WR: Receiving Window

Stop-N-Wait 1 1

Go back n >1 ( <= 2m-1 ) 1

Selective Repeat >1 >1 ( <=2m-1 )


Sequence No. is m bits,

WS >= WR, and WS +WR<=2m



Problem fixed: light reverse traffic

! Ack is piggybacked onto the next outgoingdata frame in Goback n protocol (assume the

channel is heavily loaded)

!

What if the reverse traffic is light:!

After an in-squence data frame arrives, anauxiliary timer is started by start_ack_time. If no

reverse traffic has presented itself before this

timer expires, a separate acknowledgement frameis sent.

! An Interrupt due to the auxiliary timer is called anack_timeout event.


More efficient strategy for



error dealing

! NAK (Negative acknowledgement) frame! Whenever the receiver has reason to suspect that

an error has occurred, it sends a NAK frame back

to the sender. such a frame is a request for

retransmission of the frame specified in the NAK.! A damaged frame arrived

!

A frame other than the expected on arrived( potential

lost frame)

! If the NAK gets lost, no real harm is done, sincethe sender will eventually time out and retransmit

the missing frame anyway.




Timer administration ?

! Sender:

! The time required for a frame to propagate to thedestination, be processed there, and have the

ACK come back is constant, timer is set to be justslightly larger than the normal time interval

expected between sending a frame and receiving

its ACK.

! Reverse traffic is light ?

! Variable processing time?


Performance



Performance

Channel utilization: bits-transmitted/capacity. Now we’ll do it again with a bit more precision.

What is the channel efficiency of a stop-and-wait protocol?

F = frame size = D + H = data bits + header bits

C = channel capacity (bps)I = propagation delay plus processor service time (seconds)

A = ack size (bits)Time between frames: Time to get frame on wire + Propagation

time for frame + Time to get ACK on wire + Propagation time for ACK = F/C + I + A/C + I

Time spent sending data (doing useful stuff): D/C

Efficiency:D/C D D

--------------------- = ------------------------ = ------------------------F/C + 2I + A/C F + 2IC + A D + H + 2IC + A3/31/15 [email protected]



3.5 Example Data Link Protocols

1. Packet over SONET

2.

ADSL (Asymmetric Digital Subscriber Loop)




Packet over SONET

! IP (Internet Protocol)

! PPP(Point to Point Protocol)

! SONET (Synchronous Optical Network)


Packet over SONET. (a) A protocol stack. (b) Frame relationships

PPP Features



PPP Features

! Separate frames, error detection

!

A framing method that unambiguously delineates the end of one

frame and the start of the next one. The frame format also

handles error detection

! LCP (Link Control Protocol)!

A link control protocol for bringing lines up, testing them,negotiating options, and bringing them down again gracefully

when they are no longer needed.

! NCP (Network Control Protocol)

! A way to negotiate network-layer options in a way that

is independent of the network layer protocol to beused.


Compare to HDLC



(High-Level Data Link Control)

! Similar to HDLC, but is byte-oriented.

! PPP doesn’t provide reliable datatransfer by default.

! Reliable data transfer can be requested as anoption (as part of LCP). However it is rarelydone in practice




point-to-point communication

Internet

Backbone

leased lines

! all connections to the outside world go

through one or two routers that have point-to-

point leased lines to distant routers.




PPP frame format


The PPP full frame format for unnumbered mode operation

(connectionless unacknowledged service)



The Protocol field

! Its job is to tell what kind of packet is in the Payload field.

!

Protocols starting with a 0 bit are network layer protocols

such as IP v4, IP v6 or other protocols : IPX, appletalk

! Codes starting with a 1 bit are used for PPPconfiguration protocols, including LCP and a different

NCP for each network layer protocol supported.

!

The default size of the Protocol field is 2 bytes, but it canbe negotiated down to 1 byte using LCP.




State Machine


State diagram for bringing a PPP link up and down



ADSL

! Asymmetric Digital Subscriber Loop


A typical ADSL equipment




configuration.(Ch-2)

NID (Network Interface Device)

DSLAM (Digital Subscriber Line Access Multiplexer )

3/31/15

ADSL P l S k



ADSL Protocol Stacks


ATM Ad t ti L 5



ATM Adaptation Layer 5


AAL5 frame carrying PPP data



What We Have Learned

! Converting raw bit stream into frame stream: charactercount, bit stuffing, character stuffing

!

Error detection and correction: parity, checksum, CRC

!

Flow control: keeping the pace of sender and receiver

!

DLL protocols: sliding window

!

Specification and Verification: correctness, completeness,reachability analysis, failure cases




! End Ch3

Chapter3 DataLink

Documents