DOCSLIB.ORG

Flow Control and ARQ Media Access Physical

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Flow Control and ARQ Media Access Physical Data Link Layer The Data Link layer can be further subdivided into: Computer Networks application 1. Logical Link Control (LLC): provides flow and error control transport • different link protocols may provide different services, e.g., Ethernet doesn’t provide reliable network delivery (error recovery) Lecture 26: 2. Media Access Control (MAC): framing and LLC MAC Flow Control and ARQ media access physical Link Layer Services Flow Control Flow Control: What is flow control? • pacing between adjacent sending and receiving nodes • receiver telling sender to slow down Error Control: Why do you need flow control? • errors caused by signal attenuation, noise • ARQ: receiver detects presence of errors and asks sender for retransmission Flow control protocols at data link layer (single hop): • FEC: receiver identifies and corrects bit error(s), • XON/XOFF without resorting to retransmission • Stop & Wait Protocol • Sliding Window Protocol Reliable delivery between adjacent nodes • seldom used on low bit error links (fiber, some twisted pair) Similar issues and mechanisms apply at the • plays an important role in wireless links with high error rates transport layer (end-to-end) • Q: why do we need both link-level and end-end reliability? XON/XOFF Stop and Wait (S&W) Protocol ! : propagation After sending a packet, sender must wait for delay SR acknowledgment (ACK) before sending the next packet sender receiver Sender Receiver S R round-trip Algorithm: time (rtt) t • S sends stream of data Time ! : propagation • R sends XOFF, S stops transmission pkt delay • 2! R sends XON, S resumes transmission t+ ! ACK Works OK if τ is small, otherwise sender t+ can overrun receiver (Why?) 2! Stop & Wait Performance Stop & Wait Performance sender receiver Disadvantages: first packet bit transmitted, t = 0 • slow last packet bit transmitted, t = L/µ • must wait for ACK even if no overrun first packet bit arrives • max transmission bandwidth 1 packet/round-trip time (rtt) RTT (2τ ) last packet bit arrives, send ACK Performance is ok if τ is small, otherwise inefficient ACK arrives, send next packet, t = RTT + L/µ Example 1: Example 2: • link bandwith (µ) = 1 Mbps, with packet size (L) = 1 Kbits, • link bandwidth (µ ) = 1 Gbps, propagation delay (τ ) = 15 ms, transmission time is L/µ = 1 ms packet size (L) = 8 Kbits, transmission time is L/µ = 8 µs • if rtt (2τ ) = 9 ms, we can send 100 pkts/sec • sender utilization (Us), fraction of time sender is sending: 3 9 • the throughput (Tg) is 100 Kbps (10% of capacity) L / µ 8·10 /10 U = = = 0.00027 s 2τ + L / µ 30 + 8·10−6 Sliding Window: Sliding Window Pipelined Flow Control Send w number of packets before waiting for an ACK (can have w outstanding, unACKed, packets) Pipelining: sender allows multiple “in-flight,” yet-to-be-acknowledged, packets [Stevens] For every received ACK, slide window (over data) by 1 packet (S&W is sliding window with w = 1) Throughput of the sliding window protocol (Tw): Tw = Tg*w send window size w limited by buffer size at receiver (wR): Tw = Tg*MIN(w,wR) Pipelining: Increased Utilization sender receiver Sliding Window: Max Window Size first packet bit transmitted, t = 0 last bit transmitted, t = L/µ What is the optimal window size? first packet bit arrives i.e., what’s the maximum number of packets on can RTT (2τ ) last bit of 1st pkt arrives, send ACK last bit of 2nd pkt arrives, send ACK have outstanding (to “fill the pipe”)? last bit of 3rd pkt arrives, send ACK ACK arrives, send next μ = μ = 2 μ packet, t = RTT + L/µ Let be the link bandwidth, pipe size RTT* τ * (commonly called the bandwidth-delay product) Example 3: Normally you don’t want to, and can’t, fill the pipe • link bandwidth (μ) = 1 Gbps, propagation delay (τ ) = 15 ms, packet size (L) = 8 Kbits, transmission time is L/µ = 8 completely (more when we discuss reliable transport µs, window size (w) = 3 protocol) increased • sender utilization (Us), fraction of time sender is sending: utilization w * L / µ 3* 8·103 /109 by a factor U = = = 0.0008 of 3! s 2τ + L / µ 30 + 8·10−6 Error Control Automatic Repeat reQuest (ARQ) Sender Receiver S R round-trip How does sender know when time (rtt) Errors are unavoidable, caused by noise on channel: t Time τ : propagation pkt • electrical interference, thermal noise, cosmic rays, etc. and which pkts to retransmit? X delay 2τ pkt lost • by the use of ACKs and timeout t+ τ Three kinds of transmission errors: t+ 2τ General algorithm: pkt 1. sent signal destroyed (data not received) rexmitted 2. sent signal changed (received wrong data) • receiver acknowledges (ACKs) receipt of pkts 3. spurious signal created (received random data) • sender retransmits packets not ACKed by timeout • a.k.a. PAR: Positive Acknowledgement with Retransmission Automatic Repeat reQuest (ARQ): sender retransmits lost or corrupted packets Reliability protocols: • Alternating Bit Protocol (ABP) • Go-Back-N (GBN, with or without NAK) • Selective Repeat Protocol (SRP) Alternating Bit Protocol (ABP) ABP in Action S&W with un-numbered packets and ACKs causes confusion on retransmission: • how to differentiate a retransmitted frame from the next frame? Sender Receiver S R round-trip time (rtt) t Time τ : propagation pkt delay 2τ t+ τ ACK X ACK lost t+ 2τ how to detect duplicate? ABP: uses 1 bit to number packets and ACKs ABP in Action Performance of ABP ABP works, but performance is bad Example: • link bandwidth (µ ) = 1 Gbps • propagation delay (τ ) = 15 ms • packet size (L) = 8 Kbits, transmission time is L/µ = 8 µs • sender utilization (Us) is the same as S&W: L / µ 8·103 /109 U = = = 0.00027 s 2τ + L / µ 30 + 8·10−6 • about 1 packet every 30 ms • 33 KBps or 264 Kbps throughput over a 1 Gbps link! Go-Back-N (Link-layer) Go-Back-N (Link-layer) Sender: Sender: • puts k-bit sequence number (seq#) in packet header • associates a timer with each in-flight packet • sends a “window” of up to N packets • timeout(n): retransmits packet with seq# n • consecutive unACKed (una) packets allowed and all higher seq# in window • resets snd_next to snd_una (n) snd_una snd_next • resets timer for all retransmitted packets snd_una snd_next • notation: ACK(n) means ACKs packet with seq# n Go-Back-N (Link-layer) Go-Back-N [K&R] Receiver: Sender: • only needs to remember next expected seq# (next_seqn) • ACK(n) is cumulative: ACKs all packets up to and including seq# n • ACKs and delivers to app packets that arrived in order • maintains only one active timer, for snd_una • discards out-of-order packets no buffering! • timeout(snd_una): retransmits snd_una and all higher seq#s in • ACKs out-of-order packets if seq# is smaller than next_seqn window Sender Receiver Sender Receiver (why?) S R S R • snd_next snd_una round-trip resets to time (rtt) 1 1 2 2 • resets timer for snd_una 3 3 4 4 X Pkts Pkts next_seqn 2τ 1 = 2 2 1 3 3 discard snd_una snd_next 4 4 these ACK(1) X next_seqn ACK(1) = 5 5 5 ACK(3) ACK(4) 2 2 3 3 rexmission 4 4 5 5 next_seqn 5 5 discard timeout (rto) = 6 next_seqn 2 2 = 2 ACK(5) 3 discard 3 4 all these 4 5 5 ACK(2) ACK(2) ACK(3) ACK(3) ACK(4) ACK(4) ACK(5) ACK(5) Go-Back-N [K&R] Go-Back-N with Negative ACK (NAK) Receiver: Receiver: • only needs to remember next expected seq# (next_seqn) • ACKs and delivers in-order packets • cumulative ACK acknowledges all packets received in-order • sends NAK for first out of order packet and discards packet • out-of-order packets repeat the last ACK Sender Receiver Sender Receiver • ACKs and discards subsequent out of order packets S R S R round-trip time (rtt) 1 1 2 2 3 3 4 4 Sender: retransmits on receiving NAK or if RTO expires X Pkts Pkts next_seqn 2τ 1 1 2 = 2 3 3 discard 4 4 these ACK(1) X next_seqn ACK(1) 5 ACK(3) = 5 5 ACK(4) ACK(1) 6 7 2 8 3 sender rexmission 4 timeout (rto) 5 5 5 discard 6 next_seqn 7 2 = 2 ACK(5) 8 3 ACK(1) 4 next_seqn 5 ACK(6) = 9 ACK(2) receiver ACK(7) ACK(8) ACK(3) ACK(4) Walrand ACK(5) Selective Repeat Protocol (SRP) Selective Repeat Protocol (SRP) Receiver: Receiver: • buffers out-of-order packets (up to wR), for in-order delivery • buffers out-of-order packets (up to w ), for in-order delivery R • ACKs all correctly received packets individually • ACKs all correctly (no error, but may be out-of-order) received packets individually, not cumulatively 1 2 3 4 5 6 7 1 2 3 4 5 6 7 Sender: cannot send ok to send snd_una snd_next • pkt 5 (why?) pkt 6 (why?) Sender: keeps track of wR and ensures that wR > (snd_next − snd_una), • keeps track of wR in the example, wR = 4 and ensures that w R • wR > (snd_next − snd_una) keeps a retransmit timer • keeps a retransmit timer for each packet for each packet • retransmits only unACKed Walrand • retransmits only packets unACKed packets wR next_seqn Selective Acknowledgement: Piggy-back NAK with ACK., e.g. [ACK2,NAK1], [ACK4,NAK3] Selective Repeat in Action Selective Repeat Summary sender receiver • data from upper layer: • packet n in [next_seqn, • if next available seq# in next_seqn+wR1] window, send packet • send ACK(n) • timeout(n): • out-of-order: buffer • non-cumulative ACK • resend packet n, restart timer in-order: deliver (also deliver buffered, in-order packets), • received ACK(n) in [snd_una, advance window to next not-yet- snd_next]: received packet • mark pkt n as received • next_seqn • if n is smallest unACKed packet n < • n packet, advance snd_una to send ACK( ) next unACKed seq# • otherwise: • ignore ARQ Protocols Summary Simplifying Assumption Infinite sequence# space Go-Back-N [K&R]: Selective Repeat • sender: allows up to N • sender: allows up to N Suppose you have only a 2-bit sequence space: Sender Receiver unACKed
Load more

Recommended publications
  • Technical Characteristics for a VHF Data Exchange System in the VHF Maritime Mobile Band
    Recommendation ITU-R M.2092-0 (10/2015) Technical characteristics for a VHF data exchange system in the VHF maritime mobile band M Series Mobile, radiodetermination, amateur and related satellite services ii Rec. ITU-R M.2092-0 Foreword The role of the Radiocommunication Sector is to ensure the rational, equitable, efficient and economical use of the radio- frequency spectrum by all radiocommunication services, including satellite services, and carry out studies without limit of frequency range on the basis of which Recommendations are adopted. The regulatory and policy functions of the Radiocommunication Sector are performed by World and Regional Radiocommunication Conferences and Radiocommunication Assemblies supported by Study Groups. Policy on Intellectual Property Right (IPR) ITU-R policy on IPR is described in the Common Patent Policy for ITU-T/ITU-R/ISO/IEC referenced in Annex 1 of Resolution ITU-R 1. Forms to be used for the submission of patent statements and licensing declarations by patent holders are available from http://www.itu.int/ITU-R/go/patents/en where the Guidelines for Implementation of the Common Patent Policy for ITU-T/ITU-R/ISO/IEC and the ITU-R patent information database can also be found. Series of ITU-R Recommendations (Also available online at http://www.itu.int/publ/R-REC/en) Series Title BO Satellite delivery BR Recording for production, archival and play-out; film for television BS Broadcasting service (sound) BT Broadcasting service (television) F Fixed service M Mobile, radiodetermination, amateur and related satellite services P Radiowave propagation RA Radio astronomy RS Remote sensing systems S Fixed-satellite service SA Space applications and meteorology SF Frequency sharing and coordination between fixed-satellite and fixed service systems SM Spectrum management SNG Satellite news gathering TF Time signals and frequency standards emissions V Vocabulary and related subjects Note: This ITU-R Recommendation was approved in English under the procedure detailed in Resolution ITU-R 1.
    [Show full text]
  • (19) United States (12) Patent Application Publication (10) Pub
    US 20140071868A1 (19) United States (12) Patent Application Publication (10) Pub. No.: US 2014/0071868 A1 Bergquist et al. (43) Pub. Date: Mar. 13, 2014 (54) APPARATUSES AND METHODS FOR Publication Classi?cation MANAGING PENDING HARQ RETRANSMISSIONS (51) Int. Cl. H04W 76/04 (2006.01) (71) Applicants:Gunnar Bergquist, Kista (SE); Riikka H04L 1/18 (2006.01) Susitaival, Helsinki (Fl); Anders Ohlsson, Jarfalla (SE); Mikael (52) US. Cl. Wittberg, Uppsala (SE) CPC ......... .. H04W 76/048 (2013.01); H04L 1/1803 (2013.01) (72) Inventors: Gunnar Bergquist, Kista (SE); Riikka USPC ......................................... .. 370/311; 370/328 Susitaival, Helsinki (Fl); Anders Ohlsson, Jarfalla (SE); Mikael Wittberg, Uppsala (SE) (57) ABSTRACT (73) Assignee: Telefonaktiebolaget L M Ericsson (publ), Stockholm (SE) Methods and systems present solutions to, for example, the (21) Appl. No .: 13/825,462 problem of unnecessary preparedness for suspended retrans missions in the user equipment (UE) Which contributes to (22) PCT Filed: Nov. 9, 2012 poWer drain in the device battery. One method for monitoring a Physical DoWnlink Control Channel (PDCCH) for adaptive PCT No.: PCT/SE2012/051225 (86) retransmission grants in a radio communication system § 371 (0X1), includes: monitoring, by a user equipment (U E), the PDCCH (2), (4) Date: Mar. 21, 2013 for adaptive retransmission grants; receiving, by the UE, a Related US. Application Data hybrid automatic repeat request (HARQ) acknowledge (ACK) message, and ceasing, by the UE, to monitor the (60) Provisional application No. 61/646,757, ?led on May PDCCH for adaptive retransmission grants after receipt of the 14, 2012. HARQ ACK message. -------- -- RADIO BEARERS BCCH PCCH SEGM.
    [Show full text]
  • Effect of Sliding Window Techniques Over a Performance of Tcp/Ip Networks
    EFFECT OF SLIDING WINDOW TECHNIQUES OVER A PERFORMANCE OF TCP/IP NETWORKS ABBAS ABEDI JANUARY, 2018 EFFECT OF SLIDING WINDOWS TECHNIQUES OVER A PERFORMANCE OF TCP/IP NETWORKS A THESIS SUBMITTED TO THE GRADUATE SCHOOL OF NATURAL AND APPLIED SCIENCES OF CANKAYA UNIVERSITY BY ABBAS ABEDI IN PARTIAL FULLFILLMENT OF a REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN THE DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING JANUARY, 2018 ABSTRACT EFFECT OF SLIDING WINDOWS TECHNIQUES OVER A PERFORMANCE OF TCP/IP NETWORKS ABEDI, Abbas M.Sc., Department of Electronics and Communication Engineering Supervisor: Asst. Prof. Dr. Barbaros PREVEZE January 2018 The communication channels have a variety of features in the communication system and networks, particularly wireless channels. It is used in transmissions between two nodes and deals with high error rates. Such errors that occur frequently which are not easy to be avoided, have the greatest effect on the performance of a network. So, it must be concluded that error rates are for different network conditions with use of different types of sliding windows techniques. In this thesis, error correcting techniques have been investigated based on a retransmission technique they used. One of the famous retransmission techniques is sliding windows technique, which it has three sub-algorithms called: stop and wait, selective repeat, and go back N. In this work, selective repeat and go back N algorithms were taken into account, but a stop and wait algorithm was not considered since it doesn’t use any window structure in their retransmissions. Also, it always has a high delay amount with less performance compared to the selective repeat and go back N techniques.
    [Show full text]
  • The Kermit File Transfer Protocol
    THE KERMIT FILE TRANSFER PROTOCOL Frank da Cruz February 1985 This is the original manuscript of the Digital Press book Kermit, A File Transfer Protocol, ISBN 0-932976-88-6, Copyright 1987, written in 1985 and in print from 1986 until 2001. This PDF file was produced by running the original Scribe markup-language source files through the Scribe publishing package, which still existed on an old Sun Solaris computer that was about to be shut off at the end of February 2016, and then converting the resulting PostScript version to PDF. Neither PostScript nor PDF existed in 1985, so this result is a near miracle, especially since the last time this book was "scribed" was on a DECSYSTEM-20 for a Xerox 9700 laser printer (one of the first). Some of the tables are messed up, some of the source code comes out in the wrong font; there's not much I can do about that. Also (unavoidably) the page numbering is different from the printed book and of couse the artwork is missing. Bear in mind Kermit protocol and software have seen over 30 years of progress and development since this book was written. All information herein regarding the Kermit Project, how to get Kermit software, or its license or status, etc, is no longer valid. The Kermit Project at Columbia University survived until 2011 but now it's gone and all Kermit software was converted to Open Source at that time. For current information, please visit the New Open Source Kermit Project website at http://www.kermitproject.org (as long as it lasts).
    [Show full text]
  • Master's Thesis
    MASTER'S THESIS Analysis of UDP-based Reliable Transport using Network Emulation Andreas Vernersson 2015 Master of Science in Engineering Technology Computer Science and Engineering Luleå University of Technology Department of Computer Science, Electrical and Space Engineering Abstract The TCP protocol is the foundation of the Internet of yesterday and today. In most cases it simply works and is both robust and versatile. However, in recent years there has been a renewed interest in building new reliable transport protocols based on UDP to handle certain problems and situations better, such as head-of-line blocking and IP address changes. The first part of the thesis starts with a study of a few existing reliable UDP-based transport protocols, SCTP which can also be used natively on IP, QUIC and uTP, to see what they can offer and how they work, in terms of features and underlying mechanisms. The second part consists of performance and congestion tests of QUIC and uTP imple- mentations. The emulation framework Mininet was used to perform these tests using controllable network properties. While easy to get started with, a number of issues were found in Mininet that had to be resolved to improve the accuracy of emulation. The tests of QUIC have shown performance improvements since a similar test in 2013 by Connectify, while new tests have identified specific areas that might require further analysis such as QUIC’s fairness to TCP and performance impact of delay jitter. The tests of two different uTP implementations have shown that they are very similar, but also a few differences such as slow-start growth and back-off handling.
    [Show full text]
  • Chapter 5 Peer-To-Peer Protocols and Data Link Layer
    Chapter 5 Peer-to-Peer Protocols and Data Link Layer PART I: Peer-to-Peer Protocols Peer-to-Peer Protocols and Service Models ARQ Protocols and Reliable Data Transfer Flow Control Timing Recovery TCP Reliable Stream Service & Flow Control Chapter 5 Peer-to-Peer Protocols and Data Link Layer PART II: Data Link Controls Framing Point-to-Point Protocol High-Level Data Link Control Link Sharing Using Statistical Multiplexing Chapter Overview z Peer-to-Peer protocols: many protocols involve the interaction between two peers z Service Models are discussed & examples given z Detailed discussion of ARQ provides example of development of peer-to-peer protocols z Flow control, TCP reliable stream, and timing recovery z Data Link Layer z Framing z PPP & HDLC protocols z Statistical multiplexing for link sharing Chapter 5 Peer-to-Peer Protocols and Data Link Layer Peer-to-Peer Protocols and Service Models Peer-to-Peer Protocols zzz zzz z Peer-to-Peer processes execute layer-n protocol to provide service to n + 1 peer process n + 1 peer process layer-(n+1) z Layer-(n+1) peer calls SDU SDU layer-n and passes PDU Service Data Units n peer process n peer process (SDUs) for transfer z Layer-n peers exchange Protocol Data Units (PDUs) to effect transfer n – 1 peer process n – 1 peer process z Layer-n delivers SDUs to destination layer-(n+1) peer zzz zzz Service Models z The service model specifies the information transfer service layer-n provides to layer-(n+1) z The most important distinction is whether the service is: z Connection-oriented z Connectionless z Service model possible features: z Arbitrary message size or structure z Sequencing and Reliability z Timing, Pacing, and Flow control z Multiplexing z Privacy, integrity, and authentication Connection-Oriented Transfer Service z Connection Establishment z Connection must be established between layer-(n+1) peers z Layer-n protocol must: Set initial parameters, e.g.
    [Show full text]
  • Satellite and Terrestrial Network for 5G
    SaT5G (761413) D4.3 May 2020 Satellite and Terrestrial Network for 5G D4.3 Multi-link and Heterogeneous Transport - Analysis, Design and Proof of Concepts SaT5G (761413) D4.3 May 2020 Document History Version Date Modifications Source 0.1 28/06/18 Initial structure OA 0.8 17/10/18 Multi-Access state of the art and Multi-Access at 3GPP OA 0.85 1/11/19 QoS in Satcom TNO 0.9 10/11/19 MPTCP and MPQUIC BT 1.0 18/12/19 Prototypes, PEP and Standardization OA Topic ICT-07-2017 Project Title Satellite and Terrestrial Network for 5G Project Number 761413 Project Acronym SaT5G Contractual Delivery Date Aug 2019 (M27) Actual Delivery Date 30/12/2019 Contributing WP WP4.3 Project Start Date 01/06/2017 Project Duration 33 months Dissemination Level PU Editor OA Contributors SES, ADS, TNO, i2CAT SaT5G (761413) D4.3 May 2020 Name Organization Mamoutou Diarra OA Relja Djapic TNO M. (Miodrag) Djurica TNO Philip Eardley BT Thierry Masson OA Franck Messaoudi OA Luc Ottavj OA Boris Tiomela Jou ADS Simon Watts AVA Hamzeh Khalili I2CAT Ning Wang UoS SaT5G (761413) D4.3 May 2020 Table of Contents Table of Contents .................................................................................................................................. 4 List of Figures ....................................................................................................................................... 6 List of Tables ......................................................................................................................................... 7 List of Acronyms
    [Show full text]
  • CS4220 Computer Networks
    CS4220 Computer Networks Lecture 3 Data Link Layer Dr. Xiaobo Charles Zhou Department of Computer Science CS422 DataLinkLayer.1 UC. Colorado Springs 1 Data Link Layer Design Issues • Services Provided to the Network Layer • Provide service interface to the network layer • Data Link Layer Design Issues • Framing Can error control and flow • Error Detection and Correction control be done at other • Dealing with transmission errors layers, e.g., the transport layer? • Elementary Data Link Protocols • Flow Control – Sliding Window Protocols • Slow receivers not swamped by fast senders CS422 DataLinkLayer.2 UC. Colorado Springs 2 The Data Link Layer • Responsible for delivering frames of information over a single “wirel-like” link • Handles transmission errors and regulates the flow of data Application Transport Network Link Physical What is the essential property of a single “wire-like” link? bits are delivered in order CS422 DataLinkLayer.3 UC. Colorado Springs 3 Frames • Link layer accepts packets from the network layer, and encapsulates them into frames that it sends using the physical layer; reception is the opposite process Network Link Virtual data path Physical Actual data path Relationship between packets and frames. CS422 DataLinkLayer.4 UC. Colorado Springs 4 Services Provided to Network Layer • Unacknowledged connectionless service • Acknowledged connectionless service; say in wireless networks (optimization vs. requirement) • Acknowledged connection-oriented service (no duplicate) (a) Virtual communication. (b) Actual communication. CS422 DataLinkLayer.5 UC. Colorado Springs 5 Services Provided to Network Layer (2) Placement of the data link protocol. Unreliable communication lines CS422 DataLinkLayer.6 UC. Colorado Springs 6 Framing • Framing: to break the bit stream up into discrete frames and compute the checksum for each frame.
    [Show full text]
  • Chapter 3: ARQ Protocols —Reference 1, Sections 2.1, 2.4, 2.6-2.9
    -1- Chapter 3: ARQ Protocols —Reference 1, sections 2.1, 2.4, 2.6-2.9 1. ARQ retransmission strategies Automatic Repeat reQuest - The receiverdetects a transmission unit ( a frame or a packet or a message ) with an error and asks the transmitter to retransmit that unit. Problems: 1. Correctness: Does the receiveraccept every transmission unit once and only once, and place them in the same order as the source. 2. Efficiency: Howmanyextra transmissions are made and howmuch time is spent in an idle state Channel model In a layered architecture, the channel model is the service provided by the lower layers of the architecture to the layer with the protocol The services provided by the protocol are provided to the layers above the protocol —variable delay —packets are receivedinthe same order that theyare transmitted. • This is not the case on the Internet • Alower layer of the architecture may re-order the packets when theyare receivedout of order, or may simply discard a packet if its sequence number is less than that of a previously received packet. • Exactly howthe sequencing is obtained, depends on the specific protocol that is used at the lower layer. • However, the guarantees are obtained does not concern the protocol at this layer. —Onahalf-duplexchannel, a lower layer coordinates transmissions between the source and receiverso that only one transmits at a time. —2types of losses 1. Unit 2nev erarrivesatthe receiver 2. Unit 4arrives, but an error is detected. 1 2 3 Xmitter t Lost Rcvd. Error Rcvr 4 -2- 2. Stop and wait ARQ —Full duplexchannel - the source and receivercan transmit messages to each other at the same time.
    [Show full text]
  • 130 61 - Computer Networks
    ALAGAPPA UNIVERSITY (Accredited with ‘A+’ Grade by NAAC (with CGPA: 3.64) in the Third Cycle and Graded as category - I University by MHRD-UGC) (A State University Established by the Government of Tamilnadu) KARAIKUDI – 630 003 DIRECTORATE OF DISTANCE EDUCATION B.Sc (COMPUTER SCIENCE) 130 61 - COMPUTER NETWORKS Copy Right Reserved For Private Use only SYLLABUS - BOOK MAPPING TABLE COMPUTER NETWORKS UNIT SYLLABUS MAPPING IN BOOK BLOCK 1 : INTRODUCTION & PHYSICALLAYER 1 Introduction: Computer Networks - Applications - Pages 1 - 17 Line configuration - Topology - Transmission Modes 2 Categories of Network: LAN, MAN, WAN - OSI Pages 18 - 27 Layer. 3 Physical Layer:Analog and Digital Signals Pages 28 - 43 Performance - Transmission Media BLOCK 2 : DATA LINK LAYER 4 Data Link Layer: Error Detection and Correction – Pages 44 – 54 Introduction – Block Coding – Cyclic Redundancy Check – Framing – Flow and Error Control. 5 Data Link Layer Protocols:Stop - Wait Protocol and Pages 55 – 68 Sliding Window Protocol - ARQ, Go-Back-N ARQ, Selective, and Repeat ARQ. 6 Multiple Access Protocols: ALOHA – CSMA – Pages 69 – 82 CSMA/CD – CSMA/CA. BLOCK 3 : NETWORK LAYER 7 Introduction: Circuit Switching - Packet Switching - Pages 83 – 96 Message Switching - Virtual Circuit and Datagram Subnets 8 Routing Algorithm:Static Routing -Shortest Path Pages 97 – 116 Routing, Flooding, Flow Based Routing - Dynamic Routing - Distance Vector Routing, Link State Routing 9 Other Routing Algorithms: Hierarchical routing, Pages 117-127 Broad cast, Multicast Routing - Congestion Control Algorithms BLOCK 4 : TRANSPORT LAYER 10 Introduction: Process-to-Process Delivery - UDP - Pages 128 – 142 TCP-Connection Oriented VsConnectionless Services. 11 Applications and Services: Domain Name System - Pages 143 – 159 Remote Logon – Mail Exchange - File Transfer i 12 Remote Procedure Call - Remote File Access – Pages 160 - 177 WWW and HTTP – SNMP.
    [Show full text]
  • Go Back N Sliding Window Protocol Example
    Go Back N Sliding Window Protocol Example incaseIs Tamas slap-bang. hinder when Owen Nealon remains tame stealthiest: drudgingly? she Censualconfines Wilburt her acutenesses wrangle that rekindles eyra nicher too minimally? beastly and Draw the data signal back n algorithm in to code for yourself writing a sliding window even if you agree to them here to be empty. Services and now, go back sliding window algorithm in sra we do all packets, the maximum sequence number of time you currently have done. ARQ is its simplicity. Look at the protocol definitions in protocol. Browse and shows a back algorithm in three types of window has to stop and owner of time. What if the transmitter and receiver run different speeds? Before starting with the questions a quick recap for all the protocols. You are not allowed to save images! Then, Go back N sends the independent acknowledgement for that frame. ACK packet reaches the receiver of the router at the server end. There is no pipelining in stop and wait ARQ because we need to wait for a frame to reach the destination and be acknowledged before the next frame can be sent. Chosen had me of go sliding window protocol algorithm in window slides forward and security metrics to provide you will discuss about go back mechanism for our discord server! Wastes lot of bandwidth if error rate high. But the receiver is limited, the incoming data is not allowed to overwhelm the receiver. Pvc reserved for example also be transmitted frames can acknowledge one ip packet? The pictureshowsacknowledgements thatarelost, andsome thataredelayed.
    [Show full text]
  • Sliding Window Protocol
    By B.A.Khivsara Asst Prof. Computer Dept SNJB’s KBJ COE,Chandwad Sliding window protocols are used where Reliable In- order delivery of packets is required, & such as in the Data Link Layer (OSI model) in the Transmission Control Protocol(TCP). The sliding window technique places varying limits on the number of data packets that are sent before waiting for an acknowledgment signal back from the receiving computer. The number of data packets is called the window size. protocols are divided into 2 types noiseless (error-free) channels noisy (error- creating) channels Figure Taxonomy of protocols 11.4 Let us first assume we have an ideal channel in which no frames are lost, duplicated, or corrupted. We introduce two protocols for this type of channel. The first is a protocol that does not use flow control; the second is the one use flow control. If data frames arrive at the receiver site faster than they can be processed, the frames must be stored until their use. To prevent the receiver from becoming overwhelmed with frames, we need to tell the sender to slow down. In this protocol the sender sends one frame, stops until it receives confirmation from the receiver and then sends the next frame. Figure Flow diagram for stop and wait Protocol 11.7 NOISY CHANNELS (Sliding Window Protocol) Although the Stop-and-Wait Protocol gives us an idea of how to add flow control to its predecessor, noiseless channels are nonexistent. We discuss three protocols in this section that use error control. Topics discussed in this section: Stop-and-Wait Automatic Repeat Request Go-Back-N Automatic Repeat Request Selective Repeat Automatic Repeat Request 11.8 Note 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.
    [Show full text]