Advantages and disadvantages

Size: px
Start display at page:

Download "Advantages and disadvantages"

Transcription

1 Advantages and disadvantages Advantages Disadvantages Asynchronous transmission Simple, doesn't require synchronization of both communication sides Cheap, timing is not as critical as for synchronous transmission, therefore hardware can be made cheaper Set-up is very fast, so well suited for applications where messages are generated at irregular intervals, for example data entry from the keyboard Large relative overhead, a high proportion of the transmitted bits are uniquely for control purposes and thus carry no useful information Synchronous transmission Lower overhead and thus, greater throughput Slightly more complex Hardware is more expensive

2 3.3 Data Transmission Modes The transmission of binary data across a link can be accomplished in either parallel or serial mode. In parallel mode, multiple bits are sent with each clock tick. In serial mode, 1 bit is sent with each clock tick. While there is one way to send parallel data, there are three subclasses of serial transmission: asynchronous, synchronous, and isochronous. Figure 3.3: Data transmission and modes Serial and Parallel Serial Transmission In serial transmission one bit follows another, so we need only one communication channel rather than n to transmit data between two communicating devices. The advantage of serial over parallel transmission is that with only one communication channel, serial transmission reduces cost of transmission over parallel by roughly a factor of n. Since communication within devices is parallel, conversion devices are required at the interface between the sender and the line (parallel-to-serial) and between the line and the receiver (serial-

3 to-parallel). Serial transmission occurs in one of three ways: asynchronous, synchronous, and isochronous. Parallel Transmission Binary data, consisting of 1 s and 0 s, may be organized into groups of n bits each. Computers produce and consume data in groups of bits much as we conceive of and use spoken language in the form of words rather than letters. By grouping, we can send data n bits at a time instead of 1. This is called parallel transmission. The mechanism for parallel transmission is a simple one: Use n wires to send n bits at one time. That way each bit has its own wire, and all n bits of one group can be transmitted with each clock tick from one device to another. The advantage of parallel transmission is speed. All else being equal, parallel transmission can increase the transfer speed by a factor on n over serial transmission. But there is a significant disadvantage: cost. Parallel transmission requires n communication lines just to transmit the data stream. Because this is expensive, parallel transmission is usually limited to short distances Simplex, Half duplex and Full duplex There are three modes of data transmission that correspond to the three types of circuits available. These are: a) Simplex b) Half-duplex c) Full-duplex Figure 3.4: Different Modes of Data Transmission Simplex

4 Simplex communications imply a simple method of communicating, which they are. In simplex communication mode, there is a one-way communication transmission. Television transmission is a good example of simplex communications. The main transmitter sends out a signal (broadcast), but it does not expect a reply as the receiving units cannot issue a reply back to the transmitter. A data collection terminal on a factory floor or a line printer (receive only). Another example of simplex communication is a keyboard attached to a computer because the keyboard can only send data to the computer. At first thought it might appear adequate for many types of application in which flow of information is unidirectional. However, in almost all data processing applications, communication in both directions is required. Even for a one-way flow of information from a terminal to computer, the system will be designed to allow the computer to signal the terminal that data has been received. Without this capability, the remote used might enter data and never know that it was not received by the other terminal. Hence, simplex circuits are seldom used because a return path is generally needed to send acknowledgement, control or error signals. Half-duplex In half-duplex mode, both units communicate over the same medium, but only one unit can send at a time. While one is in send mode, the other unit is in receiving mode. It is like two polite people talking to each other one talks, the other listens, but neither one talks at the same time. Thus, a half duplex line can alternately send and receive data. It requires two wires. This is the most common type of transmission for voice communications because only one person is supposed to speak at a time. It is also used to connect a terminal with a computer. The terminal might transmit data and then the computer responds with an acknowledgement. The transmission of data to and from a hard disk is also done in half duplex mode. Full duplex In a half-duplex system, the line must be turned around each time the direction is reversed. This involves a special switching circuit and requires a small amount of time (approximately 150 milliseconds). With high speed capabilities of the computer, this turn-around time is unacceptable in many instances. Also, some applications require simultaneous transmission in both directions. In such cases, a full-duplex system is used that allows information to flow simultaneously in both directions on the transmission path. Use of a full-duplex line improves efficiency as the line turnaround time required in a half-duplex arrangement is eliminated. It requires four wires Synchronous and Asynchronous transmission Synchronous Transmission In synchronous transmission, the bit stream is combined into longer frames, which may contain multiple bytes. Each byte, however, is introduced onto the transmission link without a gap between it and the next one. It is left to the receiver to separate the bit stream into bytes for decoding purpose. In other words, data are transmitted as an unbroken sting of 1s and 0s, and the receiver separates that string into the bytes, or characters, it needs to reconstruct the information. Without gaps and start and stop bits, there is no built-in mechanism to help the receiving device adjust its bits synchronization midstream. Timing becomes very important, therefore, because the accuracy of the received information is completely dependent on the ability of the receiving device to keep an accurate count of the bits as they come in.

5 The advantage of synchronous transmission is speed. With no extra bits or gaps to introduce at the sending end and remove at the receiving end, and, by extension, with fewer bits to move across the link, synchronous transmission is faster than asynchronous transmission of data from one computer to another. Byte synchronization is accomplished in the data link layer. Figure 3.5: Synchronous transmission Asynchronous Transmission Asynchronous transmission is so named because the timing of a signal is unimportant. Instead, information is received and translated by agreed upon patterns. As long as those patterns are followed, the receiving device can retrieve the information without regard to the rhythm in which it is sent. Patterns are based on grouping the bit stream into bytes. Each group, usually 8 bits, is sent along the link as a unit. The sending system handles each group independently, relaying it to the link whenever ready, without regard to t timer. Without synchronization, the receiver cannot use timing to predict when the next group will arrive. To alert the receiver to the arrival of an new group, therefore, an extra bit is added to the beginning of each byte. This bit, usually a 0, is called the start bit. To let the receiver know that the byte is finished, 1 or more additional bits are appended to the end of the byte. These bits, usually 1s, are called stop bits. By this method, each byte is increased in size to at least 10 bits, of which 8 bits is information and 2 bits or more are signals to the receiver. In addition, the transmission of each byte may then be followed by a gap of varying duration. This gap can be represented either by an idle channel or by a stream of additional stop bits. The start and stop bits and the gap alert the receiver to the beginning and end of the each byte and also it to synchronize with the data stream. This mechanism is called asynchronous because, at the byte level, the sender and receiver do not have to be synchronized. But within each byte, the receiver must still by synchronized with the incoming bit stream. That is, some synchronization is required, but only for the duration of a single byte. The receiving device resynchronizes at the onset of each new byte. When the receiver detects a start bit, it sets

