Chapter 11 Data Link Control Http netwk hannam
- Slides: 108
Chapter 11 데이터 링크 제어 (Data Link Control) Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 1
바이트 채우기는 텍스트에 플래그나 ESC 문제가 있을 때 여분의 1 바이트를 추가하는 처리이다. Byte stuffing is the process of adding 1 extra byte whenever there is a flag or escape character in the text. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 8
비트 채워 넣기는 수신자가 데이터 속에 있는 “ 01111110”을 플래그로 오해하지 않도록 “ 0” 다음에 연속되는 “ 1”이 다섯개 있으면 여분의 “ 0” 비트를 추가하는 처리이다. Bit stuffing is the process of adding one extra 0 whenever five consecutive 1 s follow a 0 in the data, so that the receiver does not mistake the pattern 0111110 for a flag. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 10
q 비트 채우기(stuffing)와 빼기(unstuffing) Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 11
11. 2 흐름 제어와 오류 제어 데이터링크층의 가장 중요한 책무는 흐름 제어(flow control)와 오류 제어(error control)이다. 총체적으로 이 기능들을 데이터링크 제어(data link control)라고 한다. Topics discussed in this section: Flow Control Error Control Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 12
흐름 제어는 송신자가 확인응답을 받기 전에 보낼 수 있는 데이터의 양을 제한하기 위해 사용하는 일련의 절차이다. Flow control refers to a set of procedures used to restrict the amount of data that the sender can send before waiting for acknowledgment. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 13
데이터링크 층의 오류제어는 데이터 재전송을 요구하는 ARQ를 기반으로 한다. Error control in the data link layer is based on automatic repeat request, which is the retransmission of data. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 14
q 이 장에서 논의된 프로토콜의 종류 Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 16
1. 4 무잡음(NOISELESS) CHANNELS 우선 프레임 손실도 없고 복제되지도 않으며 손상되 지 않는 이상적인 채널을 가정하자. 이러한 종류의 채널에 대해서는 두 개의 프로토콜을 소개한다. Topics discussed in this section: Simplest Protocol Stop-and-Wait Protocol Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 17
q 가장 간단한 프로토콜의 송신측 알고리즘 Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 19
q 가장 간단한 프로토콜의 수신측 알고리즘 Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 20
Figure 11. 7 Flow diagram for Example 11. 1 Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 22
q 정지 후 대기(Design of Stop-and-Wait) Protocol Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 23
q 정지-후-대기 프로토콜을 위한 송신측 알고리즘 (Sender-site algorithm for Stop-and-Wait Protocol) Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 24
q 정지-후-대기를 위한 수신측 알고리즘 (Receiver-site algorithm for Stop-and-Wait Protocol) Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 25
Figure 11. 9 Flow diagram for Example 11. 2 Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 27
정지-후-대기 ARQ에서 오류제어는 전송된 프레임 의 사본을 가지고 있다가 타이머가 종료되면 프레임을 재 전송 한다. Error correction in Stop-and-Wait ARQ is done by keeping a copy of the sent frame and retransmitting of the frame when the timer expires. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 29
정지-후-대기 ARQ에서 순서 번호는 프레임에 부여하여 사용한다. 순서번호는 모듈러-2 연산을 기반으로 한다. In Stop-and-Wait ARQ, we use sequence numbers to number the frames. The sequence numbers are based on modulo-2 arithmetic. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 30
정지-후-대기 ARQ에서 확인응답 번호는 예상되는 다음 프레임의 순서 번호를 모듈러-2 연산으로 만들어 보낸다. In Stop-and-Wait ARQ, the acknowledgment number always announces in modulo-2 arithmetic the sequence number of the next frame expected. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 31
Figure 11. 10 Design of the Stop-and-Wait ARQ Protocol Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 32
Algorithm 11. 5 Sender-site algorithm for Stop-and-Wait ARQ (continued) Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 33
Algorithm 11. 5 Sender-site algorithm for Stop-and-Wait ARQ Http: //netwk. hannam. ac. kr (continued) HANNAM UNIVERSITY 34
Algorithm 11. 6 Receiver-site algorithm for Stop-and-Wait ARQ Protocol Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 35
Figure 11. 11 Flow diagram for Example 11. 3 Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 37
Go-Back-N 프로토콜 N 복귀 프로토콜에서 순서번호는 모듈로 2 m 인데, 여기서 m은 비트 단위의 순서 번호 필드의 길이이다. In the Go-Back-N Protocol, the sequence numbers are modulo 2 m, where m is the size of the sequence number field in bits. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 41
Figure 11. 12 Send window for Go-Back-N ARQ Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 42
송신 창은 세 개의 변수 Sf , Sn, Ssize 를 갖는 크기가 2 m − 1 인 가상의 상자를 정의하는 추상적인 개념이다. The send window is an abstract concept defining an imaginary box of size 2 m − 1 with three variables: Sf, Sn, and Ssize. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 43
송신 창은 적법한 응답이 도착하면 한 칸 이상 밀려 갈 수 있다. The send window can slide one or more slots when a valid acknowledgment arrives. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 44
Figure 11. 13 Receive window for Go-Back-N ARQ Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 45
수신 창은 한 개의 변수 Rn을 갖는 크기가 1인 가상 상자 를 정의하는 추상적인 개념이다. 바른 프레임이 도달했을 때 창이 밀려지며 항상 1칸 씩 밀린다. The receive window is an abstract concept defining an imaginary box of size 1 with one single variable Rn. The window slides when a correct frame has arrived; sliding occurs one slot at a time. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 46
Figure 11. 14 Design of Go-Back-N ARQ Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 47
Figure 11. 15 Window size for Go-Back-N ARQ Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 48
N 복귀 ARQ에서는 송신 창의 크기는 2 m 보다 작아야 하 며 수신 창의 크기는 항상 1이다. In Go-Back-N ARQ, the size of the send window must be less than 2 m; the size of the receiver window is always 1. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 49
Algorithm 11. 7 Go-Back-N sender algorithm (continued) Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 50
Algorithm 11. 7 Go-Back-N sender algorithm (continued) 11. 51 Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 51
Algorithm 11. 8 Go-Back-N receiver algorithm Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 52
Figure 11. 16 Flow diagram for Example 11. 6 Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 54
Figure 11. 17 Flow diagram for Example 11. 7 Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 57
정지 후 대기 ARQ는 송신 윈도우 크기가 1인 N 복귀 ARQ의 특별한 경우이다. Stop-and-Wait ARQ is a special case of Go-Back. N ARQ in which the size of the send window is 1. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 58
Figure 11. 18 Send window for Selective Repeat ARQ Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 59
Figure 11. 19 Receive window for Selective Repeat ARQ Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 60
Figure 11. 20 Design of Selective Repeat ARQ Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 61
Figure 11. 21 Selective Repeat ARQ, window size Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 62
선택적 반복 ARQ에서는 송신 창과 수신 창의 크기는 최대 2 m의 절반이다. In Selective Repeat ARQ, the size of the sender and receiver window must be at most one-half of 2 m. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 63
Algorithm 11. 9 Sender-site Selective Repeat algorithm (continued) Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 64
Algorithm 11. 9 Sender-site Selective Repeat algorithm (continued) Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 65
Algorithm 11. 9 Sender-site Selective Repeat algorithm Http: //netwk. hannam. ac. kr (continued) HANNAM UNIVERSITY 66
Algorithm 11. 10 Receiver-site Selective Repeat algorithm Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 67
Algorithm 11. 10 Receiver-site Selective Repeat algorithm Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 68
Figure 11. 22 Delivery of data in Selective Repeat ARQ Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 69
Figure 11. 23 Flow diagram for Example 11. 8 Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 74
Figure 11. 24 Design of piggybacking in Go-Back-N ARQ Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 75
11. 6 HDLC 고급 데이터 링크 제어(HDLC, High-level Data Link Control)는 점-대-점과 다중점 링크상에서 반이중 통 신과 전이중 통신 모두를 지원하도록 설계된 실제 프로토콜이다. HDLC는 본장에서 논의한 ARQ 장치 를 구현한 것이다. Topics discussed in this section: Configurations and Transfer Modes Frames Control Field Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 76
Figure 11. 25 Normal response mode Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 77
Figure 11. 26 Asynchronous balanced mode Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 78
Figure 11. 27 HDLC frames Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 79
Figure 11. 28 Control field format for the different frame types Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 80
Table 11. 1 U-frame control command response Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 81
Figure 11. 29 Example of connection and disconnection Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 83
Figure 11. 30 Example of piggybacking without error Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 86
Figure 11. 31 Example of piggybacking with error Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 88
11. 7 POINT-TO-POINT PROTOCOL HDLC는 점-대-점 및 다중점 형상 모두에서 사용될 수 있는 일반적인 프로토콜이지만 가장 널리 사용되 는 점-대-점 연결 프로토콜은 PPP(Point-to Point) 프 로토콜이다. Topics discussed in this section: Framing Transition Phases Multiplexing Multilink PPP Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 89
Figure 11. 32 PPP frame format Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 90
PPP는 바이트 중심 프로토콜로서 탈출 문자 0111110을 사용하여 바이트 채우기를 한다. PPP is a byte-oriented protocol using byte stuffing with the escape byte 01111101. Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 91
Figure 11. 33 Transition phases Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 92
Figure 11. 34 Multiplexing in PPP Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 93
Figure 11. 35 LCP packet encapsulated in a frame Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 94
Table 11. 2 LCP packets Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 95
Table 11. 3 Common options Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 96
Figure 11. 36 PAP packets encapsulated in a PPP frame Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 97
Figure 11. 37 CHAP packets encapsulated in a PPP frame Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 98
Figure 11. 38 IPCP packet encapsulated in PPP frame Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 99
Table 11. 4 Code value for IPCP packets Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 100
Figure 11. 39 IP datagram encapsulated in a PPP frame Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 101
Figure 11. 40 Multilink PPP Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 102
Figure 11. 41 An example Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 105
Figure 11. 41 An example (continued) Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 106
11. 8 요약 Q & A Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 107
q Report ■ 연습 문제 풀이 ■ 다음주 이 시간까지 Http: //netwk. hannam. ac. kr HANNAM UNIVERSITY 108
- Netwk
- Piggybacking arq
- Hannam mobile
- Hannam.ac.kr
- Netwk
- Jelaskan tentang error control pada data link control?
- High-level data link control
- Pengertian data link
- Data link control deals with the design and procedures for
- Data link layer framing
- Protokol hdlc adalah
- Link
- Data link control
- Data link control
- Data link layer flow control
- High level data link control protocol
- Flow control in data link layer
- Data link control
- Flow control protocols in data link layer
- Site:.com "fill link item" "add link"
- @penyebar link:http://t.me/penyegarnikmat
- Http //mbs.meb.gov.tr/ http //www.alantercihleri.com
- Http //siat.ung.ac.id atau http //pmb.ung.ac.id
- Ex link samsung tv
- Llc logical link control
- Dmi link aspm control
- The ppp link control protocol was terminated
- Unrestricted simplex protocol
- Data link layer design issues
- Utopian simplex protocol
- Materi data link layer
- Karmetasploit
- Header layer 2 berisi informasi
- Data link layer switching in computer networks
- Link analysis data mining
- Stop-and-wait arq
- Ppp data link
- Error detection and correction in data link layer
- Token ring is a data link technology for
- Data link layer divided into two sublayers
- Unacknowledged connectionless service
- Application transport network link physical
- Application presentation session transport network
- Global operational data link document
- Communication at the data link layer is
- Design issues for data link layer
- Block coding in data link layer
- Fansreal.nat
- Data link layer protocols for noisy and noiseless channels
- Responsibilities of data link layer
- Data link
- Data link layer
- Elementary data link protocols in computer networks
- Dlc in data link layer stands for
- Unrestricted simplex protocol program in c
- The two main functions of the data link layer are
- Data link layer switching
- Elementary data link protocols
- Pengertian physical layer
- Madl data link
- Channel allocation problem in data link layer
- What does rcp 240 mean?
- Data link layer framing
- Ccna 1 chapter 7
- Healthy vs unhealthy sibling relationships
- Http://hdr.undp.org/en/data
- Http data source exception
- Translational research institute on pain in later life
- Difference between process control and product control
- Reynold’s transport theorem
- Stock control e flow control
- Control volume vs control surface
- Negative vs positive control operon
- Negative vs positive control
- Control de flujo parada y espera
- Negative control vs positive control examples
- Flow and error control
- Sectional drive
- Salin teks di foto
- Forwarding equivalence classes
- What is quality control definition
- Data plane control plane and management plane
- Data bus vs address bus vs control bus
- Dqc data quality control
- Average fraction defective
- Control chart for attribute data
- Data control language
- Error control in data communication
- Quality control data management
- Semantic integrity
- Data flow vs control flow
- Control flow and data flow computers
- Data quality control techniques
- Supervisory control and data acquisition software
- Apa saja tugas dccu
- Control data systems inc
- Control data
- Semantic data control in distributed database
- The online data entry control called preformatting is
- Adverbials to link paragraphs
- Napa prolink.com
- Ucsd university link
- Cheapest link algorithm
- Piliavin et al
- How does levine link to social area
- Ocr
- Yoke block anesthesia machine
- Mylearninglink schneider
- Learning link oup