COMPSCI 314 S1 C. Data Communications Fundamentals

Similar documents
COMPSCI 314 S1 C. Data Communications Fundamentals. Other matters. Approach to material COMPSCI 314 S1C 2006

KIBABII UNIVERSITY COLLEGE DEPARTMENT COMPUTER SCIENCE & IT ANSWER ALL QUESTIONS IN SECTION A AND ANY TWO QUESTIONS IN SECTION B

5105: BHARATHIDASAN ENGINEERING COLLEGE NATTARMPALLI UNIT I FUNDAMENTALS AND LINK LAYER PART A

Digital Communication Networks

IT4405 Computer Networks (Compulsory)

Computer Facilities and Network Management BUS3150 Tutorial - Week 13

Data Networks. Lecture 1: Introduction. September 4, 2008

Introduction to computer networking

Advantages and disadvantages

CHAPTER 17 - NETWORK AMD DISTRIBUTED SYSTEMS

CS61C : Machine Structures

Lecture 2. Computer Networks Models. Network Models 1-1

Computer Network : Lecture Notes Nepal Engineering College Compiled by: Junior Professor: Daya Ram Budhathoki Nepal Engineering college, Changunarayan

Local Area Network Overview

Operating Systems CS 571

UNIT - IV Ques.4 Ques.5

Data & Computer Communication

Data Link Control Protocols

Study Guide. Module Two

COMPONENTS OF DATA COMMUNICATION

Lecture 6 Datalink Framing, Switching. From Signals to Packets

Chapter 8 OSI Physical Layer

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

Study Guide. Module Three

Data Link Layer. Our goals: understand principles behind data link layer services: instantiation and implementation of various link layer technologies

Chapter 16 Networking

CIS 551 / TCOM 401 Computer and Network Security. Spring 2007 Lecture 7

Computer and Network Security

General comments on candidates' performance

CSCI 466 Midterm Networks Fall 2011

Navpreet Singh INTRODUCTION TO COMPUTER NETWORKS. Computer Centre Indian Institute of Technology Kanpur Kanpur INDIA

ET4254 Communications and Networking 1

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

Introduction to Network Technologies & Layered Architecture BUPT/QMUL

CS 4453 Computer Networks Winter

ECS 152A Computer Networks Instructor: Liu. Name: Student ID #: Final Exam: March 17, 2005

LECTURE WK4 NETWORKING

Basics of datacommunication

Defining Networks with the OSI Model. Module 2

Communication Networks

EEC-484/584 Computer Networks

CS61C : Machine Structures

Transmission SIGNALs

Data Communication & Computer Networks INFO

COMPUTER AND DATA NETWORKS

CS61C : Machine Structures

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

Chapter 4: Network Access

Internet II. CS10 : Beauty and Joy of Computing. cs10.berkeley.edu. !!Senior Lecturer SOE Dan Garcia!!! Garcia UCB!

Communicating over the Network

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

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

CS3600 SYSTEMS AND NETWORKS

The OSI Model. Open Systems Interconnection (OSI). Developed by the International Organization for Standardization (ISO).

DATA COMMUNICATION AND NETWORKS

Name KEY. CS513/ECE506 Spring 2013 Computer Networks Mid Term Exam March 12, 2013

Computer Networks (Unit wise Questions)

Review For Exam 2. Internetworking. Summary Questions. School of Business Eastern Illinois University. School of Business Eastern Illinois University

ECE 4450:427/527 - Computer Networks Spring 2017

Networking Applications

Typical Network Uses

Introduction to Wireless Networking ECE 401WN Spring 2008

The TCP/IP Architecture Jean Yves Le Boudec 2014

Announcements. TAs office hours: Mohamed Grissa: Mohamed Alkalbani:

The TCP/IP Architecture Jean Yves Le Boudec 2014

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

What is the fundamental purpose of a communication system? Discuss the communication model s elements.

Computer Networking. Introduction. Quintin jean-noël Grenoble university

The TCP/IP Architecture. Jean Yves Le Boudec 2017

Lesson 1: Network Communications

Data Communication. Introduction

IEEE 802 LANs SECTION C

The TCP/IP Architecture. Jean Yves Le Boudec 2017

E&CE 358: Tutorial 1. Instructor: Sherman (Xuemin) Shen TA: Miao Wang

Faculty of Science Final Examination. Computer Science B Basics of Computer Networks

QUESTION BANK UNIT-I

CS 428/528 Computer Networks Lecture 01. Yan Wang

Introductions. Computer Networking Lecture 01. January 16, HKU SPACE Community College. HKU SPACE CC CN Lecture 01 1/36