6 a timer and begins counting bits as they come in. after n bits, the receiver looks for a stop bit. As soon as it detects the stop bit, it waits until it detects the next start bit. Figure 3.6: Asynchronous transmission Isochronous Transmission In real-time audio and video, in which uneven delays between frames are not acceptable, synchronous transmission fails. For example, TV images are broadcast at the rate of 30 images per second; they must be viewed at the same rate. If each image is send by using one or more frames, there should be no delays between frames. For this type of application, synchronization between characters is not enough; the entire stream of bits must be synchronized. The isochronous transmission guarantees that the data arrive at a fixed rate. Self Assessment Questions: State whether the following statements are True or False: 4. Serial transmission is costlier than parallel transmission. 5. In half duplex, transmission is done at a time from the sender and receiver. 6. In full duplex turn-around time is eliminated to the sender and the receiver. 7. In asynchronous transmission the bits are received by patterns 3.4 Switching A network is a set of connected devices. Whenever we have multiple devices, we have the problem of how to connect them to make one-to-one communication possible. One of the better solutions is switching. A switch is network consists of a series of interlinked nodes, called switches. Switches are devices capable of crating temporary connections between two or more devices linked to the switch. In a switched network, some of these nodes are connected to the end systems (computers or telephones). Others are used only for routing. Switched networks are divided, as shown in the figure.

7 Figure 3.7: Different types of switching techniques Circuit switching A circuit switched network consists of a set of switches connected by physical links. A connection between two stations is a dedicated path made of one or more links. It is mainly used for telephones to call from one to one. Figure 3.8: Circuit switching in telephone In the figure, each office has three incoming lines and three outgoing lines. When call passes through a switching office, a physical connection is established between the line on which the call came in and one of the output lines, as shown by the dotted lines. An important property of circuit switching is the need to set up an end-to-end path before any data can be sent. The elapsed time between the end of dialing and the start of ringing can easily be 10 sec, more on long-distance or international calls. Before data transmissions begin, the destination telephone should give acknowledgement. Once call setup, the only delay for data is the propagation time for the electromagnetic signal, about 5 msec per 1000 km. There is no problem of congestion Message switching The message switching is used to transfer the messages form one end to other end. There is no physical path is establishes in advance between the sender and receiver. Initially the messages were converted to Morse code i.e. in the form of dots and dashes. Each dot or dash was communicated by transmitting short and long pulses of electrical current over a copper wire. In this method a human operator was needed to encode the text messages, routing decision, error checking. Here also we use the concept of store-and forward, where the entire messages were

8 received fully, inspected for errors, and then transmitted to the destinations. The same method with slight change we are following in our applications Packet switching In packet switching, we transfer the messages in terms of small block fixed sizes called packets. In packet switching, there is no path; packets are routed independently by sharing the network at time to time, by following the best path to the destination. Packets can be in order to the destination. Packet switching is more fault tolerant than circuit switching. The store-and-forward transmission is used to route to the destination, while storing the packet in the routers main memory. Congestion may occur when more packets are sending from the various hosts Comparison of switching techniques Self Assessment Questions: Parallel Transmission a. Binary data consisting of 1s and 0s may be organized into groups of n bits each b. By grouping we can send data n bits at a time instead of one bit

9 Serial Transmission a. One bit follows another, so we need only one channel rather than n to transmit data between two devices b. Conversion devices are required at the interface Advantage COST Types of Serial Transmission There are two types of Serial Transmission: Asychronous Transmission Synchronous Transmission Asynchronous Transmission a. It is so named because the timing of the signal is unimportant. Instead information is received and translated by agreed upon patterns b. Start and Stop Bits Asynchronous Transmission Advantages Cheap Effective Disadvantages Slow Synchronous Transmission

10 Data is transmitted as an unbroken string of 1 s and 0 s and the receiver separates that string into the bytes or characters it need to reconstruct the information Synchronous Transmission Advantage Speed Figure Different modes of transmission Parallel Transmission Parallel transmission involves grouping several bits, say n, together and sending all the n bits at a time. Figure shows how parallel transmission occurs for n = 8. This can be accomplishes with the help of eight wires bundled together in the form of a cable with a connector at each end. Additional wires, such as request (req) and acknowledgement (ack) are required for asynchronous transmission. Primary advantage of parallel transmission is higher speed, which is achieved at the expense of higher cost of cabling. As this is expensive for longer distances, parallel transmission is feasible only for short distances. Figure Parallel mode of communication with n = 8 Serial Transmission

11 Serial transmission involves sending one data bit at a time. Figure shows how serial transmission occurs. It uses a pair of wire for communication of data in bit-serial form. Version 2 CSE IIT, Kharagpur Since communication within devices is parallel, it needs parallel-to-serial and serial-to- parallel conversion at both ends. Serial mode of communication widely used because of the following advantages: Reduced cost of cabling: Lesser number of wires is required as compared to parallel connection Reduced cross talk: Lesser number of wires result in reduced cross talk Availability of suitable communication media Inherent device characteristics: Many devices are inherently serial in nature Portable devices like PDAs, etc use serial communication to reduce the size of the connector

12 However, it is slower than parallel mode of communication. There are two basic approaches for serial communication to achieve synchronization of data transfer between the source-destination pair. These are referred to as asynchronous and synchronous. In the first case, data are transmitted in small sizes, say character by character, to avoid timing problem and make data transfer selfsynchronizing, as discussed later. However, it is not very efficient because of large overhead. To overcome this problem, synchronous mode is used. In synchronous mode, a block with large number of bits can be sent at a time. However, this requires tight synchronization between the transmitter and receiver clocks. Figure Serial mode of communication Direction of data flow: There are three possible modes in serial communication: simplex, full duplex and half duplex. In simplex mode, the communication is unidirectional, such as from a computer to a printer, as shown in Fig (a). In full-duplex mode both the sides can communicate simultaneously, as shown in Fig (b). On the other hand, in halfduplex mode of communication, each station can both send and receive data, as shown in Fig (c). But, when one is sending, the other one can only receive and vice versa. Version 2 CSE IIT, Kharagpur (a)

