Unit 4 Multiplexing, Framing, and Some Solutions

Total Page:16

File Type:pdf, Size:1020Kb

Unit 4 Multiplexing, Framing, and Some Solutions Introduction to Communication Networks Spring 2007 Unit 4 Multiplexing, Framing, and some solutions... ©EECS 122 SPRING 2007 Acknowledgements – slides comming from: • Data and Computer Communication by Wiliam Stallings (our supplementary textbook). • Data Communications and Networking by B. Forouzan, Mc Graw Hill, 2004 ( a very nice-to-read book!) • Some figures have been used form the earlier issues of the EECS 122 tought by Prof Jean Walrand. • Introduction to Telephones & Telephone Systems by A. Michael Noll, Artech House, 1986 • Megabit Data Communication, John T. Powers, Henry H. Stair II, Prentice Hall • Digital Telephony by J. Bellamy: “”, J. Wiley & Sons, 2rd edition, 2000 Prof. Adam Wolisz 2of 63 MULTIPLEXING Prof. Adam Wolisz 3of 63 Multiplexing • General Problem: Several - n- different channels (voice, TV- channels) should be supported between a pair of locations. We would like to avoid usage of n physical links (cables). • Looking at the features of media you will easily see that the supported bandwidth exceeds by far the bandwidth needed for each channel... Prof. Adam Wolisz 4of 63 Variants of multiplexing • The dimensions of multiplexing – time (t) – frequency (f) – code (c) – space (si) – sometimes… • Care for separation: guard spaces, code orthognonality • Multiplexing can be – Synchronous (constant allocation) – Statistical (variable allocation) Prof. Adam Wolisz 5of 63 Frequency Multiplex • Separation of the whole spectrum into smaller frequency bands • A channel gets a certain band of the spectrum (in the synchronous case – for the whole time!) • Note: guard zones in frequency are needed!! Special case: Wave division Mux Prof. Adam Wolisz 6of 63 Schema for FDM [Forouzan] mod Prof. Adam Wolisz 7of 63 FDM of Three Voiceband Signals Prof. Adam Wolisz 8of 63 Example - Community Antenna TV (CATV) Currently used systems require about 6MHz /TV Channel Prof. Adam Wolisz 9of 63 Time Multiplex • The whole bandwidth is used all the time, but – alternatively – by different channels! Prof. Adam Wolisz 10 of 63 Time Multiplex: Interleaving of data segments [Forouzan] Prof. Adam Wolisz 11 of 63 Time and Frequency Multiplex [Schiller] • Combination of both methods • A channel gets a certain frequency band for a certain amount of time • Example GSM cellular telephony: FDM with TDD (8 bi- directional channels per frequency band) is used... k1 k2 k3 k4 k5 k6 c f t 2.18.1 Prof. Adam Wolisz 12 of 63 Time Division Duplex (TDD) and FDD Similarly a Frequency Division Duplex - FDD with two frequency Channels: for up-link and down-link respectively, can be defined Prof. Adam Wolisz 13 of 63 Bursty Data • Burstiness of data – In many data communication applications, data occur in bursts separated by idle periods – This type of data can often be transmitted more economically by statistical (or asynchronous) multiplexing... Prof. Adam Wolisz 14 of 63 Synchronous vs. Statistical TDM Note: Data slots must be addressed! Prof. Adam Wolisz 15 of 63 Statistical Multiplexing Gain [mod.from N.Mc Keown, Stanford] Comment: Synchronous Multiplexing would use 2C bits/s – statistical uses R<2C. But: how to define R? – The queue helps „smooth“ the load but there might be losses !!! A+B Rate 2C R < 2C A C R B time Statistical multiplexing gain = 2C/R Other definitions of SMG: The ratio of rates that give rise to a particular queue occupancy, or particular loss probability. Prof. Adam Wolisz 16 of 63 Example of Statistical Multiplexer Performance Prof. Adam Wolisz 17 of 63 Probability of Overflow and Buffer Size ρ- is the ratio of the offered load to the nominal service rate of the system – see Queuing (later) Prof. Adam Wolisz 18 of 63 FHSS (Frequency Hopping Spread Spectrum) I • Discrete changes of carrier frequency – sequence of frequency changes determined via pseudo random number sequence • Two versions – Fast Hopping: several frequencies per user bit – Slow Hopping: several user bits per frequency • Advantages – ROBUSTNESS: impact of frequency selective fading and interference limited to short period ! 2.32.1 Prof. Adam Wolisz 19 of 63 FHSS : Schema of the operation Fast hopping Slow hopping Prof. Adam Wolisz 20 of 63 FHSS – System overview narrowband spread signal transmit user data signal modulator modulator frequency hopping synthesizer sequence transmitter narrowband received signal signal data demodulator demodulator hopping frequency sequence synthesizer receiver 2.34.1 Prof. Adam Wolisz 21 of 63 CDMA: Code Division Multiple Access A Channel: a unique code in the same spectrum at the same time Prof. Adam Wolisz 22 of 63 Space division multiplexing...wireless... • Assume a sectorized antenna • Transmisison/receive in one of the sectors does not limit the usage of other sectors... Prof. Adam Wolisz 23 of 63 FRAMING Prof. Adam Wolisz 24 of 63 Framing • WHY: – The physical layer supports bit-synchronization. – Data units bigger than a single bit must be recognized... • HOW: – Time gaps (not good - might be squeezed within the physical layer), – Physical signaling - the physical layer has to support some control symbols, besides of a 0 and a 1, say a J and K. Example: the Manchester extension of the IEEE 802.5 - token ring. – Field Lenght marker at the beginnig of the field: Whole notion of unit lost if this lenght marker would get corrupted! – Specific symbols: Character oriented, bit oriented variants. – Clock based Prof. Adam Wolisz 25 of 63 Framing - delimiting symbols • Delimiting characters in character based transmission, i.e. the case when the transmitted information is composed of symbols - c.f.the ASCII code table. • SYN SYN - used for the synchronization • SOH......STX.......ETX the framing sequence for the header and for the text. – Transmission of binary information: • DLE STX .......binary information........ DLE ETX – What about a DLE inside the binary information?? • input binary information: ...................... DLE......... • transmitted binary information: .... DLE DLE......... • extracting the information: ........... DLE ................ – A) This scheme is closely tied to an 8 bit character representation. – B) A single error can cause a misinterpretation. Prof. Adam Wolisz 26 of 63 Framing - delimiting symbols (2) Example DLE STX A DLE BDLEETX (a) DLE STX A DLE DLE B DLE ETX (b) Stuffed DLE (c) DLE STX A DLE BDLEETX (a) Data sent by the network layer. (b) Data after being character stuffed by the data link layer. (c) Data passed to the network layer on the receiving side. Prof. Adam Wolisz 27 of 63 Bit oriented transmission-delimiting flag • Delimiting flags in bit oriented transmission, i.e. the case when the transmitted information is represented as a string of bits (the concept of octets is sometimes used to support the bit manipulation). – The usual flag pattern: 01111110 • Transmission transparency is assured via bit stuffing: – The transmitter always stuffs a 0 after 11111 – The receiver removes a 0 following 11111 • User data 01111110 are transmitted as 011111010 Combinations of solutions discussed above are frequently used to increase the power of framing - e.g. delimiting flags together with byte (symbol) count. See additional reading after bit error unit! Prof. Adam Wolisz 28 of 63 Bit-oriented Transmission The packet framed by two special bit patterns called flags. Bit stuffing is used to prevent a flag from occurring in the middle of a packet. The bit-stuffing procedure is illustrated in (b): a bit 0 is inserted after each pattern 011111 that appears in the packet. The reverse procedure (bit destuffing) is performed at the receiver to restore the original packet. Prof. Adam Wolisz 29 of 63 Clock based Idea: to have a sequence of markers in predefined positions – here the sequence 101 in proper distance all the elements are assumed to have equal length! Problem: This sequence, with the proper spacing, MIGHT appear just by chance in the content!!! Solution: Look several times – the random appearance will not be repeatable over numerous frame series! Prof. Adam Wolisz 30 of 63 Examples of transmission systems Prof. Adam Wolisz 31 of 63 Phone Backbone - FDM Carrier Standard – OLD! [Forouzan] Prof. Adam Wolisz 32 of 63 FDM Carrier Standards - OLD – some numbers Prof. Adam Wolisz 33 of 63 American Digital Hierarchy Each channel carries data (voice) digitized at a rate of 8000 samples per second with 8 bit per sample. A frame contains 24 channels plus one framing bit per frame. Thus, the required transmission rate for DS-1 is 8000 x (24 x 8 + 1) bits per second = 1.544 Mbit/s. Prof. Adam Wolisz 34 of 63 American Digital Hierarchy –synchronization [bellamy] • T1/D4 Superframe and D4 Channel Slots. – A super frame combines 12 frames of 193 bits each. – The framing bits of these frames produce the T1/D4 superframe pattern of 100011011100 Prof. Adam Wolisz 35 of 63 Extended Superframe Format Framing (1) • Extension of the super frame from 12 repetitions to 24 repetitions. • Framing bit positions take new functions and meanings (24 bits). • Framing (6 bits) • Error Checking (6 bits) • Maintenance Communications (12 bits) 193rd Bit 193rd Bit 125 µs 123456789101112131415161718192021222324 Bipolar format 10101101Binary code 5,2 µs Basic North American PCM framing and signaling format. Prof. Adam Wolisz 36 of 63 Some specific ways of using it... [Stallings] Prof. Adam Wolisz 37 of 63 American TDM Carrier Standard [Forouzan] Prof. Adam Wolisz 38 of 63 TDM Carrier Standards North American and International TDM Carrier Standards Prof. Adam Wolisz 39 of 63 Just for info – the International Frame... Prof. Adam Wolisz 40 of 63 Trunks Prof. Adam Wolisz 41 of 63 Mhmm... Not quite unified... Prof. Adam Wolisz 42 of 63 Instability of the timing.. • Cyclic changes of the data rate of sending • Systematic difference in timing between the sender and receiver. • What can we do? – cyclic- or fluctuating differences removed by elastic buffer... – Systematic difference has to be dealt with • Systematic differences. How? – Plesiochronous operation (T-hierarchy) – Synchronous operation (SONET) Prof. Adam Wolisz 43 of 63 Synchronization - Definition of terms: – Single discrete signal may be either • Isochronous : Constant frequency of signal changes (e.g.
Recommended publications
  • Application Protocol Data Unit Meaning
    Application Protocol Data Unit Meaning Oracular and self Walter ponces her prunelle amity enshrined and clubbings jauntily. Uniformed and flattering Wait often uniting some instinct up-country or allows injuriously. Pixilated and trichitic Stanleigh always strum hurtlessly and unstepping his extensity. NXP SE05x T1 Over I2C Specification NXP Semiconductors. The session layer provides the mechanism for opening closing and managing a session between end-user application processes ie a semi-permanent dialogue. Uses MAC addresses to connect devices and define permissions to leather and commit data 1. What are Layer 7 in networking? What eating the application protocols? Application Level Protocols Department of Computer Science. The present invention pertains to the convert of Protocol Data Unit PDU session. Network protocols often stay to transport large chunks of physician which are layer in. The term packet denotes an information unit whose box and tranquil is remote network-layer entity. What is application level security? What does APDU stand or Hop sound to rot the meaning of APDU The Acronym AbbreviationSlang APDU means application-layer protocol data system by. In the context of smart cards an application protocol data unit APDU is the communication unit or a bin card reader and a smart all The structure of the APDU is defined by ISOIEC 716-4 Organization. Application level security is also known target end-to-end security or message level security. PDU Protocol Data Unit Definition TechTerms. TCPIP vs OSI What's the Difference Between his Two Models. The OSI Model Cengage. As an APDU Application Protocol Data Unit which omit the communication unit advance a.
    [Show full text]
  • Spread Spectrum and Wi-Fi Basics Syed Masud Mahmud, Ph.D
    Spread Spectrum and Wi-Fi Basics Syed Masud Mahmud, Ph.D. Electrical and Computer Engineering Dept. Wayne State University Detroit MI 48202 Spread Spectrum and Wi-Fi Basics by Syed M. Mahmud 1 Spread Spectrum Spread Spectrum techniques are used to deliberately spread the frequency domain of a signal from its narrow band domain. These techniques are used for a variety of reasons such as: establishment of secure communications, increasing resistance to natural interference and jamming Spread Spectrum and Wi-Fi Basics by Syed M. Mahmud 2 Spread Spectrum Techniques Frequency Hopping Spread Spectrum (FHSS) Direct -Sequence Spread Spectrum (DSSS) Orthogonal Frequency-Division Multiplexing (OFDM) Spread Spectrum and Wi-Fi Basics by Syed M. Mahmud 3 The FHSS Technology FHSS is a method of transmitting signals by rapidly switching channels, using a pseudorandom sequence known to both the transmitter and receiver. FHSS offers three main advantages over a fixed- frequency transmission: Resistant to narrowband interference. Difficult to intercept. An eavesdropper would only be able to intercept the transmission if they knew the pseudorandom sequence. Can share a frequency band with many types of conventional transmissions with minimal interference. Spread Spectrum and Wi-Fi Basics by Syed M. Mahmud 4 The FHSS Technology If the hop sequence of two transmitters are different and never transmit the same frequency at the same time, then there will be no interference among them. A hopping code determines the frequencies the radio will transmit and in which order. A set of hopping codes that never use the same frequencies at the same time are considered orthogonal .
    [Show full text]
  • F. Circuit Switching
    CSE 3461: Introduction to Computer Networking and Internet Technologies Circuit Switching Presentation F Study: 10.1, 10.2, 8 .1, 8.2 (without SONET/SDH), 8.4 10-02-2012 A Closer Look At Network Structure: • network edge: applications and hosts • network core: —routers —network of networks • access networks, physical media: communication links d. xuan 2 1 The Network Core • mesh of interconnected routers • the fundamental question: how is data transferred through net? —circuit switching: dedicated circuit per call: telephone net —packet-switching: data sent thru net in discrete “chunks” d. xuan 3 Network Layer Functions • transport packet from sending to receiving hosts application transport • network layer protocols in network data link network physical every host, router network data link network data link physical data link three important functions: physical physical network data link • path determination: route physical network data link taken by packets from source physical to dest. Routing algorithms network network data link • switching: move packets from data link physical physical router’s input to appropriate network data link application router output physical transport network data link • call setup: some network physical architectures require router call setup along path before data flows d. xuan 4 2 Network Core: Circuit Switching End-end resources reserved for “call” • link bandwidth, switch capacity • dedicated resources: no sharing • circuit-like (guaranteed) performance • call setup required d. xuan 5 Circuit Switching • Dedicated communication path between two stations • Three phases — Establish (set up connection) — Data Transfer — Disconnect • Must have switching capacity and channel capacity to establish connection • Must have intelligence to work out routing • Inefficient — Channel capacity dedicated for duration of connection — If no data, capacity wasted • Set up (connection) takes time • Once connected, transfer is transparent • Developed for voice traffic (phone) g.
    [Show full text]
  • Examining Ambiguities in the Automatic Packet Reporting System
    Examining Ambiguities in the Automatic Packet Reporting System A Thesis Presented to the Faculty of California Polytechnic State University San Luis Obispo In Partial Fulfillment of the Requirements for the Degree Master of Science in Electrical Engineering by Kenneth W. Finnegan December 2014 © 2014 Kenneth W. Finnegan ALL RIGHTS RESERVED ii COMMITTEE MEMBERSHIP TITLE: Examining Ambiguities in the Automatic Packet Reporting System AUTHOR: Kenneth W. Finnegan DATE SUBMITTED: December 2014 REVISION: 1.2 COMMITTEE CHAIR: Bridget Benson, Ph.D. Assistant Professor, Electrical Engineering COMMITTEE MEMBER: John Bellardo, Ph.D. Associate Professor, Computer Science COMMITTEE MEMBER: Dennis Derickson, Ph.D. Department Chair, Electrical Engineering iii ABSTRACT Examining Ambiguities in the Automatic Packet Reporting System Kenneth W. Finnegan The Automatic Packet Reporting System (APRS) is an amateur radio packet network that has evolved over the last several decades in tandem with, and then arguably beyond, the lifetime of other VHF/UHF amateur packet networks, to the point where it is one of very few packet networks left on the amateur VHF/UHF bands. This is proving to be problematic due to the loss of institutional knowledge as older amateur radio operators who designed and built APRS and other AX.25-based packet networks abandon the hobby or pass away. The purpose of this document is to collect and curate a sufficient body of knowledge to ensure the continued usefulness of the APRS network, and re-examining the engineering decisions made during the network's evolution to look for possible improvements and identify deficiencies in documentation of the existing network. iv TABLE OF CONTENTS List of Figures vii 1 Preface 1 2 Introduction 3 2.1 History of APRS .
    [Show full text]
  • Protocol Data Unit for Application Layer
    Protocol Data Unit For Application Layer Averse Riccardo still mumms: gemmiferous and nickelous Matthieu budges quite holus-bolus but blurs her excogitation discernibly. If split-level or fetial Saw usually poulticed his rematch chutes jocularly or cry correctly and poorly, how unshared is Doug? Epiblastic and unexaggerated Hewe never repones his florescences! What is peer to peer process in osi model? What can you do with Packet Tracer? RARP: Reverse Address Resolution Protocol. Within your computer, optic, you may need a different type of modem. The SYN bit is used to acknowledge packet arrival. The PCI classes, Presentation, Data link and Physical layer. The original version of the model defined seven layers. PDUs carried in the erased PHY packets are also lost. Ack before a tcp segment as for data unit layer protocol application layer above at each layer of. You can unsubscribe at any time. The responder is still in the CLOSE_WAIT state, until the are! Making statements based on opinion; back them up with references or personal experience. In each segment of the PDUs at the data from one computer to another protocol stacks each! The point at which the services of an OSI layer are made available to the next higher layer. Confused by the OSI Model? ASE has the same IP address as the router to which it is connected. Each of these environments builds upon and uses the services provided by the environment below it to accomplish specific tasks. This process continues until the packet reaches the physical layer. ASE on a circuit and back.
    [Show full text]
  • MIMO Technology in Wifi Systems
    MIMO in WiFi Systems Rohit U. Nabar Smart Antenna Workshop Aug. 1, 2014 WiFi • Local area wireless technology that allows communication with the internet using 2.4 GHz or 5 GHz radio waves per IEEE 802.11 • Proliferation in the number of devices that use WiFi today: smartphones, tablets, digital cameras, video-game consoles, TVs, etc • Devices connect to the internet via wireless network access point (AP) Advantages • Allows convenient setup of local area networks without cabling – rapid network connection and expansion • Deployed in unlicensed spectrum – no regulatory approval required for individual deployment • Significant competition between vendors has driven costs lower • WiFi governed by a set of global standards (IEEE 802.11) – hardware compatible across geographical regions WiFi IC Shipment Growth 1.25x 15x Cumulative WiFi Devices in Use Data by Local Access The IEEE 802.11 Standards Family Standard Year Ratified Frequency Modulation Channel Max. Data Band Bandwidth Rate 802.11b 1999 2.4 GHz DSSS 22MHz 11 Mbps 802.11a 1999 5 GHz OFDM 20 MHz 54 Mbps 802.11g 2003 2.4 GHz OFDM 20 MHz 54 Mbps 802.11n 2009 2.4/5 GHz MIMO- 20,40 MHz 600 Mbps OFDM 802.11ac 2013 5 GHz MIMO- 20, 40, 80, 6.93 Gbps OFDM 160 MHz 802.11a/ac PHY Comparison 802.11a 802.11ac Modulation OFDM MIMO-OFDM Subcarrier spacing 312.5 KHz 312.5 KHz Symbol Duration 4 us (800 ns guard interval) 3.6 us (400 ns guard interval) FFT size 64 64(20 MHz)/512 (160 MHz) FEC BCC BCC or LDPC Coding rates 1/2, 2/3, 3/4 1/2, 2/3, 3/4, 5/6 QAM BPSK, QPSK, 16-,64-QAM BPSK, QPSK, 16-,64-,256- QAM Factors Driving the Data Rate Increase 6.93 Gbps QAM 802.11ac (1.3x) FEC rate (1.1x) MIMO (8x) 802.11a Bandwidth (8x) 54 Mbps 802.11 Medium Access Control (MAC) Contention MEDIUM BUSY DIFS PACKET Window • Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) • A wireless node that wants to transmit performs the following sequence 1.
    [Show full text]
  • Multiple Access Techniques for 4G Mobile Wireless Networks Dr Rupesh Singh, Associate Professor & HOD ECE, HMRITM, New Delhi
    International Journal of Engineering Research and Development e-ISSN: 2278-067X, p-ISSN: 2278-800X, www.ijerd.com Volume 5, Issue 11 (February 2013), PP. 86-94 Multiple Access Techniques For 4G Mobile Wireless Networks Dr Rupesh Singh, Associate Professor & HOD ECE, HMRITM, New Delhi Abstract:- A number of new technologies are being integrated by the telecommunications industry as it prepares for the next generation mobile services. One of the key changes incorporated in the multiple channel access techniques is the choice of Orthogonal Frequency Division Multiple Access (OFDMA) for the air interface. This paper presents a survey of various multiple channel access schemes for 4G networks and explains the importance of these schemes for the improvement of spectral efficiencies of digital radio links. The paper also discusses about the use of Multiple Input/Multiple Output (MIMO) techniques to improve signal reception and to combat the effects of multipath fading. A comparative performance analysis of different multiple access schemes such as Time Division Multiple Access (TDMA), FDMA, Code Division Multiple Access (CDMA) & Orthogonal Frequency Division Multiple Access (OFDMA) is made vis-à-vis design parameters to highlight the advantages and limitations of these schemes. Finally simulation results of implementing some access schemes in MATLAB are provided. I. INTRODUCTION 4G (also known as Beyond 3G), an abbreviation of Fourth-Generation, is used for describing the next complete evolution in wireless communications. A 4G system will be a complete replacement for current networks and will be able to provide a comprehensive and secure IP solution. Here, voice, data, and streamed multimedia can be given to users on an "Anytime, Anywhere" basis, and at much higher data rates than the previous generations [1], [2], [3].
    [Show full text]
  • Show Me the Data Protocol and Spectrum Analysis Basics for 802.11 Wireless LAN
    Show Me The Data Protocol and Spectrum Analysis Basics for 802.11 Wireless LAN Robert Bartz [email protected] @eightotwo Presenter - Robert Bartz • Eight-O-Two Technology Solutions, Denver Colorado • Engineer, Consultant, Educator, Technical Author, Speaker, CWNE • BS Degree, Industrial Technology, California State University Long Beach, College of Engineering • Former Aerospace Test Engineer • 27 Years Technical Training With the Last 18 Years Specializing in Wireless Networking • Author - CWTS Official Study Guide by Sybex – 1st and 2nd Editions • Author - Mobile Computing Deployment and Management: Real World Skills for CompTIA Mobility+ Certification and Beyond by Sybex • Author - CWTS, CWS, and CWT Complete Study Guide by Sybex • E-mail: [email protected] Twitter: @eightotwo Agenda • Common Troubleshooting Methodology • The OSI Model (A Quick Review) • OSI Model – The Wireless Element • The IEEE 802.11 Frame • Common IEEE 802.11 Frame Exchanges • Wireless LAN Troubleshooting Tools for Layer 2 (Data Link) • Protocol Analysis • Wireless LAN Troubleshooting Tools for Layer 1 (Physical) • Spectrum Analysis This is a no lollygagging session lol·ly·gag ˈlälēˌɡaɡ/ verbNorth Americaninformal gerund or present participle: lollygagging spend time aimlessly; idle. "he sends her to Arizona every January to lollygag in the sun" Common Troubleshooting Methodology Steps in a common troubleshooting methodology 1. Identify the problem 2. Determine the scale of the problem 3. Possible causes 4. Isolate the problem 5. Resolution or escalation
    [Show full text]
  • Which Is NOT a PDU(Protocol Data Unit) ? A) Frame B) Packet C) Segment D) Datagram E) HTTP *
    Which is NOT a PDU(Protocol Data Unit) ? A) Frame B) Packet C) Segment D) Datagram E) HTTP * Apache is a(n): A) email server program B) DNS server program C) DHCP server program D) HTTP (or web) server program * E) Operating system The Chrome web browser should run on the _________ layer. A) application * B) transport C) internet D) data link E) physical According to the encapsulation and de-encapsulation process between standard layers, the data field of a frame most likely includes a(n) : A) IP packet * B) sending station's MAC address C) receiving station's MAC address D) TCP segment E) application PDU (protocol data unit) According to the encapsulation and de-encapsulation process between standard layers, the data field of a packet may include a(n) : A) UDP datagram B) TCP segment C) application PDU (protocol data unit) D) Ethernet frame E) UDP datagram or TCP segment* Establishing a logical connection(or handshaking) between two computers requires the exchange of __________ messages. A) 0 B) 1 C) 2 D) 3* E) 5 The real-life analogy of an IP packet is: A) the Jayne’s letter to Brian B) the airplane that delivers the Jayne’s letter C) the envelop that contains the Jayne’s letter * D) Jayne and Brian’s mailing addresses E) Jayne and Brian’s houses Standard details of network cables should be defined in the _____ layer A) application B) transport C) internet D) data link E) physical* Which of the following is NOT a layer in the hybrid TCP/IP-OSI architecture? A) physical B) session* C) internet D) data link E) transport Which correctly
    [Show full text]
  • Multiplexing and Sampling Theory
    Multiplexing and Sampling Theory THE ECONOMY OF MULTIPLEXING contact type determine its current carrying capacity. For instance, laboratory instrument relays typically switch Sampled-Data Systems up to 3A, while industrial applications use larger relays An ideal data acquisition system uses a single ADC for to switch higher currents, often 5 to 10A. each measurement channel. In this way, all data are captured in parallel and events in each channel can be Solid-state switches, on the other hand, are much faster compared in real time. But using a multiplexer, Figure than relays and can reach sampling rates of several MHz. 3.01, that switches among the inputs of multiple chan- However, these devices can’t handle inputs higher than nels and drives a single ADC can substantially reduce 25V, and they are not well suited for isolated applica- the cost of a system. This approach is used in so-called tions. Moreover, solid-state devices are typically limited sampled-data systems. The higher the sample rate, the to handling currents of only one mA or less. closer the system mimics the ideal data acquisition system. But only a few specialized data acquisition Another characteristic that varies between mechani- systems require sample rates of extraordinary speed. cal relays and solid-state switches is called ON resis- Most applications can cope with the more modest tance. An ideal mechanical switch or relay contact sample rates typically offered by mainstream data pair has zero ON resistance. But real devices such acquisition systems. as common reed-relay contacts are 0.010 W or less, a quality analog switch can be 10 to 100 W, and an Solid State Switches vs.
    [Show full text]
  • Session 5: Data Link Control
    Data Communications & Networks Session 4 – Main Theme Data Link Control Dr. Jean-Claude Franchitti New York University Computer Science Department Courant Institute of Mathematical Sciences Adapted from course textbook resources Computer Networking: A Top-Down Approach, 6/E Copyright 1996-2013 J.F. Kurose and K.W. Ross, All Rights Reserved 1 Agenda 1 Session Overview 2 Data Link Control 3 Summary and Conclusion 2 What is the class about? .Course description and syllabus: »http://www.nyu.edu/classes/jcf/csci-ga.2262-001/ »http://cs.nyu.edu/courses/Fall13/CSCI-GA.2262- 001/index.html .Textbooks: » Computer Networking: A Top-Down Approach (6th Edition) James F. Kurose, Keith W. Ross Addison Wesley ISBN-10: 0132856204, ISBN-13: 978-0132856201, 6th Edition (02/24/12) 3 Course Overview . Computer Networks and the Internet . Application Layer . Fundamental Data Structures: queues, ring buffers, finite state machines . Data Encoding and Transmission . Local Area Networks and Data Link Control . Wireless Communications . Packet Switching . OSI and Internet Protocol Architecture . Congestion Control and Flow Control Methods . Internet Protocols (IP, ARP, UDP, TCP) . Network (packet) Routing Algorithms (OSPF, Distance Vector) . IP Multicast . Sockets 4 Course Approach . Introduction to Basic Networking Concepts (Network Stack) . Origins of Naming, Addressing, and Routing (TCP, IP, DNS) . Physical Communication Layer . MAC Layer (Ethernet, Bridging) . Routing Protocols (Link State, Distance Vector) . Internet Routing (BGP, OSPF, Programmable Routers) . TCP Basics (Reliable/Unreliable) . Congestion Control . QoS, Fair Queuing, and Queuing Theory . Network Services – Multicast and Unicast . Extensions to Internet Architecture (NATs, IPv6, Proxies) . Network Hardware and Software (How to Build Networks, Routers) . Overlay Networks and Services (How to Implement Network Services) .
    [Show full text]
  • Wi-Fi Data Rates, Channels and Capacity
    WHITE PAPER Wi-Fi Data Rates, Channels and Capacity By Cees Links, GM of Qorvo Wireless Connectivity Business Unit Formerly CEO & Founder of GreenPeak Technologies Introduction Considerable confusion exists about the performance that Wi-Fi at 5 GHz and at 60 GHz (WiGig) actually deliver. The “Over the past 20 cause of this confusion stems mostly from the complexity of the interplay of the technical factors involved, as well as years, the IEEE the widely different Wi-Fi transmission environments – especially in indoor environments. Another reason is the 802.11 standard has not uncommon but facile assumption that faster is better. If you asked a road traffic expert whether faster meant provided increased better, he would tell you that faster driving means reduced road capacity. Data communications in a shared medium transmission speeds.” is not very different. Over the 20 years of its development, the IEEE 802.11 standard has provided for increasing levels of transmission speeds, but disappointing results in practical use have led to more emphasis on capacity. This paper attempts to clarify some of the complexities and to derive, given reasonable assumptions, what capacity consumers in dense residential settings can expect. December 2017 | Subject to change without notice. 1 of 8 www.qorvo.com WHITE PAPER: Wi-Fi Data Rates, Channels and Capacity IEEE 802.11ac and 802.11ax Transmission rates Marketing brochures usually give the maximum theoretically possible data rates that can only be realized in the lab under carefully controlled conditions. Table 1 lists the theoretical rates obtainable with the various protocol versions of the IEEE 802.11 standard.
    [Show full text]