Scribd
Upload
74 views

Chapter 3 Computer Networks

The document summarizes the key functions and protocols of the data link layer. It discusses how the data link layer provides error control, flow control, and framing between network layers. It also describes several elementary data link protocols including stop-and-wait, go-back-N, and selective repeat. Sliding window protocols are covered along with specific protocols like HDLC, PPP, and the data link layer in the Internet. Finite state machines and Petri nets are presented as methods for modeling data link protocols.

Uploaded by

Naga Visweswarachari
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
74 views

Chapter 3 Computer Networks

The document summarizes the key functions and protocols of the data link layer. It discusses how the data link layer provides error control, flow control, and framing between network layers. It also describes several elementary data link protocols including stop-and-wait, go-back-N, and selective repeat. Sliding window protocols are covered along with specific protocols like HDLC, PPP, and the data link layer in the Internet. Finite state machines and Petri nets are presented as methods for modeling data link protocols.

Uploaded by

Naga Visweswarachari
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 46

Chapter 3

The Data Link Layer

Data Link Layer Design Issues


Services Provided to the Network Layer Framing Error Control Flow Control

Functions of the Data Link Layer


Provide service interface to the network layer Dealing with transmission errors Regulating data flow
Slow receivers not swamped by fast senders

Functions of the Data Link Layer (2)

Relationship between packets and frames.

Services Provided to Network Layer

(a) Virtual communication. (b) Actual communication.

Services Provided to Network Layer (2)

Placement of the data link protocol.

Framing

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

Framing (2)

(a) A frame delimited by flag bytes. (b) Four examples of byte sequences before and after stuffing.

Framing (3)

Bit stuffing (a) The original data. (b) The data as they appear on the line. (c) The data as they are stored in receivers memory after destuffing.

Error Detection and Correction


Error-Correcting Codes Error-Detecting Codes

Error-Correcting Codes

Use of a Hamming code to correct burst errors.

Error-Detecting Codes

Calculation of the polynomial code checksum.

Elementary Data Link Protocols


An Unrestricted Simplex Protocol A Simplex Stop-and-Wait Protocol A Simplex Protocol for a Noisy Channel

Protocol Definitions

Continued

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.

Unrestricted Simplex Protocol

Simplex Stop-andWait Protocol

A Simplex Protocol for a Noisy Channel

A positive acknowledgement with retransmission protocol.


Continued

A Simplex Protocol for a Noisy Channel (ctd.)

A positive acknowledgement with retransmission protocol.

Sliding Window Protocols


A One-Bit Sliding Window Protocol A Protocol Using Go Back N A Protocol Using Selective Repeat

Sliding Window Protocols (2)

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.

A One-Bit Sliding Window Protocol

Continued

A One-Bit Sliding Window Protocol (ctd.)

A One-Bit Sliding Window Protocol (2)

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

A Protocol Using Go Back N

Pipelining and error recovery. Effect on an error when (a) Receivers window size is 1. (b) Receivers window size is large.

Sliding Window Protocol Using Go Back N

Continued

Sliding Window Protocol Using Go Back N

Continued

Sliding Window Protocol Using Go Back N

Continued

Sliding Window Protocol Using Go Back N

Sliding Window Protocol Using Go Back N (2)

Simulation of multiple timers in software.

A Sliding Window Protocol Using Selective Repeat

Continued

A Sliding Window Protocol Using Selective Repeat (2)

Continued

A Sliding Window Protocol Using Selective Repeat (3)

Continued

A Sliding Window Protocol Using Selective Repeat (4)

A Sliding Window Protocol Using Selective Repeat (5)

(a) Initial situation with a window size seven. (b) After seven frames sent and received, but not acknowledged. (c) Initial situation with a window size of four. (d) After four frames sent and received, but not acknowledged.

Protocol Verification
Finite State Machined Models Petri Net Models

Finite State Machined Models

(a) State diagram for protocol 3. (b) Transmissions.

Petri Net Models

A Petri net with two places and two transitions.

Petri Net Models (2)

A Petri net model for protocol 3.

Example Data Link Protocols


HDLC High-Level Data Link Control The Data Link Layer in the Internet

High-Level Data Link Control

Frame format for bit-oriented protocols.

High-Level Data Link Control (2)

Control field of (a) An information frame. (b) A supervisory frame. (c) An unnumbered frame.

The Data Link Layer in the Internet

A home personal computer acting as an internet host.

PPP Point to Point Protocol

The PPP full frame format for unnumbered mode operation.

PPP Point to Point Protocol (2)

A simplified phase diagram for bring a line up and down.

PPP Point to Point Protocol (3)

The LCP frame types.

You might also like