13 (b) (c) Figure Direction of data flow Framing and Synchronization Why Framing and Synchronization? Normally, units of data transfer are larger than a single analog or digital encoding symbol. It is necessary to recover clock information for both the signal (so we can recover the right number of symbols and recover each symbol as accurately as possible), and obtain synchronization for larger units of data (such as data words and frames). It is necessary to recover the data in words or blocks because this is the only way the receiver process will be able to interpret the data received; for a given bit stream. Depending on the byte boundaries, there will be seven or eight ways to interpret the bit stream as ASCII characters, and these are likely to be very different. So, it is necessary to add other bits to the block that convey control information used in the data link control procedures. The data along with preamble, postamble, and control information forms a frame. This framing is necessary for the purpose of synchronization and other data control functions Synchronization Data sent by a sender in bit-serial form through a medium must be correctly interpreted

14 at the receiving end. This requires that the beginning, the end and logic level and duration of each bit as sent at the transmitting end must be recognized at the receiving end. There are three synchronization levels: Bit, Character and Frame. Moreover, to achieve synchronization, two approaches known as asynchronous and synchronous transmissions are used. Frame synchronization is the process by which incoming frame alignment signals (i.e., distinctive bit sequences) are identified, i.e. distinguished from data bits, permitting the data bits within the frame to be extracted for decoding or retransmission. The usual Version 2 CSE IIT, Kharagpur practice is to insert, in a dedicated time slot within the frame, a non-information bit that is used for the actual synchronization of the incoming data with the receiver. In order to receive bits in the first place, the receiver must be able to determine how fast bits are being sent and when it has received a signal symbol. Further, the receiver needs to be able to determine what the relationship of the bits in the received stream have to one another, that is, what the logical units of transfer are, and where each received bit fits into the logical units. We call these logical units frames. This means that in addition to bit (or transmission symbol) synchronization, the receiver needs word and frame synchronization Synchronous communication (bit-oriented)

15 Timing is recovered from the signal itself (by the carrier if the signal is analog, or by regular transitions in the data signal or by a separate clock line if the signal is digital). Scrambling is often used to ensure frequent transitions needed. The data transmitted may be of any bit length, but is often constrained by the frame transfer protocol (data link or MAC protocol). Bit-oriented framing only assumes that bit synchronization has been achieved by the underlying hardware, and the incoming bit stream is scanned at all possible bit positions for special patterns generated by the sender. The sender uses a special pattern (a flag pattern) to delimit frames (one flag at each end), and has to provide for data transparency by use of bit stuffing (see below). A commonly used flag pattern is HDLC's flag as shown in Fig The bit sequence is used for both preamble and postamble for the purpose of synchronization. A frame format for bit-oriented synchronous frame is shown in Fig Apart from the flag bits there are control fields. This field contains the commands, responses and sequences numbers used to maintain the data flow accountability of the link, defines the functions of the frame and initiates the logic to control the movement of traffic between sending and receiving stations (a) Specific pattern

16 to represent start of frame (b) Specific pattern to represent end of frame Figure Bit oriented framing (a) Data to be sent to the peer, (b) Data after being character stuffed. Version 2 CSE IIT, Kharagpur Figure Frame format for synchronous communication Summary of the approach:

17 Initially 1 or 2 synchronization characters are sent Data characters are then continuously sent without any extra bits At the end, some error detection data is sent Advantages: Much less overhead No overhead is incurred except for synchronization characters Disadvantages: No tolerance in clock frequency is allowed The clock frequency should be same at both the sending and receiving ends Bit stuffing: If the flag pattern appears anywhere in the header or data of a frame, then the receiver may prematurely detect the start or end of the received frame. To overcome this problem, the sender makes sure that the frame body it sends has no flags in it at any position (note that since there is no character synchronization, the flag pattern can start at any bit location within the stream). It does this by bit stuffing, inserting an extra bit in any pattern that is beginning to look like a flag. In HDLC, whenever 5 consecutive 1's are encountered in the data, a 0 is inserted after the 5th 1, regardless of the next bit in the data as shown in Fig On the receiving end, the bit stream is piped through a shift register as the receiver looks for the flag pattern. If 5 consecutive 1's followed by a 0 is seen, then the 0 is dropped before sending the data on (the receiver destuffs the stream). If 6 1's and a 0 are seen, it is a flag and either the current frame are ended or a new frame is started, depending on the current state of the receiver. If more than 6 consecutive 1's

18 are seen, then the receiver has detected an invalid pattern, and usually the current frame, if any, is discarded. a). b) Specific pattern to represent start of frame s stuffed after every five 1 s Specific pattern to represent end of frame Figure Bit oriented (a) Data to be sent to the peer, (b) Data after being bit stuffed. Version 2 CSE IIT, Kharagpur

19 With bit stuffing, the boundary between two frames can be unambiguously recognized by the flag pattern. Thus, if receiver loses track of where it is, all it has to do is to scan the input for flag sequence, since they can only occur at frame boundaries and never within data. In addition to receiving the data in logical units called frames, the receiver should have some way of determining if the data has been corrupted or not. If it has been corrupted, it is desirable not only to realize that, but also to make an attempt to obtain the correct data. This process is called error detection and error correction, which will be discussed in the next lesson Asynchronous communication (word-oriented) In asynchronous communication, small, fixed-length words (usually 5 to 9 bits long) are transferred without any clock line or clock is recovered from the signal itself. Each word has a start bit (usually as a 0) before the first data bit of the word and a stop bit (usually as a 1) after the last data bit of the word, as shown in Fig The receiver's local clock is started when the receiver detects the 1-0 transition of the start bit, and the line is sampled in the middle of the fixed bit intervals (a bit interval is the inverse of the data rate). The sender outputs the bit at the agreed-upon rate, holding the line in the appropriate state for one bit interval for each bit, but using its own local clock to determine the length of these bit intervals. The receiver's clock and the sender's clock may not run at the same speed, so that there is a relative clock drift (this may be caused by variations in the crystals used, temperature, voltage, etc.). If the receiver's clock drifts too much relative to the sender's clock, then the bits may be sampled while the line is in transition from one state to another, causing the receiver to misinterpret the received data. There can be variable amount of gap between two frames as shown in Fig