RMIT University. Data Communication and Net-Centric Computing COSC 1111/2061/1110. Lecture 8. Medium Access Control Methods & LAN

CCNA Exploration1 Chapter 7: OSI Data Link Layer

FINAL Wednesday, 30 th July 2008

Introduction to Networking

UNIVERSITY QUESTIONS

Overview of Networks

Chapter 12. Network Organization and Architecture

ECE 653: Computer Networks Mid Term Exam all

COMPUTER NETWORKS MODEL QUESTION PAPER WITH SOLUTION. (c) Peer-to-peer processes are processes on two or more devices communicating at a

Lecture 2: Internet Architecture

Chapter 15 Local Area Network Overview

Need For Protocol Architecture

Chapter 2 Communicating Over the Network

Revision of Previous Lectures

Multimedia Networking

Chapter 2. Communicating Over The Network. CCNA1-1 Chapter 2

IP Packet Switching. Goals of Todayʼs Lecture. Simple Network: Nodes and a Link. Connectivity Links and nodes Circuit switching Packet switching

The TCP/IP Architecture. Jean Yves Le Boudec 2015

The TCP/IP Architecture. Jean Yves Le Boudec 2015

Introduction to Information Science and Technology 2017 Networking I. Sören Schwertfeger 师泽仁

DCN Questions CHAPTER 1:- NETWORKING FUNDAMENTALS

Objectives. Hexadecimal Numbering and Addressing. Ethernet / IEEE LAN Technology. Ethernet

Transcription:

COMPSCI 314 S1 C Data Communications Fundamentals

COMPSCI 314 S1C 2006 Data Communications Fundamentals Lecturers Nevil Brownlee Room 590, n.brownlee@auckland.ac.nz Clark Thomborson Room 593, ctho065@ec.auckland.ac.nz Peter Fenwick, p.fenwick@auckland.ac.nz Tutor DongJin Lee Room 596, dlee064@ec.auckland.ac.nz Test Date Monday 8 May, 6.25 7:30 pm Assignments due (via the CS DropBox, dates subject to revision) Wednesday 15 March, Wednesday 5 April, Wednesday 3 May, Wednesday 24 May Page 2 of 43

Other matters Class representative Assignment extensions We will consider extensions to the assignment due date only for 1. Illness or other unforeseeable emergency 2. Conflicts with other assignments, but only if the request is made within one week of the assignment being distributed We will not be sympathetic if told The 314 assignment is due tomorrow and I have 3 other assignments also due then; can I please have an extension? The dates have been published weeks ahead; you should have planned your work better or arranged earlier for an extension Questions Your first contact for questions should be the tutor, not the lecturer. Also, you could ask on the class forum Email Email must include the course number (314) and your UPI Page 3 of 43

Approach to material This year we are following the textbook The lectures will provide in-depth discussion and comment on the course material. You should read the relevant sections in the textbook! The course does not cover all of the textbook. The sections that are covered are shown on the course outline, as it appears on the course web page Tutorials are scheduled (in lecture slots 24 and 35) before the terms test and the exam Changes to the course outline and/or content will be notified on the course web page Page 4 of 43

Approximate plan of course Week starting 27 Feb 2006 6 Mar 2006 13 Mar 2006 20 Mar 2006 27 Mar 2006 3 Apr 2006 10 Apr 2006 17 Apr 2006 24 Apr 2006 1 May 2006 8 May 2006 15 May 2006 22 May 2006 29 May 2006 5 Jun 2006 Monday 1 Introduction 4 Protocols 7 10 Compression 13 LANs, E/net 16 19 Security 21 WLANs 24 Tutorial (test) 27 IPv6 30 UDP, Streaming 33 VoIP Wednesday Friday 2 Basics 3 Protocols 5 Telephone 6 Analog Access 8 ISPs, PPP 9 Compression 11 Error Detect 12 Error Correct 14 Lan I/connect 15 VLANs 17 Security 18 Security 20 Web Security Easter Mid Semester Break Mid Semester Break 22 IP 23 Routing, DV 25 Routing, LS 26 Routing, BGP 28 TCP 29 TCP 31DNS 32 Email, FTP 34 Net Mgmt 35 Tutorial (exam) No lectures just lots of time to study Ass 1 due 15 Mar Ass 2 due 5 Apr Ass 3 due 3 May TEST: Mon 8 May Ass 4 due 24 May Page 5 of 43

1.1 Overview Data communications includes Telephones (PSTN, mobile) Entertainment networks (TV, cable, satellite) Data networks (LANs, WANs, Wireless, Internet) We concentrate on the Internet, but will mention the others briefly Our focus is on how things work, especially on the underlying protocols we won t look at how to configure a router, etc. We start by looking at the U Auckland campus network Page 6 of 43

