Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione. Link Layer. Fundamentals of Communication Networks
|
|
- Brook Marsh
- 5 years ago
- Views:
Transcription
1 Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione Link Layer Fundamentals of Communication Networks
2 Data Link layer o It is the first logical layer in the protocol stack o Functions n Framing: Identification of the group of bits exchanged with the physical layer n Detect and correct errors (optional) n Multiplexing (optional) n Multiple access (optional)
3 Framing o The bits exchanged through the SAP with the physical layer are grouped and need to be identified bit Layer 2 1-SAP frame 1 frame 2 Layer 1 o The groups of bits define a data structure name frame (PDU-2)
4 Framing o It is necessary to identify boundaries between frames bit Layer 2 Layer 1 1-SAP frame 1 frame 2 o There are two possibilities n Frame delimiters (special sequences of bits) n Signaling information passed by the physical layer
5 Bit oriented protocols o These protocols use flags (special sequences of bits) for delimiting frames and aligning receiver o Example: HDLC n Flag sequence of start and end n Problem: how to prevent that the sequence is present into the data part of the frame Solution: Bit stuffing: insert a 0 after five consecutive 1s
6 Bit Stuffing Data Bit stuffing frame flag flag reception Start flag identification Deletion of bits added End flag identification
7 Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione Error detection and retransmission
8 Error control and recovery o Physical layer typically have error control mechanisms for ensuring reliability o These are based on FEC (Forward Error Correction) and allow to fully exploit channel capacity o Physical layer leave to data link layer a residual error (not corrected) that depends on the specific technology and may range from 10-2 to 10-9 o Since for most data applications this residual probability is not sufficient (think e.g. on your home banking application J ) o At data link layer a mechanism for error detection and retransmission of wrong frames is adopted (ARQ: Automatic Retransmission request)
9 Error detection No: error Yes: correct header payload FCS =? FCS Add error check sequence Check parity bits header payload FCS header payload FCS TX channel RX
10 Error recovery: ingredients o Correctly received frames are acknowledged to the transmitter with a message sent by the receiver (ACK) o In same case an incorrect frame can also be notified back with NACK (Not ACK) message o The lack of ACK or the reception of a NACK signals the need to retransmit a frame o Procedures repeats until the frame is correctly received o The transmission of service messages (ACK, NACK) requires a feedback communication channel o Note that also service messages can have errors when received
11 Error recovery o Error recovery procedures can be implemented in any layer o Historically they are considered part of the data link layer since most of the physical channel were unreliable o Now with some media (like e.g. fibers) they are not strictly necessary, while with others (like e.g. radio) they are still largely adopted o Due to the need of offering reliable services to applications, they are also implemented at transport layer (layer 4) as end-to-end procedures (like e.g. in TCP)
12 Number of retransmissions Let us consider a link with bit error rate equal to p Frames have a length of L bits ACK messages are error free o The correct reception probability is c = (1-p)L p << 1 c 1 Lp o The average number of retransmissions is i=1 r = i c(1 c) i = 1 c 1
13 Total number of retransmissions on multiple links Let us consider a path in the network with H links o The average number of retransmissions on the whole path is r (l) " = H 1 H $ # c 1 % ' &
14 Total number of retransmissions on multiple links o The probability of correct reception on the end-to-end connection is: C = c H = (1 p) LH o The average number of retransmissions is: r H (e) = H " $ # 1 C 1 % " ' = H 1 & c 1 % " $ ' = H r (l) H $ # H & # H +1 % ' & H H o o with H large with r H small r H (e) He r H (l ) H He r H (l ) r H (e) Hr H (l)
15 Example o Comparison between single link and multiple links with L= bits and H = Average num. of retransmissions end-to-end link E-09 1.E-08 1.E-07 1.E-06 1.E-05 1.E-04 1.E-03 Bit Error rate
16 ARQ protocols o ARQ protocols define the rule for retransmissions between entities of the same layer o In addition to error recovery they provide in sequence delivery to upper layer without packet duplications o They use signaling messages: n ACK (acknowledgement) n NACK (not acknowledgement) o Three main classes: n Stop & Wait n Go-Back-N n Selective Repeat
17 Stop and Wait o It is based on ACK messages only o Retransmissions are regulated by a timer (time out) o Each correctly received message is acknowledged with an ACK
18 Stop and Wait o Transmitter sends one packet (frame) at a time and initializes the time-out counter o If first event occurring is: n n ACK reception, a new packet is transmitted Time-out expiration, packet is retransmitted 1 2τ+Τ ack time-out tx ACK ACK rx Correct operation if time-out >= 2τ+Τ ack
19 Stop and Wait o If ACK is lost (due to error on the channel or any other reason), the packet is retransmitted and packet may be duplicated at receiver o For this reason frame are numbered with a sequence number (SN) so that duplicated frames can be discarded tx ACK ACK ACK rx
20 Stop and Wait time-out ACK ACK ACK 1 3 o Delays in ACK reception may lead to wrong interpretation of ACKs received o For this reason also ACK are numbered Receiver Number (RN) o In this case a binary numbering is sufficient (0,1)
21 Stop and Wait o Protocol efficiency: n Fraction of time channel is used for successful transmissions η = T + T τ T ack τ data T T ack + 2τ data T = transmission duration τ= propagation delay data tx ACK ACK ACK rx
22 Stop and Wait η = T T + T ack + = 2τ 1+ 1 Tack T + 2τ T o Low efficiency if T<<τ o Protocol not suitable for scenarios with high delay and/or high transmission rate o It can be used in half-duplex mode
23 Stop and Wait (with errors) o Assumptions n n n n n n Error process on bits purely random (no correlation) p: bit error probability T f : frame transmission time T a : ACK transmission time T o : retransmission time-out τ: propagation delay T f T o 1 1 ACK τ T a
24 Stop and Wait (with errors) o For each wrong packet, the time wasted is: T + f T o T f T o 1 1 ACK τ T a
25 Stop and Wait (with errors) o Success probability: o Average number of transmissions (including first one) : o Efficiency: P P P i P P P P P N i i s 1 ) (1... ) (1 3 ) ( = = = = = L f L a p P + = ) (1 τ η 2 ) 1)( ( = a f o f s f T T T T N T
26 Stop and Wait (with errors) o In the best case (T a =0, T o =2τ): η max = N s T ( T f f = + 2τ ) Tf P P = T τ f + 2τ 2 1+ T f η max P = 0.5 P = 0.7 P = 0.5 P =1 2τ T f
27 Stop and Wait: examples o IEEE (WiFi) n Distance up to 250 m n Packet size bits n Rate Mb/s o USB n distance + hub 30 m n rate max 480 Mb/s n Packet size bit o IEEE 1394 (Firewire) versions a and b n Distance 4.5 m n Rate max Mb/s n Packet size bit (at 400 Mb/s) bit (at 1600 Mb/s)
28 Go-back-N o Transmitter can send up to N packets before receiving ACK o Stop-and-wait is a special case with N=1 Window N tx rx
29 Go-back-N o If an ACK arrives before the end of transmission of the N packets, the window of N packets is shifted by one position on the right Window (1,7) (1,7) (1,7) (1,7) (1,7) (2,8) (3,9) (4,10) tx ACK 1 ACK 2 ACK 3 In this example with no error, transmission never stops and efficiency is 100% rx
30 Go-back-N o otherwise: transmitter starts retransmitting from the last non-acknowledged packet ( go back of N packets ) o Retransmission can be delayed by a time out (time out can be just equal to the transmission time of the window or larger) window (1,7) (1,7) (1,7) (1,7) (1,7) (1,7) (1,7) tx rx
31 Go-back-N o Some packets that were correctly received may be retransmitted anyway o But the retransmission of the entire window allows receiver to keep only frames received in sequence Window (1,7) (1,7) (1,7) (1,7) (1,7) (1,7) (1,7) tx rx Out of sequence packets can be discarded
32 Go-back-N: collective ACK o Since packets are delivered in sequence, ACK message can be collective (all packets up to k received correctly) Window (1,7) (1,7) (1,7) (1,7) (1,7) (1,7) (1,7) (4,10) tx ACK 3 rx
33 Window size: continuous transmission o Retransmission can be triggered by a too short dimensioning of the window Finestra (1,3) (1,3) (1,3) (1,3) (1,3) (2,4) (3,5) (4,6) 4 5 (4,6) 6 tx This reduces efficiency ACK 1 ACK 2 ACK 3 rx
34 Window size: with time-out o At the end of the window transmission is suspended until a time out expires (example: TCP) Window (1,3) (1,3) (1,3) (2,4) (3,5) (4,6) tx ACK 1 ACK 2 ACK 3 rx Also in this case efficiency reduces
35 Window size T + Tack + 2τ N = T (1,5) (1,5) (1,5) (1,5) (1,5) (2,6) (3,7) (4,8) T τ τ ACK 1 ACK 2 ACK 3 T ack 8 tx rx
36 Window size o Window can be dimensioned in time, bytes, packets, o Dimensioning gets complicated when propagation times are unknown: n example with go-back-n at Layer 4 (TCP), network crossing delay (τ) can vary with time
37 Window size o Window sufficiently big o With no error, efficiency is high o In case of error, error detection delay and number of retransmitted frames depend on the window size n It is also possible to use NACK messages
38 Use of NAK o The use of NAK can shorten retransmission delay in case of error, avoiding to wait until the end of the transmission window or timeout expiration o It is not possible to send NAK immediately after the reception of a wrong packet because receiver cannot decode the sequence number SN o Typically NAK is sent after the reception of an out-of-sequence packet/frame, assuming previous packet/frame is lost o It cannot be used in retransmission protocols at upper layer (like e.g. TCP) because outof-sequence may be due to other reasons
39 Window Use of NACK (1,9) (1,9) (1,9) (1,9) (2,10) (2,10) (2,10) (2,10) tx ACK 1 NACK 2 rx
40 Go-back-N full-duplex Data packets/frames ACK Bidirectional channel receiver ACK receiver Data packets/frames - Analyzes received frames - Forwards correct frames to upper layer - generates ACKs
41 Go-back-N & piggy backing o ACKs can be included in the header of packets/frames sent in the opposite direction SN RN Information o SN: Sequence number of the packet/ frame sent o RN: Number of frame waited in the opposite direction (cumulative ACK indicating that all packets up to RN-1 have been correctly received)
42 Go-back-N rules o Transmitter: n N last : last ACK received n Nc: Current sequence number available for next transmission n Rules: o A frame is accepted for transmission only if Nc < N last + N, otherwise it is queued; if Nc < N last + N the frame is transmitted with SN = Nc and Nc is increased (Nc := Nc+1); o At each RN received, N last = RN; o Packets of the window are transmitted without timing constraints; o if time out expires (or window ends in case of continuous mode), retransmission starts from frame with SN=N last.
43 Go-back-N rules o Receiver: n Rules o If a frame with SN=RN is correctly received, it is forwarded to upper layer and RN:=RN +1; o When frames are transmitted in the opposite direction, the current values of RN is included n The interval N last and (N last + N-1) is the transmission window
44 Go-back-N full duplex w/o error Window (0,5) (1,6) (3,8) (4,9) Received packets Transmitted packets SN=0 RN=0 SN=1 RN=0 SN=2 RN=0 SN=3 RN=0 SN=4 RN=0 SN=5 RN=1 SN=6 RN=1 SN=7 RN=2 SN=8 RN=3 A B Transmitted packets SN=0 RN=1 SN=1 RN=3 SN=2 RN=4 Received packets Finestra (0,5) (1,6) (2,7) 44
45 Go-back-N full duplex with error (0,4) (1,5) (2,6) A SN=0 RN=0 SN=1 RN=0 SN=2 RN=0 SN=3 RN=1 SN=4 RN=2 SN=5 RN=3 SN=6 RN=4 SN=2 RN=5 SN=3 RN=6 SN=4 RN=7 SN=5 RN=8 SN=6 RN=9... Out of sequence B SN=0 RN=0 SN=1 RN=0 SN=2 RN=1 SN=3 RN=2 SN=4 RN=2 SN=5 RN=2 SN=6 RN=2 SN=7 RN=2 SN=8 RN=2 SN=9 RN=3 SN=10 RN= (0,4) (1,5) (2,6) (3,7) (4,8) (5,9) (6,10) 5
46 Go-back-N full duplex with error (0,4) (3,7) (4,8) (5,9) A SN=0 RN=0 SN=1 RN=0 SN=2 RN=0 SN=3 RN=0 SN=4 RN=1 SN=0 RN=1 SN=1 RN=1 SN=3 RN=1 SN=4 RN=1 SN=5 RN=1 Out of sequence B SN=0 RN=0 SN=1 RN=1 SN=2 RN=2 SN=3 RN=3 SN=4 RN=4 SN=5 RN=5 SN=1 RN=5 SN=2 RN= (0,4) (1,5)
47 Go-back-N full duplex (short window) (0,3) (2,5) (4,7) A SN=0 RN=0 SN=1 RN=0 SN=2 RN=0 SN=3 RN=0 SN=0 RN=0 SN=1 RN=0 SN=2 RN=1 SN=3 RN=1 SN=4 RN=2 B SN=0 RN=2 SN=1 RN=4 SN=2 RN=4 SN=3 RN= (0,3) (1,4)
48 Go-back-N with ACKs (0,4) (1,5) (2,6) (3,7) (4,8) (5,9) (6,10) A SN=0 RN=0 SN=1 RN=0 SN=2 RN=0 SN=3 RN=0 SN=4 RN=0 SN=5 RN=0 SN=6 RN=1 SN=7 RN=1 SN=8 RN=2 B RN=1 RN=2 SN=0 RN=2 RN=3 SN=1 RN=4 SN=2 RN=5 SN=3 RN=6 RN=7 RN= (0,4) (1,5) (2,6) (3,7)
49 Go-back-N with NAK (0,6) (1,7) (2,8) A SN=0 RN=0 SN=1 RN=0 SN=2 RN=0 SN=3 RN=0 SN=4 RN=0 SN=0 RN=0 SN=1 RN=0 SN=2 RN=0 SN=3 RN=1 SN=4 RN=2 RN=3 B NAK RN=0 SN=0 RN=0 SN=1 RN=0 SN=2 RN=1 RN=2 RN=3 RN= (0,6)
50 Module of the SN-RN counter o The number of bits b of the sequence numbers SN and RN must be large enough so that the module of these counters M (0,1,,M-1), with M=2 b is always larger than the window o Otherwise in case of error an entire window may be lost due to the use of cumulative ACKs
51 Efficiency of Go-Back-N (w/o error) o If window is well dimensioned: WT f > T f +T a + 2τ η = 1 o Otherwise: WT f < T f +T a + 2τ η = WT f T f +T a + 2τ
52 Efficiency of Go-Back-N (with error) o Assumptions: n Independent errors n P: error probability on a frame n T f : frame transmission time n T a : ACK time n τ: propagation delay o Number of successfully transmitted frames: N s = 1 p o Number of consecutive errors: N e = 1 1 p
53 Efficiency of Go-Back-N (with error) o Efficiency is then: η = T f p T f p + T f +T a + 2τ 1 p = T f (1 p) T f + (T a + 2τ )p
54 Go back N examples o HDLC n Link Layer protocol of the ISO stack (I970) o TCP (Transport Control protocol) - Tahoe n Transport protocol of the Internet (used before TCP Reno)
55 Selective Repeat o Go Back N forces retransmission also of packets correctly received o This may be inefficient with many errors o As alternative, Selective Repeat (SR) retransmits wrong packets only using: n Packet reordering n ACK information per packet
56 Selective Repeat: Window o Also in this case, the protocol uses a window of N packets that can be transmitted o Window shifts when ACKs are received (like with GO- BACK-N) Window (1-5) o o Window extends until the first packet without an ACK (like with GO-BACK-N) At the end of the window only packets without ACK are retransmitted Window (3-7)
57 Selective Repeat: Window o Note that window does not contain a fixed number of packets during retransmissions Window (3-7) Window (3-7) 3 7 Window (3-7) 3 Window (8-12)
58 Selective Repeat: Reordering o For reordering packets in the window a buffer must be maintained n Buffer must contain a position for each packet of the window n Only packet sequences in order are delivered to upper layer n Buffer positions are realigned to window every this it shifts due to new ACKs received
59 Selective Repeat: Reordering buffer window To upper layer buffer pool New window
60 Selective Repeat: ACK o ACK can be transmitted with options: n Individual ACK messages n Cumulative ACKs (RN is first packet of the window to be received) and in addition a bitmap of packets to be received in the window RN= n Signaling information necessary is larger than with Go-back-N
61 Selective Repeat: Efficiency o Without error, efficiency is 1 like with Go- Back-N o With error, selective repeat retransmits only wrong packets, so efficiency can be calculated dividing the efficiency without error by the average number of retransmissions per packet η = 1 N s 1 N s = P
62 Selective Repeat examples o HDLC n ISO data link protocol (I970) in the SR mode o TCP (Transport Control protocol) Reno n Transport protocol of the Internet (version adopted after TCP Tahoe)
63 Error control: session set-up o For all error control protocols with retransmission it is necessary to setup a session n It is required to initialize SN and RN counters n Initialization guarantees no ambiguity in numbering packets/frames
64 Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione Link set-up protocols
65 Link set-up o They requires exchange of messages for activating channel and initializing counters SN and RN o Signaling messages must be protected to avoid state inconsistency (active, stand-by) of two end-points in case of error
66 Unbalanced setup and teardown o Only a primary station can initialize procedure o Messages can be retransmitted in case ACK is missing DOWN SET-UP UP TEAR-DOWN DOWN A INIT DISC B ACK-I ACK-D DOWN UP DOWN
67 Three way handshake o Like in previous case, but both end-points can initialize the connection o This requires ACK messages from both sides DOWN SET-UP UP TEAR-DOWN DOWN A INIT ACK-I DISC ACK-D B INIT ACK-I DISC ACK-D DOWN SET-UP UP TEAR-DOWN DOWN
68 Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione Flow control
69 Flow control o Objective: n Regulate transmission rate of packets so as it is adapted to the receiver processing rate o Usually implemented at n Data link layer (2) n Transport layer (4)
70 Flow control source destination o Buffer limited to W positions o Arbitrary user reception rate user Upper layer o Objective: avoiding packets are lost because buffer is full
71 Sliding window flow control o It s similar to the window mechanism of the go back n o Source cannot send more than W packets/frames without acknowledgment o ACKs are send by receiver only when packets are absorbed by user (forwarded to upper layer)
72 Sliding window
73 Sliding window ACK of bytes 1, 2 and 3
74 Sliding window flow control source SN=0 SN=1 SN=2 SN=3 SN=4 SN=5 SN=6 SN=7 destination RN=4 RN=2 RN=1 buffer user 0 1 2,3
75 Retransmission and flow control o This mechanism is strictly linked with the error control since ACKs are delayed until packets are absorbed by users o If ACKs are too delayed, retransmissions can be triggered due to end of window or time out expiration o Increasing time-out is obviously not a solution since this will increase delay in case of error
76 Retransmission and flow control time-out source SN=0 SN=1 SN=2 SN=3 SN=4 SN=5 SN=2 SN=3 SN=4 SN=6 destination RN=6 RN=2 RN=1 buffer user 0 1 2,3,4,5
77 Use of RNR o A possible solution n ACKs are transmitted when packets are correctly received n A special message RNR (Receiver Not Ready) is used to inform that buffer is full o Hybrid approach: n Delay ACKs up to a maximum time and then use RNR when necessary
78 Use of RNR source SN=0 SN=1 SN=2 SN=3 SN=4 SN=5 SN=6 SN=7 SN=8 SN=6 destination RN=6 RNR RN=5 RN=4 RN=3 RN=2 RN=1 buffer user 0 1 2,3,4,5
79 Use of W field o The problem can be radically solved separating error control and flow control o This is done including explicitly the value of the available number of buffer positions in the header of the packets/frames transmitted in the opposite direction with a dedicated W field o The receiver then: n Sends ACKs when packets are received n Include in the window field W the available positions in the buffer o This is the approach used by TCP
80 Use of W field source SN=0 SN=1 SN=2 SN=3 SN=4 SN=5 SN=6 destination buffer AN=1 W=3 AN=2 W=3 AN=3 W=3 AN=4 W=2 AN=5 W=1 AN=6 W=0 AN=6 W= user 0 1 2,3,4,5
81 Flow control- Rate Based approaches n o Flow control with leaky bucket P s Pacchetti W 1 P b Permessi o Flow control con token bucket n P s Packets ν P b 1 W Permessi ν
82 Flow control Rate Based P T T L o Example s ON = 1 Mbit / s P b = 4 Mbit = 0,8 s 1/ ν = 0,4 s OFF p = 1 s W = 10 = 25,000 byte / s C [Mbit/s] C [Mbit/s] t [s] o Leaky bucket t [s] C [Mbit/s] o Token bucket t [s]
83 Readings o Tanenbaum book: Chapter 3 o Study example Link protocols: HDLC and PPP
Data Link Control Protocols
Protocols : Introduction to Data Communications Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 23 May 2012 Y12S1L07, Steve/Courses/2012/s1/its323/lectures/datalink.tex,
More informationChapter 3. The Data Link Layer. Wesam A. Hatamleh
Chapter 3 The Data Link Layer The Data Link Layer Data Link Layer Design Issues Error Detection and Correction Elementary Data Link Protocols Sliding Window Protocols Example Data Link Protocols The Data
More informationChapter 3. The Data Link Layer
Chapter 3 The Data Link Layer 1 Data Link Layer Algorithms for achieving reliable, efficient communication between two adjacent machines. Adjacent means two machines are physically connected by a communication
More informationData Link Control Protocols
Data Link Control Protocols need layer of logic above Physical to manage exchange of data over a link frame synchronization flow control error control addressing control and data link management Flow Control
More informationI. INTRODUCTION. each station (i.e., computer, telephone, etc.) directly connected to all other stations
I. INTRODUCTION (a) Network Topologies (i) point-to-point communication each station (i.e., computer, telephone, etc.) directly connected to all other stations (ii) switched networks (1) circuit switched
More informationFlow control: Ensuring the source sending frames does not overflow the receiver
Layer 2 Technologies Layer 2: final level of encapsulation of data before transmission over a physical link responsible for reliable transfer of frames between hosts, hop by hop, i.e. on a per link basis
More information3. Data Link Layer 3-2
3. Data Link Layer 3.1 Transmission Errors 3.2 Error Detecting and Error Correcting Codes 3.3 Bit Stuffing 3.4 Acknowledgments and Sequence Numbers 3.5 Flow Control 3.6 Examples: HDLC, PPP 3. Data Link
More information16.682: Communication Systems Engineering. Lecture 17. ARQ Protocols
16.682: Communication Systems Engineering Lecture 17 ARQ Protocols Eytan Modiano Automatic repeat request (ARQ) Break large files into packets FILE PKT H PKT H PKT H Check received packets for errors Use
More informationTransport Protocols & TCP TCP
Transport Protocols & TCP CSE 3213 Fall 2007 13 November 2007 1 TCP Services Flow control Connection establishment and termination Congestion control 2 1 TCP Services Transmission Control Protocol (RFC
More informationAdvanced Computer Networks. Rab Nawaz Jadoon DCS. Assistant Professor COMSATS University, Lahore Pakistan. Department of Computer Science
Advanced Computer Networks Rab Nawaz Jadoon Department of Computer Science DCS COMSATS Institute of Information Technology Assistant Professor COMSATS University, Lahore Pakistan Advanced Computer Networks
More informationTransport Protocols and TCP: Review
Transport Protocols and TCP: Review CSE 6590 Fall 2010 Department of Computer Science & Engineering York University 1 19 September 2010 1 Connection Establishment and Termination 2 2 1 Connection Establishment
More informationChapter 24. Transport-Layer Protocols
Chapter 24. Transport-Layer Protocols 23.1 Introduction 23.2 User Datagram Protocol 23.3 Transmission Control Protocol 23.4 SCTP Computer Networks 24-1 Position of Transport-Layer Protocols UDP is an unreliable
More informationChapter 7: Data Link Control. CS420/520 Axel Krings Page 1
Chapter 7: Data Link Control CS420/520 Axel Krings Page 1 Data Link Control Protocols Need layer of logic above Physical to manage exchange of data over a link frame synchronization flow control error
More informationChapter 7: Data Link Control. Data Link Control Protocols
Chapter 7: Data Link Control CS420/520 Axel Krings Page 1 Data Link Control Protocols Need layer of logic above Physical to manage exchange of data over a link frame synchronization flow control error
More information2.1 CHANNEL ALLOCATION 2.2 MULTIPLE ACCESS PROTOCOLS Collision Free Protocols 2.3 FDDI 2.4 DATA LINK LAYER DESIGN ISSUES 2.5 FRAMING & STUFFING
UNIT-2 2.1 CHANNEL ALLOCATION 2.2 MULTIPLE ACCESS PROTOCOLS 2.2.1 Pure ALOHA 2.2.2 Slotted ALOHA 2.2.3 Carrier Sense Multiple Access 2.2.4 CSMA with Collision Detection 2.2.5 Collision Free Protocols 2.2.5.1
More informationINTERNET ARCHITECTURE & PROTOCOLS
INTERNET ARCHITECTURE & PROTOCOLS Set # 02 Delivered By: Engr Tahir Niazi Need for Data Link Layer possibility of transmission errors receiver need to regulate the rate at which data arrive that's why
More informationData Link Layer (cont.) ( h h h ) (Sicherungsschicht) HDLC - 1.
Data Link Layer (cont.) ( h h h ) (Sicherungsschicht) HDLC - 1 LOGICAL L LINK CONTROL MEDIUM ACCESS CONTROL PHYSICAL SIGNALING DATA LINK LAYER PHYSICAL LAYER ACCESS UNIT INTERFACE PHYSICAL MEDIA ATTACHMENT
More informationAnnouncements. No book chapter for this topic! Slides are posted online as usual Homework: Will be posted online Due 12/6
Announcements No book chapter for this topic! Slides are posted online as usual Homework: Will be posted online Due 12/6 Copyright c 2002 2017 UMaine Computer Science Department 1 / 33 1 COS 140: Foundations
More informationWilliam Stallings Data and Computer Communications. Chapter 7 Data Link Control
William Stallings Data and Computer Communications Chapter 7 Data Link Control Flow Control Ensuring the sending entity does not overwhelm the receiving entity Preventing buffer overflow Transmission time
More informationData Link Control. Outline. DLC functions
Data Link Control #8 1 Outline functions Framing Error and flow control Performance of Example of a standard protocol- >H Open loop flow control 2 Data Link Layer Functions Data Link layer provides a error
More information(Sicherungsschicht) Chapter 5 (part 2) [Wa0001] HDLC - 1.
Data Link Layer (cont.) (Sicherungsschicht) Chapter 5 (part 2) [Wa0001] HDLC - 1 LOGICAL LINK CONTROL MEDIUM ACCESS CONTROL PHYSICAL SIGNALING DATA LINK LAYER PHYSICAL LAYER ACCESS UNIT INTERFACE PHYSICAL
More informationERROR AND FLOW CONTROL. Lecture: 10 Instructor Mazhar Hussain
ERROR AND FLOW CONTROL Lecture: 10 Instructor Mazhar Hussain 1 FLOW CONTROL Flow control coordinates the amount of data that can be sent before receiving acknowledgement It is one of the most important
More informationCHANNEL CODING 1. Introduction
CHANNEL CODING 1. Introduction The fundamental resources at the disposal of a communications engineer are signal power, time and bandwidth. For a given communications environment, these three resources
More informationChapter 11 Data Link Control 11.1
Chapter 11 Data Link Control 11.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 11-1 FRAMING The data link layer needs to pack bits into frames, so that each
More informationTransport Protocols and TCP
Transport Protocols and TCP Functions Connection establishment and termination Breaking message into packets Error recovery ARQ Flow control Multiplexing, de-multiplexing Transport service is end to end
More informationNo book chapter for this topic! Slides are posted online as usual Homework: Will be posted online Due 12/6
Announcements No book chapter for this topic! Slides are posted online as usual Homework: Will be posted online Due 12/6 Copyright c 2002 2017 UMaine School of Computing and Information S 1 / 33 COS 140:
More informationThe Data Link Layer Chapter 3
The Data Link Layer Chapter 3 Data Link Layer Design Issues Error Detection and Correction Elementary Data Link Protocols Sliding Window Protocols Example Data Link Protocols Revised: August 2011 & February
More informationPeer-to-Peer Protocols and Data Link Layer. Chapter 5 from Communication Networks Leon-Gracia and Widjaja
Peer-to-Peer Protocols and Data Link Layer Chapter 5 from Communication Networks Leon-Gracia and Widjaja Peer-to-Peer Protocols At each layer two (or more) entities execute These are peer processes For
More informationData link layer functions. 2 Computer Networks Data Communications. Framing (1) Framing (2) Parity Checking (1) Error Detection
2 Computer Networks Data Communications Part 6 Data Link Control Data link layer functions Framing Needed to synchronise TX and RX Account for all bits sent Error control Detect and correct errors Flow
More informationCS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP
CS 5520/ECE 5590NA: Network Architecture I Spring 2008 Lecture 13: UDP and TCP Most recent lectures discussed mechanisms to make better use of the IP address space, Internet control messages, and layering
More informationTCP : Fundamentals of Computer Networks Bill Nace
TCP 14-740: Fundamentals of Computer Networks Bill Nace Material from Computer Networking: A Top Down Approach, 6 th edition. J.F. Kurose and K.W. Ross Administrivia Lab #1 due now! Reminder: Paper Review
More informationChapter 11 Data Link Control 11.1
Chapter 11 Data Link Control 11.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 11-1 1 FRAMING The data link layer needs to pack bits into frames,, so that
More informationLecture 3: The Transport Layer: UDP and TCP
Lecture 3: The Transport Layer: UDP and TCP Prof. Shervin Shirmohammadi SITE, University of Ottawa Prof. Shervin Shirmohammadi CEG 4395 3-1 The Transport Layer Provides efficient and robust end-to-end
More informationPerformance of UMTS Radio Link Control
Performance of UMTS Radio Link Control Qinqing Zhang, Hsuan-Jung Su Bell Laboratories, Lucent Technologies Holmdel, NJ 77 Abstract- The Radio Link Control (RLC) protocol in Universal Mobile Telecommunication
More informationChapter 11 Data Link Control 11.1
Chapter 11 Data Link Control 11.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 11-1 FRAMING The data link layer needs to pack bits into frames, so that each
More informationThis Lecture. BUS Computer Facilities Network Management. Line Discipline. Data Link Layer
This Lecture US35 - Computer Facilities Network Management Synchronisation and interfacing insufficient by themselves. Need to provide: Flow control - allow the receiver to regulate the flow of data. Error
More informationET3110 Networking and Communications UNIT 2: Communication Techniques and Data Link Control Protocol skong@itt-tech.edutech.edu Learning Objectives Identify methods of detecting errors. Use Hamming code
More informationOutline. EEC-484/584 Computer Networks. Data Link Layer Design Issues. Framing. Lecture 6. Wenbing Zhao Review.
EEC-484/584 Computer Networks Lecture 6 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline Review Data Link Layer Design Issues Error
More informationCOMPUTER NETWORKS - Window protocols
ARQ techniques (window protocols) Gruppo Reti TLC nome.cognome@polito.it http://www.telematica.polito.it/ Copyright Quest opera è protetta dalla licenza Creative Commons NoDerivs-NonCommercial. Per vedere
More informationCOMPUTER NETWORKS - Window protocols
ARQ techniques (window protocols) Gruppo Reti TLC nome.cognome@polito.it http://www.telematica.polito.it/ COMPUTER NETWORKS Window protocols - 1 Copyright Quest opera è protetta dalla licenza Creative
More informationTransport Protocols. ISO Defined Types of Network Service: rate and acceptable rate of signaled failures.
Transport Protocols! Type A: ISO Defined Types of Network Service: Network connection with acceptable residual error rate and acceptable rate of signaled failures. - Reliable, sequencing network service
More informationPrinciples of Reliable Data Transfer
Principles of Reliable Data Transfer 1 Reliable Delivery Making sure that the packets sent by the sender are correctly and reliably received by the receiver amid network errors, i.e., corrupted/lost packets
More information23-3 TCP. Topics discussed in this section: TCP Services TCP Features Segment A TCP Connection Flow Control Error Control 23.22
23-3 TCP 23.22 TCP is a connection-oriented protocol; it creates a virtual connection between two TCPs to send data. In addition, TCP uses flow and error control mechanisms at the transport level. Topics
More informationTransport Layer. -UDP (User Datagram Protocol) -TCP (Transport Control Protocol)
Transport Layer -UDP (User Datagram Protocol) -TCP (Transport Control Protocol) 1 Transport Services The transport layer has the duty to set up logical connections between two applications running on remote
More informationPolitecnico di Milano Scuola di Ingegneria Industriale e dell Informazione. E4 Local Area Networks
Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione E4 Local Area Networks Exercise Consider the LAN in the figure with stations A, B, C, and D (with addresses MAC.A, MAC.B, MAC.C,
More informationECE697AA Lecture 3. Today s lecture
ECE697AA Lecture 3 Transport Layer: TCP and UDP Tilman Wolf Department of Electrical and Computer Engineering 09/09/08 Today s lecture Transport layer User datagram protocol (UDP) Reliable data transfer
More informationAnalyzation of Automatic Repeat Request (ARQ) Protocols
RESEARCH ARTICLE OPEN ACCESS Analyzation of Automatic Repeat Request (ARQ) Protocols 1 Jeshvina.S, 2 Sneha.P, 3 Saraanya.S Final year BCA, Dept of Computer Science New Horizon College Kasturinagar, Bangalore
More informationQ23-5 In a network, the size of the receive window is 1 packet. Which of the follow-ing protocols is being used by the network?
CS368: Exercise 5 Q23-5 In a network, the size of the receive window is 1 packet. Which of the follow-ing protocols is being used by the network? a) Stop_and_Wait b) Go-Back-N c) Selective-Repeat Q23-6.
More informationTransport Layer. Application / Transport Interface. Transport Layer Services. Transport Layer Connections
Application / Transport Interface Application requests service from transport layer Transport Layer Application Layer Prepare Transport service requirements Data for transport Local endpoint node address
More informationData Link Technology. Suguru Yamaguchi Nara Institute of Science and Technology Department of Information Science
Data Link Technology Suguru Yamaguchi Nara Institute of Science and Technology Department of Information Science Agenda Functions of the data link layer Technologies concept and design error control flow
More informationSRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY COMPUTER NETWORKS UNIT - II DATA LINK LAYER
SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY COMPUTER NETWORKS UNIT - II DATA LINK LAYER 1. What are the responsibilities of data link layer? Specific responsibilities of
More informationCS 640 Introduction to Computer Networks. Role of data link layer. Today s lecture. Lecture16
Introduction to Computer Networks Lecture16 Role of data link layer Service offered by layer 1: a stream of bits Service to layer 3: sending & receiving frames To achieve this layer 2 does Framing Error
More informationCS 640 Introduction to Computer Networks Spring 2009
CS 640 Introduction to Computer Networks Spring 2009 http://pages.cs.wisc.edu/~suman/courses/wiki/doku.php?id=640-spring2009 Programming Assignment 3: Transmission Control Protocol Assigned: March 26,
More informationThe flow of data must not be allowed to overwhelm the receiver
Data Link Layer: Flow Control and Error Control Lecture8 Flow Control Flow and Error Control Flow control refers to a set of procedures used to restrict the amount of data that the sender can send before
More informationThe data link layer has a number of specific functions it can carry out. These functions include. Figure 2-1. Relationship between packets and frames.
Module 2 Data Link Layer: - Data link Layer design issues - Error Detection and correction Elementary Data link protocols, Sliding window protocols- Basic Concept, One Bit Sliding window protocol, Concept
More informationNetworking Technologies and Applications
Networking Technologies and Applications Rolland Vida BME TMIT Transport Protocols UDP User Datagram Protocol TCP Transport Control Protocol and many others UDP One of the core transport protocols Used
More informationReliable Transport I: Concepts and TCP Protocol
Reliable Transport I: Concepts and TCP Protocol Stefano Vissicchio UCL Computer Science COMP0023 Today Transport Concepts Layering context Transport goals Transport mechanisms and design choices TCP Protocol
More informationLecture 26: Data Link Layer
Introduction We have seen in previous lectures that the physical layer is responsible for the transmission of row bits (Ones and Zeros) over the channel. It is responsible for issues related to the line
More informationDepartment of Computer and IT Engineering University of Kurdistan. Data Communication Netwotks (Graduate level) Data Link Layer
Department of Computer and IT Engineering University of Kurdistan Data Communication Netwotks (Graduate level) Data Link Layer By: Dr. Alireza Abdollahpouri Data Link Layer 2 Data Link Layer Application
More informationComparison of ISO-OSI and TCP/IP Suit. Functions of Data Link Layer:
Comparison of ISO-OSI and TCP/IP Suit Functions of Data Link Layer: 1. Frame generation ( Character Count, Character Stuffing, Bit Stuffing) 2. Error Processing (Parity(EVEN or ODD), Block Parity, Hamming
More informationProgramming Assignment 3: Transmission Control Protocol
CS 640 Introduction to Computer Networks Spring 2005 http://www.cs.wisc.edu/ suman/courses/640/s05 Programming Assignment 3: Transmission Control Protocol Assigned: March 28,2005 Due: April 15, 2005, 11:59pm
More informationChapter 5 Peer-to-Peer Protocols. School of Info. Sci. & Eng. Shandong Univ..
hapter 5 Peer-to-Peer Protocols School of Info. Sci. & Eng. Shandong Univ.. Outline 5. Peer-to-peer protocols and service models 5. RQ Protocols 5.3 Other daptation Functions Sliding Window Flow ontrol
More informationAgenda. Protocol Principles
Agenda Protocol Principles Layering, CL vs. CO Protocols, Best-Effort vs. Reliable Services ARQ Techniques, Sequence umbers, Windowing, Bandwidth-Delay Product, Flow Control, HDLC Introduction ARQ Techniques
More information06/05/2008. Chapter 3. The Data Link Layer. Data Link Layer Design Issues. Services Provided to the Network Layer. Error Control Flow Control
Chapter 3 The Data Link Layer Data Link Layer Design Issues Services Provided to the Network Layer Framing Error Control Flow Control 1 Functions of the Data Link Layer Provide service interface to the
More informationData and Computer Communications
Data and Computer Communications Chapter 7 Data Link Control Protocols Eighth Edition by William Stallings Lecture slides by Lawrie Brown Data Link Control Protocols "Great and enlightened one," said Ten-teh,
More informationIntroduction to Data Communications & Networking
Introduction to Data Communications & Networking Data Link Layer (Set 5) Chapter 10 and Chapter 11 Dr. Ali Maqousi, Dr. Tatiana Balikhina amaqousi@uop.edu.jo, tbalikhina@uop.edu.jo Department of Computer
More informationTCP/IP Protocol Suite 1
TCP/IP Protocol Suite 1 Stream Control Transmission Protocol (SCTP) TCP/IP Protocol Suite 2 OBJECTIVES: To introduce SCTP as a new transport-layer protocol. To discuss SCTP services and compare them with
More informationUNIT IV -- TRANSPORT LAYER
UNIT IV -- TRANSPORT LAYER TABLE OF CONTENTS 4.1. Transport layer. 02 4.2. Reliable delivery service. 03 4.3. Congestion control. 05 4.4. Connection establishment.. 07 4.5. Flow control 09 4.6. Transmission
More informationReliable Transport I: Concepts and TCP Protocol
Reliable Transport I: Concepts and TCP Protocol Brad Karp UCL Computer Science CS 3035/GZ01 29 th October 2013 Part I: Transport Concepts Layering context Transport goals Transport mechanisms 2 Context:
More informationTransport Layer Protocols TCP
Transport Layer Protocols TCP Gail Hopkins Introduction Features of TCP Packet loss and retransmission Adaptive retransmission Flow control Three way handshake Congestion control 1 Common Networking Issues
More informationOverview. Data Link Technology. Role of the data-link layer. Role of the data-link layer. Function of the physical layer
Overview Data Link Technology Functions of the data link layer Technologies concept and design error control flow control fundamental protocols Suguru Yamaguchi Nara Institute of Science and Technology
More informationData Link Control. Claude Rigault ENST Claude Rigault, ENST 11/3/2002. Data Link control 1
Data Link Control Claude Rigault ENST claude.rigault@enst.fr Data Link control Data Link Control Outline General principles of Data Link Control HDLC Data Link control 2 General principles of Data Link
More informationChapter 5 Peer-to-Peer Protocols and Data Link Layer
Chapter 5 Peer-to-Peer Protocols and Data Link Layer PRT I: Peer-to-Peer Protocols Peer-to-Peer Protocols and Service Models RQ Protocols and Reliable Data Transfer Flow Control Timing Recovery TCP Reliable
More informationThe Transport Layer: TCP & Reliable Data Transfer
The Transport Layer: TCP & Reliable Data Transfer Smith College, CSC 249 February 15, 2018 1 Chapter 3: Transport Layer q TCP Transport layer services: v Multiplexing/demultiplexing v Connection management
More informationLecture 5: Flow Control. CSE 123: Computer Networks Alex C. Snoeren
Lecture 5: Flow Control CSE 123: Computer Networks Alex C. Snoeren Pipelined Transmission Sender Receiver Sender Receiver Ignored! Keep multiple packets in flight Allows sender to make efficient use of
More informationCSE 461: Framing, Error Detection and Correction
CSE 461: Framing, Error Detection and Correction Next Topics Framing Focus: How does a receiver know where a message begins/ends Error detection and correction Focus: How do we detect and correct messages
More informationTCP over wireless links
CSc 450/550 Computer Communications & Networks TCP over wireless links Jianping Pan (stand-in for Dr. Wu) 1/31/06 CSc 450/550 1 TCP over wireless links TCP a quick review on how TCP works Wireless links
More informationTCP/IP-2. Transmission control protocol:
TCP/IP-2 Transmission control protocol: TCP and IP are the workhorses in the Internet. In this section we first discuss how TCP provides reliable, connectionoriented stream service over IP. To do so, TCP
More informationCS 268: Computer Networking. Taking Advantage of Broadcast
CS 268: Computer Networking L-12 Wireless Broadcast Taking Advantage of Broadcast Opportunistic forwarding Network coding Assigned reading XORs In The Air: Practical Wireless Network Coding ExOR: Opportunistic
More informationMultiple Access Protocols
Multiple Access Protocols Computer Networks Lecture 2 http://goo.gl/pze5o8 Multiple Access to a Shared Channel The medium (or its sub-channel) may be shared by multiple stations (dynamic allocation) just
More informationData Link Layer. Indian Institute of Technology Madras
Data Link Layer Study of algorithms for achieving reliable, efficient communication between two adjacent machines at DLL. adjacent - two machines physically connected using a communication channel that
More informationThe Transport Layer Reliability
The Transport Layer Reliability CS 3, Lecture 7 http://www.cs.rutgers.edu/~sn4/3-s9 Srinivas Narayana (slides heavily adapted from text authors material) Quick recap: Transport Provide logical communication
More informationChapter 23 Process-to-Process Delivery: UDP, TCP, and SCTP 23.1
Chapter 23 Process-to-Process Delivery: UDP, TCP, and SCTP 23.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 23-1 PROCESS-TO-PROCESS DELIVERY 23.2 The transport
More informationTCP over Wireless PROF. MICHAEL TSAI 2016/6/3
TCP over Wireless PROF. MICHAEL TSAI 2016/6/3 2 TCP Congestion Control (TCP Tahoe) Only ACK correctly received packets Congestion Window Size: Maximum number of bytes that can be sent without receiving
More informationDifferent Layers Lecture 20
Different Layers Lecture 20 10/15/2003 Jian Ren 1 The Network Layer 10/15/2003 Jian Ren 2 Network Layer Functions Transport packet from sending to receiving hosts Network layer protocols in every host,
More informationDATA LINK LAYER UNIT 7.
DATA LINK LAYER UNIT 7 1 Data Link Layer Design Issues: 1. Service provided to network layer. 2. Determining how the bits of the physical layer are grouped into frames (FRAMING). 3. Dealing with transmission
More information2.4 Error Detection Bit errors in a frame will occur. How do we detect (and then. (or both) frames contains an error. This is inefficient (and not
CS475 Networks Lecture 5 Chapter 2: Direct Link Networks Assignments Reading for Lecture 6: Sections 2.6 2.8 Homework 2: 2.1, 2.4, 2.6, 2.14, 2.18, 2.31, 2.35. Due Thursday, Sept. 15 2.4 Error Detection
More informationYour favorite blog :www.vijay-jotani.weebly.com (popularly known as VIJAY JOTANI S BLOG..now in facebook.join ON FB VIJAY
VISIT: Course Code : MCS-042 Course Title : Data Communication and Computer Network Assignment Number : MCA (4)/042/Assign/2014-15 Maximum Marks : 100 Weightage : 25% Last Dates for Submission : 15 th
More informationGuide To TCP/IP, Second Edition UDP Header Source Port Number (16 bits) IP HEADER Protocol Field = 17 Destination Port Number (16 bit) 15 16
Guide To TCP/IP, Second Edition Chapter 5 Transport Layer TCP/IP Protocols Objectives Understand the key features and functions of the User Datagram Protocol (UDP) Explain the mechanisms that drive segmentation,
More information10.1 REVIEW QUESTIONS
CHAPTER 10 Data Link Control 10.1 REVIEW QUESTIONS 1. Transmission means to put a signal on a line. Communication is a meaningful and orderly relationship between devices that send and receive data. 3.
More informationStream Control Transmission Protocol
Chapter 13 Stream Control Transmission Protocol Objectives Upon completion you will be able to: Be able to name and understand the services offered by SCTP Understand SCTP s flow and error control and
More informationOutline Computer Networking. Functionality Split. Transport Protocols
Outline 15-441 15 441 Computer Networking 15-641 Lecture 10: Transport Protocols Justine Sherry Peter Steenkiste Fall 2017 www.cs.cmu.edu/~prs/15 441 F17 Transport introduction TCP connection establishment
More informationNWEN 243. Networked Applications. Layer 4 TCP and UDP
NWEN 243 Networked Applications Layer 4 TCP and UDP 1 About the second lecturer Aaron Chen Office: AM405 Phone: 463 5114 Email: aaron.chen@ecs.vuw.ac.nz Transport layer and application layer protocols
More informationThe Data Link Layer Chapter 3
The Data Link Layer Chapter 3 Data Link Layer Design Issues Error Detection and Correction Elementary Data Link Protocols Sliding Window Protocols Example Data Link Protocols Revised: August 2011 The Data
More informationNetworked Systems and Services, Fall 2018 Chapter 3
Networked Systems and Services, Fall 2018 Chapter 3 Jussi Kangasharju Markku Kojo Lea Kutvonen 4. Transport Layer Reliability with TCP Transmission Control Protocol (TCP) RFC 793 + more than hundred other
More informationTCP and Congestion Control (Day 1) Yoshifumi Nishida Sony Computer Science Labs, Inc. Today's Lecture
TCP and Congestion Control (Day 1) Yoshifumi Nishida nishida@csl.sony.co.jp Sony Computer Science Labs, Inc 1 Today's Lecture Part1: TCP concept Part2: TCP detailed mechanisms Part3: Tools for TCP 2 1
More information14-740: Fundamentals of Computer and Telecommunication Networks
14-740: Fundamentals of Computer and Telecommunication Networks Fall 2018 Quiz #2 Duration: 75 minutes ANSWER KEY Name: Andrew ID: Important: Each question is to be answered in the space provided. Material
More informationPROBLEMSAND EXERCISES
Departamento de Tecnología Electrónica Computer Networking Unit 3: Transport layer PROBLEMSAND EXERCISES Transport Layer 95 Pr1: port numbers Suppose that the client A initiates a TCP connection to a Web
More informationTransmission Control Protocol. ITS 413 Internet Technologies and Applications
Transmission Control Protocol ITS 413 Internet Technologies and Applications Contents Overview of TCP (Review) TCP and Congestion Control The Causes of Congestion Approaches to Congestion Control TCP Congestion
More informationCCNA Exploration1 Chapter 7: OSI Data Link Layer
CCNA Exploration1 Chapter 7: OSI Data Link Layer LOCAL CISCO ACADEMY ELSYS TU INSTRUCTOR: STELA STEFANOVA 1 Explain the role of Data Link layer protocols in data transmission; Objectives Describe how the
More information