20 Figure Character or word oriented format for asynchronous mode Version 2 CSE IIT, Kharagpur Figure Data units sent with variable gap sent in asynchronous mode Advantages of asynchronous character oriented mode of communication are summarized below: Simple to implement Self synchronization; Clock signal need not be sent Tolerance in clock frequency is possible The bits are sensed in the middle hence ± ½ bit tolerance is provided This mode of data communication, however, suffers from high overhead incurred in data transmission. Data must be sent in multiples of the data length of the word, and the two or more bits of synchronization overhead compared to the relatively short data length causes the effective data rate to be rather low. For example, 11 bits are required to transmit 8 bits of data. In other words, baud rate (number of signal elements) is higher

Framing and Stuffing. Advanced Computer Networks

Framing and Stuffing. Advanced Computer Networks Framing and Stuffing Advanced Computer Networks Framing & Stuffing Outline Synchronous vs Asynchronous Transmissions Asynchronous Character Transmissions Framing Identifying Synchronous Block Boundaries

More information

DATA COMMUNICATION. Part TWO Data Transmission

DATA COMMUNICATION. Part TWO Data Transmission DATA COMMUNICATION Part TWO Data Transmission This Chapter intends to create basic concepts of Data communication. We will be covering some basic definitions and details Q: What are the basics Communication

More information

2.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

2.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 information

ET4254 Communications and Networking 1

ET4254 Communications and Networking 1 Topic 10:- Local Area Network Overview Aims:- LAN topologies and media LAN protocol architecture bridges, hubs, layer 2 & 3 switches 1 LAN Applications (1) personal computer LANs low cost limited data

More information

Data Communication. Chapter # 1: Introduction. By: William Stalling

Data Communication. Chapter # 1: Introduction. By: William Stalling Data Communication Chapter # 1: By: Introduction William Stalling Data Communication The exchange of data between two devices via some form of transmission medium such as cable wire. For data communications

More information

Direct Link Networks: Building Blocks (2.1), Encoding (2.2), Framing (2.3)

Direct Link Networks: Building Blocks (2.1), Encoding (2.2), Framing (2.3) Direct Link Networks: Building Blocks (2.1), Encoding (2.2), Framing (2.3) ECPE/CS 5516: Computer Networks Originally by Scott F. Midkiff (ECpE) Modified by Marc Abrams (CS) Virginia Tech courses.cs.vt.edu/~cs5516

More information

Data Communication. Introduction of Communication. Data Communication. Elements of Data Communication (Communication Model)

Data Communication. Introduction of Communication. Data Communication. Elements of Data Communication (Communication Model) Data Communication Introduction of Communication The need to communicate is part of man s inherent being. Since the beginning of time the human race has communicated using different techniques and methods.

More information

Local Area Network Overview

Local Area Network Overview Local Area Network Overview Chapter 15 CS420/520 Axel Krings Page 1 LAN Applications (1) Personal computer LANs Low cost Limited data rate Back end networks Interconnecting large systems (mainframes and

More information

ECE 4450:427/527 - Computer Networks Spring 2017

ECE 4450:427/527 - Computer Networks Spring 2017 ECE 4450:427/527 - Computer Networks Spring 2017 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 5.1: Link Layer Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527 Computer

More information

ET3110 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 information

Chapter 9: Data Transmission

Chapter 9: Data Transmission Chapter 9: Data Transmission MULTIPLE CHOICE 1. In practical terms, parallel data transmission is sent: a. over short distances only c. over any distance b. usually over long distances d. usually over

More information

2 Network Basics. types of communication service. how communication services are implemented. network performance measures. switching.

2 Network Basics. types of communication service. how communication services are implemented. network performance measures. switching. 2 Network Basics types of communication service how communication services are implemented switching multiplexing network performance measures 1 2.1 Types of service in a layered network architecture connection-oriented:

More information

Data and Computer Communications. Chapter 2 Protocol Architecture, TCP/IP, and Internet-Based Applications

Data and Computer Communications. Chapter 2 Protocol Architecture, TCP/IP, and Internet-Based Applications Data and Computer Communications Chapter 2 Protocol Architecture, TCP/IP, and Internet-Based s 1 Need For Protocol Architecture data exchange can involve complex procedures better if task broken into subtasks

More information

Lesson 1: Network Communications

Lesson 1: Network Communications Lesson 1: Network Communications This lesson introduces the basic building blocks of network communications and some of the structures used to construct data networks. There are many different kinds of

More information

CS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP

CS 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 information

)454 6 TELECOMMUNICATION STANDARDIZATION SECTOR OF ITU

)454 6 TELECOMMUNICATION STANDARDIZATION SECTOR OF ITU INTERNATIONAL TELECOMMUNICATION UNION )454 6 TELECOMMUNICATION STANDARDIZATION SECTOR OF ITU $!4! #/--5.)#!4)/. /6%2 4(% 4%,%0(/.%.%47/2+ #/$%).$%0%.$%.4 %22/2#/.42/, 3934%- )454 Recommendation 6 (Extract

More information

Chapter 6 Digital Data Communications Techniques

Chapter 6 Digital Data Communications Techniques Chapter 6 Digital Data Communications Techniques Asynchronous and Synchronous Transmission timing problems require a mechanism to synchronize the transmitter and receiver receiver samples stream at bit

More information

William Stallings Data and Computer Communications 7 th Edition. Chapter 10 Circuit Switching and Packet Switching

William Stallings Data and Computer Communications 7 th Edition. Chapter 10 Circuit Switching and Packet Switching William Stallings Data and Computer Communications 7 th Edition Chapter 10 Circuit Switching and Packet Switching Switching Networks Long distance transmission is typically done over a network of switched

More information

PPP. Point-to-Point Protocol