A user connection into a network UTP cables Ports for connecting to other devices Hub: is a simple device, with little storage or processing Connections to other Hubs Bridge, switch or router: has considerable storage and processing; can filter messages and direct them by destination address Page 7 of 43

CS Network 2002 (omitting student stations) Page 8 of 43

Simple view of Computer Science Network, 2003 Disk Arrays 2,500 GB Gigabit Ethernet 1000 Mb/s University Connection Gigabit Ethernet Main CS Router Floor 5 Floor 4 Floor 3 Floor 2 Floor 1 5 Routers 24 ports 5 Routers 24 ports 5 Routers 24 ports 5 Routers 24 ports 8 Routers 24 ports 120 stations 120 stations 120 stations 120 stations 192 stations Servers etc. Ground 9 Routers 24 ports 216 stations Basement 8 Routers 24 ports 192 stations All final links are 10/100 Mb/s Ethernet Page 9 of 43

The University of Auckland Network 2006 Tamaki Epsom Grafton 10 Gb/s ring Internet ITSS 24 ITSS 58 Dual 1 Gb/s links Library HSB Engineerin Science Takapuna Page 10 of 43

Channels and link types Figure 1.4 Communication modes: (a) unicast Page 11 of 43

Packet Switching Network Figure 1.6 Packet-switching network principles: (b) connectionless Page 12 of 43

Quality of Service (QoS) Network Availability: what % of time is it available? Reliability: what error/loss rate is allowed? Delay: what are max, median propagation times? Application Packet loss rate: what % of packets can be lost without affecting application performance Delay Variation (jitter): how much variation is allowed? Voice Quality: measured subjectively using Mean Opinion Scores (MOS) Page 13 of 43

1.3 Communications basics Data is sent from / received by an interface on a device (e.g. a PC) It may be sent directly, using baseband transmission, or it may be mixed with a carrier signal, i.e. sent using modulated transmission The time taken to transmit one bit ( 0 or 1 ) is called the bit cell period. Within each such period, a receiver must decide whether the incoming bit is 1 or 0 Page 14 of 43

Figure 1.8 Modes of transmission: (a) baseband transmission Page 15 of 43

Figure 1.8 Modes of transmission: (b) modulated transmission Page 16 of 43

Copper media Figure 1.10 Copper wire transmission media: (a) unshielded twisted pair (UTP) Page 17 of 43

Optical media (fibre) Figure 1.11 Optical fiber transmission media: (a) cable structures Page 18 of 43

Figure 1.11 Optical fiber transmission media: (b) transmission modes Page 19 of 43

Important information on transmission of bits Bits, as electrical signals, always travel at a propagation speed of 300,000 km/s in free space (radio, satellites, etc) (30cm per nanosecond) 200,000 km/s on copper or fibre-optic cables (20cm per nanosecond) A faster link has the bits arriving more often (say 1000 per microsecond, rather than 100 per microsecond), but they never travel any faster. The circumference of the Earth is 40,000 km (by the definition of the metre) The distance from New Zealand to North America, South America, Japan or Singapore is close to 10,000 km. The delay or latency from New Zealand to almost anywhere except Australia is at least 1/20 second (50 ms). This delay cannot be reduced! Page 20 of 43

Distances between bits, on optical fibre Assume propagation speed of 200,000 km/s in glass fibre (These distances are nearly correct if the page is printed on A4 paper). OC-3 (155 Mb/s) 1.33 m 1.33 m OC-12 (622 Mb/s) 32 cm 32 cm 1 Gb/s 20 cm OC-48 (2.4 Gb/s) 8.3 cm 20 cm 8.3 cm OC-192 (9.6 Gb/s) 2.1 cm 2.1 cm Page 21 of 43

Asynchronous Transmission Transmitter and Receiver clocks must run at (nearly) the same rate Character starts when line voltage drops (next slide) Figure 1.15 Asynchronous transmission: (a) principle of operation Page 22 of 43

Figure 1.15 Asynchronous transmission: (b) timing principles Page 23 of 43

Figure 1.16 Examples of three different receiver clock rate ratios: (b) 4 Page 24 of 43

Framing (blocks of characters) Figure 1.17 Frame synchronization with different frame contents: (a) printable characters Page 25 of 43

Framing (non-printable characters) DLE = Data Link Escape DLE DLE DLE in data Figure 1.17 Frame synchronization with different frame contents: (b) string of bytes Page 26 of 43

Synchronous transmission Figure 1.18 Alternative bit/clock synchronization methods with synchronous transmission: (a) clock encoding Page 27 of 43

