cs3516-2-network-core-ps-cs - users.wpi.edu · introduction mesh of interconnected routers with...

14
1 CS 3516: Advanced Computer Networks Prof. Yanhua Li Welcome to Time: 9:00am –9:50am M, T, R, and F Location: Fuller 320 Fall 2017 A-term Some slides are originally from the course materials of the textbook “Computer Networking: A Top Down Approach”, 7th edition, by Jim Kurose, Keith Ross, Addison-Wesley March 2016. Copyright 1996-2017 J.F Kurose and K.W. Ross, All Rights Reserved.

Upload: trannga

Post on 20-Aug-2018

216 views

Category:

Documents


0 download

TRANSCRIPT

1

CS 3516: Advanced Computer Networks

Prof. Yanhua Li

Welcome to

Time: 9:00am –9:50am M, T, R, and FLocation: Fuller 320

Fall 2017 A-term

Some slides are originally from the course materials of the textbook “Computer Networking: A Top Down Approach”, 7th edition, by Jim Kurose, Keith Ross, Addison-Wesley March 2016. Copyright 1996-2017 J.F Kurose and K.W. Ross, All Rights Reserved.

Introduction

Chapter 1: roadmap1.1 what is the Internet?

“nuts and bolts” viewservice view

1.2 network edge§ end systems, access networks, links

1.3 network core§ packet switching, circuit switching, network structure

1-2

Introduction

mesh of interconnected routers with three key aspects in network core

§ Link: Switching, Resource allocation (chp 1.3)

§ Node: Routing & Forwarding (to be discussed in Network layer chp 4)

§ Network: Network Core Structure / Management / Coordination (chp 1.3)

The network core

1-3

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 ratehost

12

two packets, L bits each

packettransmission

delay

time needed totransmit L-bit

packet into linkL (bits)R (bits/sec)= =

1-4Introduction

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-5

sourceR bps destination

123

L bitsperpacket

R bps

§ end-end delay = 2L/R (assuming zero propagation delay)

Introduction

Packet Switching: queueing delay, loss

A

B

CR = 100 Mb/s

R = 1.5 Mb/s D

Equeue of packetswaiting for output link

1-6

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

Two key network-core functions

forwarding: move packets from router’s input to appropriate router output

Introduction 1-7

routing: determines source-destination route taken by packets

§ routing algorithms

routing algorithm

local forwarding tableheader value output link

0100010101111001

3221

123

destination address in arrivingpacket’s header

Introduction

Alternative core: circuit switchingend-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 networks1-8

Introduction

Circuit switching: FDM versus TDM

FDM

frequency

timeTDM

frequency

time

4 usersExample:

1-9

§ Pros: great for bursty data (advantages)• resource sharing• simpler, no call setup

§ Cons: excessive congestion possible:• packet delay and loss• protocols needed for reliable data transfer, congestion

control

is packet switching a “slam dunk winner?”

Q: human analogies of reserved resources (circuit switching) versus on-demand allocation (packet-switching)?

Like parking lots.

Packet switching versus circuit switching

1-10

Introduction

Packet switching versus circuit switching

example:§ 1 Mb/s link§ each user:

• 100 kb/s when “active”• active 10% of time

§ circuit-switching:• 10 users

§ packet switching:• with 35 users, probability >

10 active at same time is less than .0004 *

packet switching allows more users to use network!

Nusers

1 Mbps link

Q: how did we get value 0.0004?

1-11* Check out the online interactive exercises for more examples

Introduction

Three key aspects in network core

§ Link: Switching, Resource allocation (chp 1.3)

§ Node: Routing & Forwarding (to be discussed in Network layer chp 4)

§ Network: Network Core Structure / Management / Coordination (chp 1.3)

The network core

1-12

Introduction 1-13

Lab-assignment 1

http://users.wpi.edu/~yli15/courses/CS3516Fall17A/labs/Lab1/lab1.html

Transport (TCP/UDP)Network (IP)

Link (Ethernet)Physical

application(www browser,

email client)

application

OS

packetcapture(pcap)

packetanalyzer

copy of all Ethernet frames

sent/received