PPP. Point-to-Point Protocol PPP Point-to-Point Protocol 1 Introduction One of the most common types of WAN connection is the point-to-point connection. Point-to-point connections are used to connect LANs to service provider WANs,

More information

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS 28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the

More information

Configuration of Synchronous Protocols

Configuration of Synchronous Protocols encor! enetworks TM Version A, September 2010 2013 Encore Networks, Inc. All rights reserved. Configuration of Synchronous Protocols This chapter discusses synchronous protocols that you can configure

More information

Chapter 15 Local Area Network Overview

Chapter 15 Local Area Network Overview Chapter 15 Local Area Network Overview LAN Topologies Bus and Tree Bus: stations attach through tap to bus full duplex allows transmission and reception transmission propagates throughout medium heard

More information

Chapter 8 OSI Physical Layer

Chapter 8 OSI Physical Layer Chapter 8 OSI Physical Layer Upper OSI layer protocols prepare data from the human network for transmission to its destination. The Physical layer controls how data is placed on the communication media.

More information

Module 1. Introduction. Version 2, CSE IIT, Kharagpur

Module 1. Introduction. Version 2, CSE IIT, Kharagpur Module 1 Introduction Version 2, CSE IIT, Kharagpur Introduction In this module we shall highlight some of the basic aspects of computer networks in two lessons. In lesson 1.1 we shall start with the historical

More information

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition ELEC / COMP 177 Fall 2011 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Project #2 Due Thursday, Nov 10 th By midnight Homework #5 Due Thursday, Nov 17 th Later this semester: Homework

More information

Fig.12.5 Serial Data Line during Serial Communication

Fig.12.5 Serial Data Line during Serial Communication Lecture-66 Asynchronous Serial Data Communication A serial data signal is divided into time intervals called bit times as shown in fig.2.5. During each bit time interval (T B ), the signal is either a

More information

Introduction to Data Communications & Networking

Introduction 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 information

Layer 2 functionality bridging and switching

Layer 2 functionality bridging and switching Layer 2 functionality bridging and switching BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013 Overview Layer 2 functionality Error detection Bridges Broadcast and collision domains How

More information

Links Reading: Chapter 2. Goals of Todayʼs Lecture. Message, Segment, Packet, and Frame

Links Reading: Chapter 2. Goals of Todayʼs Lecture. Message, Segment, Packet, and Frame Links Reading: Chapter 2 CS 375: Computer Networks Thomas Bressoud 1 Goals of Todayʼs Lecture Link-layer services Encoding, framing, and error detection Error correction and flow control Sharing a shared

More information

CS 123: Lecture 12, LANs, and Ethernet. George Varghese. October 24, 2006

CS 123: Lecture 12, LANs, and Ethernet. George Varghese. October 24, 2006 CS 123: Lecture 12, LANs, and Ethernet George Varghese October 24, 2006 Selective Reject Modulus failure Example w = 2, Max = 3 0 0 1 3 0 A(1) A(2) 1 0 retransmit A(1) A(2) buffer Case 1 Case 2 reject

More information

ECE 653: Computer Networks Mid Term Exam all

ECE 653: Computer Networks Mid Term Exam all ECE 6: Computer Networks Mid Term Exam 16 November 004. Answer all questions. Always be sure to answer each question concisely but precisely! All questions have points each. 1. What are the different layers

More information

Contention Protocols and Networks

Contention Protocols and Networks 4/13/2005 314 Lecture Contention Protocols and Networks 1 Contention Protocols and Networks Contention Protocols CSMA/CD Network Topologies Ethernet 4/13/2005 314 Lecture Contention Protocols and Networks

More information

Chapter 7: Data Link Control. CS420/520 Axel Krings Page 1

Chapter 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 information

Chapter 7: Data Link Control. Data Link Control Protocols

Chapter 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 information

CSCI-1680 Physical Layer Link Layer I Rodrigo Fonseca

CSCI-1680 Physical Layer Link Layer I Rodrigo Fonseca CSCI-1680 Physical Layer Link Layer I Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Janno< Administrivia Snowcast milestone today! 4-7pm Sign up at http://tinyurl.com/cs168-calendar

More information

COMPUTER NETWORKS UNIT I. 1. What are the three criteria necessary for an effective and efficient networks?

COMPUTER NETWORKS UNIT I. 1. What are the three criteria necessary for an effective and efficient networks? Question Bank COMPUTER NETWORKS Short answer type questions. UNIT I 1. What are the three criteria necessary for an effective and efficient networks? The most important criteria are performance, reliability

More information

Data Communications & Networks. Session 3 Main Theme Data Encoding and Transmission. Dr. Jean-Claude Franchitti

Data Communications & Networks. Session 3 Main Theme Data Encoding and Transmission. Dr. Jean-Claude Franchitti Data Communications & Networks Session 3 Main Theme Data Encoding and Transmission Dr. Jean-Claude Franchitti New York University Computer Science Department Courant Institute of Mathematical Sciences

More information

Circuit Switching and Packet Switching

Circuit Switching and Packet Switching Chapter 10: Circuit Switching and Packet Switching CS420/520 Axel Krings Page 1 Switching Networks Long distance transmission is typically done over a network of switched nodes Nodes not concerned with

More information

Chapter 3. The Data Link Layer. Wesam A. Hatamleh

Chapter 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 information

Data Link Control Protocols

Data 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 information

Data Transmission Definition Data Transmission Analog Transmission Digital Transmission

Data Transmission Definition Data Transmission Analog Transmission Digital Transmission Data Transmission Definition Data Transmission Data transmission occurs between transmitter (sender) and receiver over some transmission medium. This transfer of data takes place via some form of transmission

More information

Introduction to Protocols

Introduction to Protocols Chapter 6 Introduction to Protocols 1 Chapter 6 Introduction to Protocols What is a Network Protocol? A protocol is a set of rules that governs the communications between computers on a network. These

More information

INTRODUCTION DATA COMMUNICATION TELECOMMUNICATIONS SYSTEM COMPONENTS 1/28/2015. Satish Chandra satish0402.weebly.com