Manchester encodings Manchester Transition in middle of every bit cell Low-high 1, high-low 0 Differential Manchester Transition at start of cell next bit is a 0 Manchester encodings are balanced Long-term average value is 0, i.e. no DC component Signals can be AC coupled, simplifies the electronics Page 28 of 43

Figure 1.19 Synchronous transmission clock encoding methods: (a) Manchester; (b) differential Manchester Page 29 of 43

Synchronous character framing Figure 1.21 Character-oriented synchronous transmission: (a) frame format Page 30 of 43

Synchronous character framing Figure 1.21 Character-oriented synchronous transmission: (b) character synchronization Page 31 of 43

Synchronous character framing Figure 1.21 Character-oriented synchronous transmission: (c) data transparency (character stuffing) Page 32 of 43

Synchronous bit framing Flag has 6 consecutive 1 bits, other characters have 5 or less Add 0 bits after 5 consecutive 1s within frames Figure 1.22 Bit-oriented synchronous transmission: (a) framing structure Page 33 of 43

Synchronous bit stuffing Figure 1.22 Bit-oriented synchronous transmission: (b) zero bit insertion circuit location Page 34 of 43

1.4 Protocol basics Messages (frames) are sent out on the network They may suffer transmission errors, or may be lost in the network An error control protocol describes how the sender and receiver must co-operate in order to transmit the messages reliably The simplest type of error control protocol is Automatic Repeat Request (ARQ) We begin with Idle RQ Page 35 of 43

Idle RQ protocol Figure 1.23 ARQ error control scheme: (a) error free Page 36 of 43

Idle RQ protocol (2) Figure 1.23 ARQ error control scheme: (b) corrupted I-frame Page 37 of 43

Idle RQ protocol (3) Figure 1.23 ARQ error control scheme: (c) corrupted ACK-frame Page 38 of 43

Idle RQ protocol (4) Figure 1.24 Idle RQ link utilization Page 39 of 43

Idle RQ link utilisation Frame transmission time is proportional to the length of the total data transmitted (user + reply), including overheads (header + trailer) and is inversely proportional to the bit-rate on the link For long messages it contributes a time (U+A)/R For very short user messages the overheads 2(H+T) may become important Choosing a faster link affects only this time, allowing the data to be put into the link at more bits per second A faster link NEVER affects the transmission velocity or link latency; this is something which we just have to live with The frame propagation delay or link latency is dependent only on the distance or link length, D The transmission velocity V is almost always 300,000,000 m/s (3 10 8 m/s, the speed of light c) for radio 200,000,000 m/s (2 10 8 m/s, about 2/3c) for cables (either copper or optical) For transoceanic links the latency can be a very important value indeed Page 40 of 43

Idle RQ link utilisation example Assume: User data size U = 1000 bytes = 8000 bits Header/trailer overhead (H+T) = 30 octets = 240 bits Reply message size = 30 octets = 240 bits End to end cable length D = 1000 metres Signalling data rate R = 10 Mb/s (10 7 b/s) Signal velocity in cable V = 2 10 8 m/s Then End-to-end latency = 5 µs Time to send message = 8 1030/10 7 = 824 µs Time to send reply = 8 60/10 7 = 48.0 µs Total time to send 1000 user bytes (send + outward + reply + reverse) = 882.0 µs, Effective user data rate = 1.134 byte/µs Compare with naive prediction: 10 7 /8 = 1.25 byte/µs ( 9.3% reduction) Page 41 of 43

Link utilisation - comments A longer link, faster signalling rate and smaller packet can give a marked reduction in performance compared with the raw link speed, for ARQ protocols Extreme precision is seldom needed or even appropriate in these examples. Packet or data sizes vary widely and cable velocities are seldom known to better than ±1% anyway What s important is that you can give a good estimate of the effects of latency, packet overheads, etc The Earth s circumference is 40,000 km (original definition of the metre) The distance from New Zealand to North America, South America, Japan or Singapore is close to 10,000 km The delay or latency from New Zealand to almost anywhere except Australia is at least 1/20 second (10,000 / 200,000 = 50 ms) Page 42 of 43

Things to do in a network 1. Transmit bits from one place to another (Physical) 2. Assemble bits into bytes and messages, check for reliable transmission (Link) 3. Send messages between end-nodes in mesh-type network (Network) 4. In a mesh network, handle lost packets, broken links etc (Transport) 5. Handle extended connections between endpoints, LANs, etc. 6. Resolve differences between data representation in different computers 7. Do something useful (User application) These are the seven layers of the Open Systems Interconnection (OSI) communications model. TCP/IP (Internet) combines layers 5-7, into a single Application layer We discuss only layers 1-4 Page 43 of 43