Computer Network Chapter 1, Lecture notes of Computer Networks

It is the first lecture notes which give an overview of the whole networking system in a top down approach including application layer, transport layer, network layer, link layer.

Typology: Lecture notes

2017/2018

Uploaded on 10/25/2018

hhheee
hhheee 🇭🇰

1 document

1 / 44

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
COMP 4621
Computer Communications and Networks
Fall 2018
Lectures and Tutorials
L-1
Instructor: Qian Zhang, http://www.cse.ust.hk/~qianzh/
Lectures: Tue 3:00pm 4:20pm
Thur 3:00pm 4:20pm
Venue: Rm 6573, Lift 29-30
Web site: http://course.cs.ust.hk/comp4621/
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c

Partial preview of the text

Download Computer Network Chapter 1 and more Lecture notes Computer Networks in PDF only on Docsity!

COMP 4621

Computer Communications and Networks

Fall 2018

Lectures and Tutorials

™ L- 1

ƒ Instructor: Qian Zhang, http://www.cse.ust.hk/~qianzh/ ƒ Lectures: Tue 3:00pm – 4:20pm Thur 3:00pm – 4:20pm ƒ Venue: Rm 6573, Lift 29 - 30 ™ Web site: http://course.cs.ust.hk/comp4621/

Lectures and Tutorials

™ Lecture notes and tutorial materials ƒ Download course materials before class ƒ Homework and programming assignment will be put online ™ Tutorial and Lab will start in week #4 (Sept 24/25, 2018) ƒ Lab 1 Tue 1 :30pm - 2:20pm Room 4214 (lift 19) ƒ Lab 2 Monday 12:00pm - 12:50pm Room 4214 (lift 19)

Textbook

™ Bottom Up : Start with physical (e.g., wires) layer and move up to applications (e.g., mail, web browsers) layer explaining how functions are implemented ™ Top Down : Start with Application layer and move down to Physical layer, explaining what expectations from applications, and how such services are implemented Application Transport Network Link Physical Computer Networking: A Top-Down Approach James Kurose and Keith Ross, Pearson (6th^ Ed.)

Plagiarism Policy

™ There are differences between collaborations or discussions and copy! ™ 1 st^ Time: all involved get ZERO marks, and reported to ARR ™ 2 nd^ Time: need to terminate (Fail grade) ™ Midterm or Final exam: an automatic FAIL

Course Prerequisite

™ COMP 3511 (COMP 252) OS or equivalent

ƒ Process and thread, DMA and interrupt, inter-process communications

™ Programming

ƒ UNIX environment ƒ C/C++ programming

Lecture Format

™ Lectures: ƒ Lecture notes are available before class ƒ It is important to attend the lectures (because not all materials and concepts are covered in slides) ƒ Learn from textbook ™ Tutorials ƒ Supplement the lectures with more examples ƒ Socket programming and project ™ Reading the corresponding materials in the textbook ƒ Slides do not cover everything ™ Chapter or sub-chapter summary ƒ These will be put online at the end of each chapter

Assignments

™ Written assignments ƒ Due by time specified ƒ Re-grade requests will only be entertained within one week after the homework are handed back ƒ Late policy: 15 % reduction, only one day delay is allowed. ™ Programming assignment ƒ Individual projects ƒ Due by time specified ƒ Run on Unix and submit it using CASS ƒ Re-grade policy will be announced ƒ Late policy : 15 % reduction, only one day delay is allowed.

Course Outline

™ Introduction (1 weeks) ƒ Internet, network edge and core, performance, history ™ Application Layer (2.5 weeks) ƒ Web, HTTP, E-mail and SMTP, DNS ƒ Peer-to-Peer applications, socket programming ™ Transport Layer (3 weeks) ƒ UDP and TCP ƒ Principles of congestion control, TCP congestion control ™ Network Layer (3 weeks) ƒ Virtual circuit, datagram, router, IP ƒ Routing protocols ™ Link Layer and Local Area Network (2.5 weeks) ƒ MAC, addressing ƒ Ethernet and link-layer switch Introduction

Chapter 1: introduction

our goal:

™ get “feel” and

terminology

™ more depth, detail

later in course

™ approach:

ƒ use Internet as

example

overview :

™ what’s the Internet? ™ what’s a protocol? ™ network edge; hosts, access net, physical media ™ network core: packet/circuit switching, Internet structure ™ performance: loss, delay, throughput ™ security ™ protocol layers, service models ™ history 1 - 14

Introduction

Chapter 1: roadmap

1.1 what is the Internet?

1.2 network edge

ƒ end systems, access networks, links

1.3 network core

ƒ packet switching, circuit switching, network structure

1.4 delay, loss, throughput in networks

1.5 protocol layers, service models

1.6 networks under attack: security

1.7 history

1 - 15 Introduction

What’s the Internet: “nuts and bolts” view

™ millions of connected computing devices: ƒ hosts = end systems ƒ running network apps ™ communication links ƒ fiber, copper, radio, satellite ƒ transmission rate: bandwidth ™ Packet switches: forward packets (chunks of data) ƒ routers and switches wired links wireless links router mobile network global ISP regional ISP home network institutional network smartphone PC server wireless laptop 1 - 16

What’s the Internet: a service view

™ Infrastructure that provides

services to applications:

ƒ Web, VoIP, email, games, e- commerce, social nets, …

™ provides programming

interface to apps

ƒ hooks that allow sending and receiving app programs to “connect” to Internet ƒ provides service options, analogous to postal service mobile network global ISP regional ISP home network institutional network Introduction 1 - 19 Introduction

What’s a protocol?

human protocols:

™ “what’s the time?” ™ “I have a question” ™ introductions … specific msgs sent … specific actions taken when msgs received, or other events

network protocols:

™ machines rather than humans ™ all communication activity in Internet governed by protocols

protocols define format, order

of msgs sent and received

among network entities,

and actions taken on msg

transmission, receipt

1 - 20

Introduction

a human protocol and a computer network protocol:

Q: other human protocols?

Hi Hi Got the time? 2: TCP connection response Get http://www.awl.com/kurose-ross time TCP connection request

What’s a protocol?

1 - 21 Introduction

Chapter 1: roadmap

1.1 what is the Internet?

1.2 network edge

ƒ end systems, access networks, links

1.3 network core

ƒ packet switching, circuit switching, network structure

1.4 delay, loss, throughput in networks

1.5 protocol layers, service models

1.6 networks under attack: security

1.7 history

1 - 22

Introduction Access net: digital subscriber line (DSL) central office ISP telephone network DSLAM voice, data transmitted at different frequencies over dedicated line to central office ™ use existing telephone line to central office DSLAM ƒ data over DSL phone line goes to Internet ƒ voice over DSL phone line goes to telephone net ™ < 2.5 Mbps upstream transmission rate (typically < 1 Mbps) ™ < 24 Mbps downstream transmission rate (typically < 10 Mbps) DSL modem splitter DSL access multiplexer 1 - 25 Introduction Access net: cable network cable modem splitter

cable headend Channels V I D E O V I D E O V I D E O V I D E O V I D E O V I D E O D A T A D A T A C O N T R O L 1 2 3 4 5 6 7 8 9 frequency division multiplexing: different channels transmitted in different frequency bands 1 - 26

Introduction data, TV transmitted at different frequencies over shared cable distribution network cable modem splitter

cable headend CMTS ISP cable modem termination system ™ HFC: hybrid fiber coax ƒ asymmetric: up to 30Mbps downstream transmission rate, 2 Mbps upstream transmission rate ™ network of cable, fiber attaches homes to ISP router ƒ homes share access network to cable headend ƒ unlike DSL, which has dedicated access to central office Access net: cable network 1 - 27 Introduction Access net: home network to/from headend or central office cable or DSL modem router, firewall, NAT wired Ethernet (100 Mbps) wireless access point (54 Mbps) wireless devices often combined in single box 1 - 28

Host: sends packets of data host sending function: ™ takes application message ™ breaks into smaller chunks, known as packets , of length L bits ™ transmits packet into access network at transmission rate R ƒ link transmission rate, aka link capacity, aka link bandwidth R: link transmission rate host 21 two packets, L bits each packet transmission delay time needed to transmit L - bit packet into link L (bits) R (bits/sec)

1 - 31 Introduction Physical media ™ bit: propagates between transmitter/receiver pairs ™ physical link: what lies between transmitter & receiver ™ guided media: ƒ signals propagate in solid media: copper, fiber, coax ™ unguided media: ƒ signals propagate freely, e.g., radio twisted pair (TP) ™ two insulated copper wires ƒ Category 5: 100 Mbps, 1 Gpbs Ethernet ƒ Category 6: 10Gbps 1 - 32

Introduction Physical media: coax, fiber

coaxial cable:

™ two concentric copper conductors ™ bidirectional ™ broadband: ƒ multiple channels on cable ƒ HFC

fiber optic cable:

™ glass fiber carrying light pulses, each pulse a bit ™ high-speed operation: ƒ high-speed point-to-point transmission (e.g., 10’s- 100 ’s Gpbs transmission rate) ™ low error rate: ƒ repeaters spaced far apart ƒ immune to electromagnetic noise 1 - 33 Introduction Physical media: radio ™ signal carried in electromagnetic spectrum ™ no physical “wire” ™ bidirectional ™ propagation environment effects: ƒ reflection ƒ obstruction by objects ƒ interference

radio link types:

™ terrestrial microwave ƒ e.g. up to 45 Mbps channels ™ LAN (e.g., WiFi) ƒ 11Mbps, 54 Mbps ™ wide-area (e.g., cellular) ƒ 3G cellular: ~ few Mbps ™ satellite ƒ Kbps to 45Mbps channel (or multiple smaller channels) ƒ 270 msec end-end delay ƒ geosynchronous versus low altitude 1 - 34

Introduction Packet-switching: store-and-forward ™ takes L / R seconds to transmit (push out) L - bit packet into link at R bps ™ store and forward: entire packet must arrive at router before it can be transmitted on next link one-hop numerical example: ƒ L = 7.5 Mbits ƒ R = 1.5 Mbps ƒ one-hop transmission delay = 5 sec more on delay shortly … 1 - 37 source R bps destination 321 L bits per packet R bps ™ end-end delay = 2 L / R (assuming zero propagation delay) Introduction Packet Switching: queueing delay, loss A B R = 100 Mb/s^ C R = 1.5 Mb/s

D

queue of packets^ E waiting for output link 1 - 38

queuing and loss:

™ If arrival rate (in bits) to link exceeds transmission rate of link for a period of time: ƒ packets will queue, wait to be transmitted on link ƒ packets can be dropped (lost) if memory (buffer) fills up

Network Layer 4 - 39

Two key network-core functions

forwarding: move packets from

router’s input to appropriate router output

routing: determines source-

destination route taken by packets ƒ routing algorithms routing algorithm local forwarding table header value output link 0100 0101 0111 1001 3 2 2 1 1 3 2 dest address in arriving packet’s header Introduction

Alternative core: circuit switching

end-end resources allocated

to, reserved for “call”

between source & dest:

™ In diagram, each link has four circuits. ƒ call gets 2nd^ circuit in top link and 1st^ circuit in right link. ™ dedicated resources: no sharing ƒ circuit-like (guaranteed) performance ™ circuit segment idle if not used by call (no sharing) ™ Commonly used in traditional telephone networks 1 - 40