INTRODUCTION DATA COMMUNICATION TELECOMMUNICATIONS SYSTEM COMPONENTS 1/28/2015. Satish Chandra satish0402.weebly.com INTRODUCTION DATA COMMUNICATION Satish Chandra satish0402.weebly.com The term telecommunication means communication at a distance. The word data refers to information presented in whatever form is agreed

More information

Module 16: Distributed System Structures

Module 16: Distributed System Structures Chapter 16: Distributed System Structures Module 16: Distributed System Structures Motivation Types of Network-Based Operating Systems Network Structure Network Topology Communication Structure Communication

More information

CMPE150 Midterm Solutions

CMPE150 Midterm Solutions CMPE150 Midterm Solutions Question 1 Packet switching and circuit switching: (a) Is the Internet a packet switching or circuit switching network? Justify your answer. The Internet is a packet switching

More information

Advanced Computer Networks. Rab Nawaz Jadoon DCS. Assistant Professor COMSATS University, Lahore Pakistan. Department of Computer Science

Advanced 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 information

Lecture 4. Data Transmission Modes and Switching. Data Transmission & Switching 1-1

Lecture 4. Data Transmission Modes and Switching. Data Transmission & Switching 1-1 Lecture 4 Data Transmission Modes and Switching Data Transmission & Switching 1-1 Agenda Introduction to Data Transmission Modes Parallel and Serial Transmission Transmission Media Guided and unguided

More information

UNIT 1 BASICS OF DATA COMMUNICATION

UNIT 1 BASICS OF DATA COMMUNICATION UNIT 1 BASICS OF DATA COMMUNICATION Basics of Data Communication Structure Page No. 1.0 Introduction 5 1.1 Objectives 5 1.2 Concept of Communication System 6 1.3 Analog and Digital Communication 8 1.4

More information

Question 7: What are Asynchronous links?

Question 7: What are Asynchronous links? Question 1:.What is three types of LAN traffic? Unicasts - intended for one host. Broadcasts - intended for everyone. Multicasts - intended for an only a subset or group within an entire network. Question2:

More information

Reminder: Datalink Functions Computer Networking. Datalink Architectures

Reminder: Datalink Functions Computer Networking. Datalink Architectures Reminder: Datalink Functions 15-441 15 441 15-641 Computer Networking Lecture 5 Media Access Control Peter Steenkiste Fall 2015 www.cs.cmu.edu/~prs/15-441-f15 Framing: encapsulating a network layer datagram

More information

CS455: Introduction to Distributed Systems [Spring 2018] Dept. Of Computer Science, Colorado State University

CS455: Introduction to Distributed Systems [Spring 2018] Dept. Of Computer Science, Colorado State University CS 455: INTRODUCTION TO DISTRIBUTED SYSTEMS [NETWORKING] Shrideep Pallickara Computer Science Colorado State University Frequently asked questions from the previous class survey Why not spawn processes

More information

CSCI 466 Midterm Networks Fall 2011

CSCI 466 Midterm Networks Fall 2011 CSCI 466 Midterm Networks Fall 2011 Name: This exam consists of 7 problems on the following 9 pages. You may use your single- sided hand- written 8 ½ x 11 note sheet and a calculator during the exam. No

More information

Course 10: Interfaces Agenda

Course 10: Interfaces Agenda Course 10: Interfaces 1 Agenda Introduction V.24 interface (RS232) USB 2 Introduction 3 Definition(s) (from the web) A boundary across which two independent systems meet and act on or communicate with

More information

Lecture (02) Network Protocols and Standards

Lecture (02) Network Protocols and Standards Lecture (02) Network Protocols and Standards Dr. Ahmed M. ElShafee 1 Agenda - - 2 Preface Protocols and standards are what make networks work together. Protocols make it possible for the various components

More information

Interface The exit interface a packet will take when destined for a specific network.

Interface The exit interface a packet will take when destined for a specific network. The Network Layer The Network layer (also called layer 3) manages device addressing, tracks the location of devices on the network, and determines the best way to move data, which means that the Network

More information

1/29/2008. From Signals to Packets. Lecture 6 Datalink Framing, Switching. Datalink Functions. Datalink Lectures. Character and Bit Stuffing.

1/29/2008. From Signals to Packets. Lecture 6 Datalink Framing, Switching. Datalink Functions. Datalink Lectures. Character and Bit Stuffing. /9/008 From Signals to Packets Lecture Datalink Framing, Switching Peter Steenkiste Departments of Computer Science and Electrical and Computer Engineering Carnegie Mellon University Analog Signal Digital

More information

D-STAR Review & Final Exam

D-STAR Review & Final Exam Page 1 of 8 D-STAR Review & Final Exam Summary This lesson consists of a selection of items from the review sections of Lessons #1 - #9. The Final Exam consists of twenty questions selected from the individual

More information

Lecture (04 & 05) Packet switching & Frame Relay techniques Dr. Ahmed ElShafee

Lecture (04 & 05) Packet switching & Frame Relay techniques Dr. Ahmed ElShafee Agenda Lecture (04 & 05) Packet switching & Frame Relay techniques Dr. Ahmed ElShafee Packet switching technique Packet switching protocol layers (X.25) Frame Relay ١ Dr. Ahmed ElShafee, ACU Fall 2011,

More information

Lecture (04 & 05) Packet switching & Frame Relay techniques

Lecture (04 & 05) Packet switching & Frame Relay techniques Lecture (04 & 05) Packet switching & Frame Relay techniques Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU Fall 2011, Networks I Agenda Packet switching technique Packet switching protocol layers (X.25)

More information

Token Ring and. Fiber Distributed Data Interface (FDDI) Networks: Token Ring and FDDI 1

Token Ring and. Fiber Distributed Data Interface (FDDI) Networks: Token Ring and FDDI 1 Token Ring and Fiber Distributed Data Interface (FDDI) Networks: Token Ring and FDDI 1 IEEE 802.5 Token Ring Proposed in 1969 and initially referred to as a Newhall ring. Token ring :: a number of stations

More information

Chapter Two. The OSI Model

Chapter Two. The OSI Model Chapter Two الملزمة الثانية The OSI Model The International Standards Organization (ISO) is a multinational body dedicated to worldwide agreement on international standards (Established in 1947). An ISO

More information

Digital Input and Output

Digital Input and Output Digital Input and Output Topics: Parallel Digital I/O Simple Input (example) Parallel I/O I/O Scheduling Techniques Programmed Interrupt Driven Direct Memory Access Serial I/O Asynchronous Synchronous

More information

Chapter 4 NETWORK HARDWARE

Chapter 4 NETWORK HARDWARE Chapter 4 NETWORK HARDWARE 1 Network Devices As Organizations grow, so do their networks Growth in number of users Geographical Growth Network Devices : Are products used to expand or connect networks.

More information

Lecture 6 Datalink Framing, Switching. From Signals to Packets

Lecture 6 Datalink Framing, Switching. From Signals to Packets Lecture 6 Datalink Framing, Switching David Andersen Department of Computer Science Carnegie Mellon University 15-441 Networking, Spring 2005 http://www.cs.cmu.edu/~srini/15-441/s05/ 1 From Signals to

More information

Lecture-65 SERIAL DATA COMMMUNICATION The data bus of a microcomputer system is designed to transfer data to and from I/O device in parallel - all

Lecture-65 SERIAL DATA COMMMUNICATION The data bus of a microcomputer system is designed to transfer data to and from I/O device in parallel - all Lecture-65 SERIAL DATA COMMMUNICATION The data bus of a microcomputer system is designed to transfer data to and from I/O device in parallel - all bits of a data word are transformed simultaneously. This

More information

1.0 INTRODUCTION. Introduction to data communication and networking 1

1.0 INTRODUCTION. Introduction to data communication and networking 1 Introduction to data communication and networking 1 1.0 INTRODUCTION Data communications and networking may be the fastest growing technologies in our culture today. One of the ramifications of that growth

More information

CS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online

CS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online 1 CS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online Solutions 1. General Networking a. In traditional client-server communication using TCP, a new socket is created.

More information

Chapter -4 OSI Reference Model

Chapter -4 OSI Reference Model Chapter -4 OSI Reference Model Objectives Concept of Reference Model. OSI Reference Model Concept. Layers of OSI Reference Model. 4.1 Introduction Layered Architecture, Peer-to- Peer Processes, Interfaces

More information

TCOM 370 NOTES 99-1 NETWORKING AND COMMUNICATIONS

TCOM 370 NOTES 99-1 NETWORKING AND COMMUNICATIONS TCOM 370 NOTES 99-1 NETWORKING AND COMMUNICATIONS Communication Networks Allow Exchange of Information between Users telephone network for voice communication interconnected computers and peripherals,

More information

Chapter 11 Data Link Control 11.1

Chapter 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 information

Medium Access Control. IEEE , Token Rings. CSMA/CD in WLANs? Ethernet MAC Algorithm. MACA Solution for Hidden Terminal Problem

Medium Access Control. IEEE , Token Rings. CSMA/CD in WLANs? Ethernet MAC Algorithm. MACA Solution for Hidden Terminal Problem Medium Access Control IEEE 802.11, Token Rings Wireless channel is a shared medium Need access control mechanism to avoid interference Why not CSMA/CD? 9/15/06 CS/ECE 438 - UIUC, Fall 2006 1 9/15/06 CS/ECE

More information

Some previous important concepts

Some previous important concepts Almustansorya University College of Education Computer Science Department Communication and Computer Networks Class 4 (A/B) Lesson 6... Network Topology Abstract This lesson will mainly focus on the network

More information

Module 15: Network Structures

Module 15: Network Structures Module 15: Network Structures Background Topology Network Types Communication Communication Protocol Robustness Design Strategies 15.1 A Distributed System 15.2 Motivation Resource sharing sharing and

More information

Computer Network. Direct Link Networks Reliable Transmission. rev /2/2004 1

Computer Network. Direct Link Networks Reliable Transmission. rev /2/2004 1 Computer Network Direct Link Networks Reliable Transmission rev 1.01 24/2/2004 1 Outline Direct link networks (Ch. 2) Encoding Framing Error detection Reliable delivery Media access control Network Adapter

More information

CS 455. Week 9. Reading: 1. Data Communications and Networking Behrouz A Forouzan Edition: 4.

CS 455. Week 9. Reading: 1. Data Communications and Networking Behrouz A Forouzan Edition: 4. CS 455 Week 9 Reading: 1. Data Communications and Networking Behrouz A Forouzan Edition: 4. Objectives: 1. To test the students knowledge on the concepts covered from Week 1 through Week 7. Concepts: 1.

More information

EECS489 Computer Networks, Take-home Makeup Midterm (Winter 2007) due in class Wednesday 3/28

EECS489 Computer Networks, Take-home Makeup Midterm (Winter 2007) due in class Wednesday 3/28 EECS489 Computer Networks, Take-home Makeup Midterm (Winter 2007) due in class Wednesday 3/28 Note that this is entirely optional, taking this exam will only improve your grade, and not taking it will

More information

(a) Client server model (b) MAN (c) Interfaces and services. [4+6+6] FirstRanker

(a) Client server model (b) MAN (c) Interfaces and services. [4+6+6] FirstRanker Code No: N0421/R07 Set No. 1 IV B.Tech I Semester Supplementary Examinations, March 2013 COMPUTER NETWORKS ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,

More information

IEEE , Token Rings. 10/11/06 CS/ECE UIUC, Fall

IEEE , Token Rings. 10/11/06 CS/ECE UIUC, Fall IEEE 802.11, Token Rings 10/11/06 CS/ECE 438 - UIUC, Fall 2006 1 Medium Access Control Wireless channel is a shared medium Need access control mechanism to avoid interference Why not CSMA/CD? 10/11/06

More information

Good day. In the last lecture, we talked about various multiple access schemes and one of this set of schemes is token bus DQD etc.

Good day. In the last lecture, we talked about various multiple access schemes and one of this set of schemes is token bus DQD etc. Computer Networks Prof. Sujoy Ghosh Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture - 14 Token-Based MAC Good day. In the last lecture, we talked about various

More information

Overview of Networks

Overview of Networks CMPT765/408 08-1 Overview of Networks Qianping Gu 1 Overview of Networks This note is mainly based on Chapters 1-2 of High Performance of Communication Networks by J. Walrand and P. Pravin, 2nd ed, and

More information

3. Evaluation of Selected Tree and Mesh based Routing Protocols

3. Evaluation of Selected Tree and Mesh based Routing Protocols 33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in

More information

Frequency: it refers to the number of periods in 1 s. It is formally expressed in Hertz (Hz)

Frequency: it refers to the number of periods in 1 s. It is formally expressed in Hertz (Hz) Chapter2: Peak amplitude: it is the absolute value of the highest intensity. Frequency: it refers to the number of periods in 1 s. It is formally expressed in Hertz (Hz) Phase: it describes the position

More information

Jaringan Komputer. Broadcast Network. Outline. MAC (Medium Access Control) Channel Allocation Problem. Dynamic Channel Allocation

Jaringan Komputer. Broadcast Network. Outline. MAC (Medium Access Control) Channel Allocation Problem. Dynamic Channel Allocation Broadcast Network Jaringan Komputer Medium Access Control Sublayer 2 network categories: point-to-point connections broadcast channels Key issue in broadcast network: how to determine who gets to use the

More information

Data link layer functions. 2 Computer Networks Data Communications. Framing (1) Framing (2) Parity Checking (1) Error Detection

Data 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 information

Introduction to Information Technology Turban, Rainer and Potter John Wiley & Sons, Inc. Copyright 2005

Introduction to Information Technology Turban, Rainer and Potter John Wiley & Sons, Inc. Copyright 2005 Introduction to Information Technology Turban, Rainer and Potter John Wiley & Sons, Inc. Copyright 2005 Network and Telecommunications Basics Chapter Outline The telecommunications system Network services

More information

M242 COMPUTER NETWORS AND SECURITY

M242 COMPUTER NETWORS AND SECURITY M242 COMPUTER NETWORS AND SECURITY 2.1. Network Models: UNIT - II OSI MODEL AND LAN PROTOCOLS 1. Explain Network model A network is a combination of hardware and software that sends data from one location

More information

Data & Computer Communication

Data & Computer Communication Basic Networking Concepts A network is a system of computers and other devices (such as printers and modems) that are connected in such a way that they can exchange data. A bridge is a device that connects

More information

UNIT- 2 Physical Layer and Overview of PL Switching

UNIT- 2 Physical Layer and Overview of PL Switching UNIT- 2 Physical Layer and Overview of PL Switching 2.1 MULTIPLEXING Multiplexing is the set of techniques that allows the simultaneous transmission of multiple signals across a single data link. Figure

More information

Links. CS125 - mylinks 1 1/22/14

Links. CS125 - mylinks 1 1/22/14 Links 1 Goals of Today s Lecture Link-layer services Encoding, framing, and error detection Error correction and flow control Sharing a shared media Channel partitioning Taking turns Random access Shared

More information

Chapter 3. Top Level View of Computer Function and Interconnection. Yonsei University

Chapter 3. Top Level View of Computer Function and Interconnection. Yonsei University Chapter 3 Top Level View of Computer Function and Interconnection Contents Computer Components Computer Function Interconnection Structures Bus Interconnection PCI 3-2 Program Concept Computer components

More information

Introduction to Open System Interconnection Reference Model

Introduction to Open System Interconnection Reference Model Chapter 5 Introduction to OSI Reference Model 1 Chapter 5 Introduction to Open System Interconnection Reference Model Introduction The Open Systems Interconnection (OSI) model is a reference tool for understanding

More information

The History and the layers of the OSI Model 30 - October

The History and the layers of the OSI Model 30 - October THE OSI MODEL Established in 1947, the International Standards Organization (ISO) is a multinational body dedicated to worldwide agreement on international standards. An ISO standard that covers all aspects

More information

Access to the Web. Coverage. Basic Communication Technology. CMPT 165: Review

Access to the Web. Coverage. Basic Communication Technology. CMPT 165: Review Access to the Web CMPT 165: Review Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University December 5, 2011 Access to the Web requires: a computer (of some kind) a connection

More information

Computer Peripherals

Computer Peripherals Computer Peripherals School of Computer Engineering Nanyang Technological University Singapore These notes are part of a 3rd year undergraduate course called "Computer Peripherals", taught at Nanyang Technological

More information

William Stallings Data and Computer Communications. Chapter 7 Data Link Control

William 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 information

RECOMMENDATION ITU-R BS.776 * Format for user data channel of the digital audio interface **

RECOMMENDATION ITU-R BS.776 * Format for user data channel of the digital audio interface ** Rec. ITU-R BS.776 1 RECOMMENDATION ITU-R BS.776 * Format for user data channel of the digital audio interface ** The ITU Radiocommunication Assembly considering (1992) a) that there is a real need for

More information

e-pg Pathshala Subject : Computer Science Paper: Embedded System Module: Serial Port Communication Module No: CS/ES/11 Quadrant 1 e-text

e-pg Pathshala Subject : Computer Science Paper: Embedded System Module: Serial Port Communication Module No: CS/ES/11 Quadrant 1 e-text e-pg Pathshala Subject : Computer Science Paper: Embedded System Module: Serial Port Communication Module No: CS/ES/11 Quadrant 1 e-text In this lecture, serial port communication will be discussed in

More information

DATA COMMUNICATION AND NETWORKS

DATA COMMUNICATION AND NETWORKS DATA COMMUNICATION AND NETWORKS A/L Guide TERAN SUBASINGHE Data Communication What is data communication? Data Communication is a process of exchanging data or information between two or more devices along

More information

Silberschatz and Galvin Chapter 15

Silberschatz and Galvin Chapter 15 Silberschatz and Galvin Chapter 15 Network Structures CPSC 410--Richard Furuta 3/30/99 1 Chapter Topics Background and motivation Network topologies Network types Communication issues Network design strategies

More information

Data Communications & Networks. Session 3 Main Theme Data Encoding and Transmission. Dr. Jean-Claude Franchitti

Data Communications & Networks. Session 3 Main Theme Data Encoding and Transmission. Dr. Jean-Claude Franchitti Data Communications & Networks Session 3 Main Theme Data Encoding and Transmission Dr. Jean-Claude Franchitti New York University Computer Science Department Courant Institute of Mathematical Sciences

More information