Introduction to Computer Networks

(CSE 3201)
3 Credits

Course Instructor:
Raihan Tanvir
Lecturer (Grade-I), CSE, AUST
[email protected]

Introduction 1-1
Book: Computer Networking – A Top Down Approach – Featuring
the Internet by J. Kurose and K. Ross (6E)

Reference books:
1. Data Communications and networking by Forouzan
2. “Computer Networks” written by ‘Andrew S. Tanenbaum’, Published
byMcGraw-Hill, 5th edition.
3. Resources from Internet

Introduction 1-2
Course Administration
Class Test exams ( 20 marks):
* best 3 will be counted out of 4 exams

Class Attendance and Performance (10 Marks):

Final Examination (70 Marks):

Introduction 1-3
Chapter 1
Introduction

A note on the use of these ppt slides:

Computer
We’re making these slides freely available to all (faculty, students, readers).
They’re in PowerPoint form so you see the animations; and can add, modify,
Networking: A
and delete slides (including this one) and slide content to suit your needs.
They obviously represent a lot of work on our part. In return for use, we only
Top Down
ask the following:
 If you use these slides (e.g., in a class) that you mention their source
Approach
(after all, we’d like people to use our book!) 6th edition
 If you post any slides on a www site, that you note that they are adapted Jim Kurose, Keith
from (or perhaps identical to) our slides, and note our copyright of this
material.
Ross
Addison-Wesley
Thanks and enjoy! JFK/KWR
March 2012
All material copyright 1996-2012
J.F Kurose and K.W. Ross, All Rights Reserved

Introduction 1-4
Chapter 1: introduction
our goal: overview:
 get “feel” and  what’s the Internet?
terminology  what’s a protocol?
 more depth,
 network edge; hosts, access
net, physical media
detail later in  network core: packet/circuit
course switching, Internet structure
 approach:  performance: loss, delay,
 use Internet throughput
 security
as example  protocol layers, service
models
 history
Introduction 1-5
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

Introduction 1-6
What’s the Internet: “nuts and bolts” view

PC  millions of connected mobile network

server computing devices:
 hosts = end systems
wireless global ISP
laptop  running network apps
smartphone
home
 communication network
regional ISP
wireless
links
links  fiber, copper,
wired
links radio, satellite
 transmission
rate: bandwidth
 Packet switches:
router forward packets institutional
network
(chunks of data)
 routers and
Introduction 1-7
What’s the Internet: “nuts and bolts” view

mobile network
 Internet: “network of
networks”
 Interconnected ISPs global ISP

 protocols control sending,

receiving of msgs home
 e.g., TCP, IP, HTTP, Skype, network
regional ISP
802.11
 Internet standards
 RFC: Request for comments
 IETF: Internet Engineering
Task Force

institutional
network

Introduction 1-8
What’s the Internet: a service view
mobile network
 Infrastructure that
provides services to global ISP
applications:
 Web, VoIP, email,
home
games, e-commerce, network
social nets, … regional ISP

 provides programming
interface to apps
 hooks that allow
sending and receiving
app programs to
“connect” to Internet
institutional
network

Introduction 1-9
What’s a protocol?
human protocols: network protocols:
 “what’s the time?”  machines rather
 “I have a question” than humans
 introductions  all communication
activity in Internet
governed by
… specific msgs sent protocols
… specific actions
taken when msgs protocols define format,
received, or other order of msgs sent and
events
received among
network entities, and
actions taken on msg
transmission, receipt
Introduction 1-10
What’s a protocol?
a human protocol and a computer network protocol:

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

Q: other human protocols?

Introduction 1-11
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

Introduction 1-12
A closer look at network structure:

 network edge: mobile network

 hosts: clients and

global ISP
servers
 servers often in data
centers home
 access networks, network
regional ISP
physical media:
wired, wireless
communication links

 network core:
 interconnected
routers institutional
 network of network

networks
Introduction 1-13
Access networks and physical media

Q: How to connect
end systems to
edge router?
 residential access
nets
 institutional access
networks (school,
company)
 mobile access
networks
keep in mind:
 bandwidth (bits per
second) of access
network?
Introduction 1-14
 shared or dedicated?
Enterprise access networks (Ethernet)

institutional link to
ISP (Internet)
institutional router

Ethernet institutional mail,

switch web servers

 typically used in companies, universities, etc

 10 Mbps, 100Mbps, 1Gbps, 10Gbps transmission
rates
 today, end systems typically connect into
Ethernet switch
Introduction 1-15
Wireless access networks
 shared wireless access network connects end system to
router
 via base station aka “access point”

wireless LANs: wide-area wireless access

 within building (100 ft)  provided by telco (cellular)
 802.11b/g (WiFi): 11, 54 operator, 10’s km
Mbps transmission rate  between 1 and 10 Mbps
 3G, 4G

to Internet

to Internet

Introduction 1-16
Host: sends packets of data
host sending function:
takes application
message
two packets,
breaks into smaller
L bits each
chunks, known as packets,
of length L bits
transmits packet into
access network at 2 1
transmission rate R
 link transmission rate, R: link transmission rate
host
aka link capacity, aka
link bandwidth

packet time needed to L (bits)

transmission = transmit L-bit =
delay packet into link R (bits/sec)
1-17
Physical media
 bit: propagates between
transmitter/receiver
pairs twisted pair (TP)
 physical link: what lies  two insulated copper
between transmitter & wires
receiver  Category 5: 100 Mbps,
 guided media: 1 Gpbs Ethernet
 signals propagate in
 Category 6: 10Gbps
solid media: copper,
fiber, coax
 unguided media:
 signals propagate
freely, e.g., radio

Introduction 1-18
Physical media: coax, fiber
coaxial cable: fiber optic cable:
 two concentric copper  glass fiber carrying
conductors light pulses, each pulse
 bidirectional a bit
 broadband:  high-speed operation:
 multiple channels on  high-speed point-to-point
cable transmission (e.g., 10’s-
 HFC 100’s Gpbs transmission
rate)
 low error rate:
 repeaters spaced far
apart
 immune to
electromagnetic noise

Introduction 1-19
Physical media: radio
 signal carried in radio link types:
electromagnetic  LAN (e.g., WiFi)
spectrum  11Mbps, 54 Mbps
 no physical “wire”  wide-area (e.g., cellular)
 bidirectional  3G cellular: ~ few Mbps
 propagation  satellite
environment effects:  Kbps to 45Mbps channel
 reflection (or multiple smaller
channels)
 obstruction by  270 msec end-end delay
objects
 interference

Introduction 1-20
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

Introduction 1-21
The network core
 mesh of
interconnected routers
 packet-switching: hosts
break application-layer
messages into packets
 forward packets from
one router to the next,
across links on path
from source to
destination
 each packet transmitted
at full link capacity

Introduction 1-22
Packet-switching: store-and-forward

L bits
per packet

3 2 1
source destination
R bps R bps

 takes L/R seconds to one-hop numerical

transmit (push out) L- example:
bit packet into link at R
 L = 7.5 Mbits
bps
 R = 1.5 Mbps
 store and forward:
entire packet must  one-hop
arrive at router before transmission delay
 end-end
it can bedelay = 2L/R
transmitted = 5 sec
(assuming
on next linkzero more on delay shortly …
propagation delay) Introduction 1-23
Packet Switching: queueing delay,
loss
R = 100 Mb/s C
A
D
R = 1.5 Mb/s
B
queue of packets E
waiting for output link

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
Introduction 1-24
Two key network-core functions
routing: determines forwarding: move
source-destination route packets from router’s
taken by packets input to appropriate
 routing algorithms router output

routing algorithm

local forwarding table

header output link
value0100 3 1
0101 2
0111 2 3 2
1001 1

11
01
dest address in arriving
packet’s header
Network Layer 4-25
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) Introduction 1-26
Circuit switching: FDM versus TDM

Example:
FDM
4 users

frequency

time
TDM

frequency

time
Introduction 1-27
Packet switching versus circuit switching
packet switching allows more users to use network!

example:
 1 Mb/s link
N

…..
 each user:
users
• 100 kb/s when “active”
• active 10% of time 1 Mbps link

 circuit-switching:
 10 users
 packet switching: Q: how did we get value 0.00
 with 35 users,
probability > 10 active Q: what happens if > 35 use
at same time is less
than .0004 *
* Check out the online interactive exercises for more examples Introduction 1-28
Packet switching versus circuit switching

is packet switching a “slam dunk winner?”

 great for bursty data
 resource sharing
 simpler, no call setup
 excessive congestion possible: packet delay and
loss
 protocols needed for reliable data transfer,
congestion control
 Q: How to provide circuit-like behavior?
 bandwidth guarantees needed for audio/video
apps
 still an unsolved problem (chapter 7)
Q: human analogies of reserved resources (circuit
switching) versus on-demand allocation (packet-
switching)? Introduction 1-29
Internet structure: network of networks

 End systems connect to Internet via access ISPs

(Internet Service Providers)
 Residential, company and university ISPs
 Access ISPs in turn must be interconnected.
 So that any two hosts can send packets to
each other
 Resulting network of networks is very complex
 Evolution was driven by economics and
national policies
 Let’s take a stepwise approach to describe
current Internet structure
Internet structure: network of networks
Question: given millions of access ISPs, how to
connect them together?
… access
net
access
net …
access
net
access
access net
net
access
access net
net

…
…

access access
net net

access
net
access
net

access
net
access
net
… access access …
net access net
net
Internet structure: network of networks
Option: connect each access ISP to every other
access ISP?
… access
net
access
net …
access
net
access
access net
net

access … … access
net
net

connecting each access ISP

…
…

to each other directly doesn’t

…
access access
net
net
scale: O(N2) connections.
…

access
net
access
net

access
net
access
…

net
… access access …
net access net
net
Internet structure: network of networks
Option: connect each access ISP to a global transit ISP?
Customer and provider ISPs have economic agreement.
… access
net
access
net …
access
net
access
access net
net
access
access net
net

…
…

global
access
net ISP access
net

access
net
access
net

access
net
access
net
… access access …
net access net
net
Internet structure: network of networks
But if one global ISP is viable business, there will be
competitors ….
… access
net
access
net …
access
net
access
access net
net
access
access net
net
ISP A

…
…

access access
net ISP B net

ISP C
access
net
access
net

access
net
access
net
… access access …
net access net
net
Internet structure: network of networks
But if one global ISP is viable business, there will be
competitors …. which must be interconnected
… access
net
access
net …
Internet exchange point
access
net
access
access net
net
access
access
net
IXP net

ISP A

…
…

access IXP access

net ISP B net

ISP C
access
net
access

peering link
net

access
net
access
net
… access access …
net access net
net
Internet structure: network of networks
… and regional networks may arise to connect access
nets to ISPS
… access
net
access
net …
access
net
access
access net
net
access
access
net
IXP net

ISP A

…
…

access IXP access

net ISP B net

ISP C
access
net
access
net

access regional net

net
access
net
… access access …
net access net
net
Internet structure: network of networks
… and content provider networks (e.g., Google, Microsoft, Akamai )
may run their own network, to bring services, content close to end users

… access
net
access
net …
access
net
access
access net
net
access
access
net
IXP net

ISP A

…
…

Content provider network

access IXP access
net ISP B net

ISP B
access
net
access
net

access regional net

net
access
net
… access access …
net access net
net
 Internet structure: network of networks

Tier 1 ISP Tier 1 ISP Google

IXP IXP IXP

Regional ISP Regional ISP

access access access access access access access access

ISP ISP ISP ISP ISP ISP ISP ISP

 at center: small # of well-connected large networks

 “tier-1” commercial ISPs (e.g., Level 3, Sprint, AT&T, NTT),
national & international coverage
 content provider network (e.g, Google): private network
that connects it data centers to Internet, often bypassing
Introduction 1-38
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

Introduction 1-39
How do loss and delay occur?
packets queue in router buffers
 packet arrival rate to link (temporarily) exceeds
output link capacity
 packets queue, wait for turn
packet being transmitted (delay)

B
packets queueing (delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers

Introduction 1-40
Four sources of packet delay
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dproc: nodal dqueue: queueing

processing delay
 check bit errors  time waiting at
 determine output output link for
link transmission
 typically < msec  depends on Introduction 1-41
Four sources of packet delay
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dtrans: transmission dprop: propagation delay:

delay:  d: length of physical link
 L: packet length (bits)  s: propagation speed in
dtrans and dprop
 R: link bandwidth (bps) medium (~2x108 m/sec)
very different  dprop = d/s
 dtrans = L/R

* Check out the Java applet for an interactive animation on trans vs. prop delay Introduction 1-42
Caravan analogy
100 km 100 km
ten-car toll toll
caravan booth booth

 cars “propagate” at  time to “push”

100 km/hr entire caravan
 toll booth takes 12 sec through toll booth
to service car (bit onto highway =
12*10 = 120 sec
transmission time)  time for last car to
 car~bit; caravan ~ propagate from 1st
packet to 2nd toll both:
 Q: How long until 100km/(100km/hr)=
caravan is lined up 1 hr
before 2nd toll booth?  A: 62 minutes
Introduction 1-43
Caravan analogy (more)
100 km 100 km
ten-car toll toll
caravan booth booth

 suppose cars now “propagate” at 1000 km/hr

 and suppose toll booth now takes one min to
service a car
 Q: Will cars arrive to 2nd booth before all cars
serviced at first booth?
 A: Yes! after 7 min, 1st car arrives at second
booth; three cars still at 1st booth.

Introduction 1-44
Queueing delay (revisited)

average queueing
R: link bandwidth (bps)

delay
L: packet length (bits)
a: average packet
arrival rate
traffic intensity
= La/R

 La/R ~ 0: avg. queueing delay small La/R ~ 0

 La/R -> 1: avg. queueing delay large
 La/R > 1: more “work” arriving
than can be serviced, average delay
infinite!
La/R -> 1
* Check online interactive animation on queuing and loss
Introduction 1-45
“Real” Internet delays and
routes
 what do “real” Internet delay & loss look like?
 traceroute program: provides delay
measurement from source to router along end-
end Internet path towards destination. For all i:
 sends three packets that will reach router i on path
towards destination
 router i will return packets to sender
 sender times interval between transmission and
reply.

3 probes 3 probes

3 probes

Introduction 1-46
“Real” Internet delays, routes
traceroute: gaia.cs.umass.edu to www.eurecom.fr
3 delay measurements from
gaia.cs.umass.edu to cs-gw.cs.umass.edu
1 cs-gw (128.119.240.254) 1 ms 1 ms 2 ms
2 border1-rt-fa5-1-0.gw.umass.edu (128.119.3.145) 1 ms 1 ms 2 ms
3 cht-vbns.gw.umass.edu (128.119.3.130) 6 ms 5 ms 5 ms
4 jn1-at1-0-0-19.wor.vbns.net (204.147.132.129) 16 ms 11 ms 13 ms
5 jn1-so7-0-0-0.wae.vbns.net (204.147.136.136) 21 ms 18 ms 18 ms
6 abilene-vbns.abilene.ucaid.edu (198.32.11.9) 22 ms 18 ms 22 ms
7 nycm-wash.abilene.ucaid.edu (198.32.8.46) 22 ms 22 ms 22 ms trans-oceanic
8 62.40.103.253 (62.40.103.253) 104 ms 109 ms 106 ms
9 de2-1.de1.de.geant.net (62.40.96.129) 109 ms 102 ms 104 ms link
10 de.fr1.fr.geant.net (62.40.96.50) 113 ms 121 ms 114 ms
11 renater-gw.fr1.fr.geant.net (62.40.103.54) 112 ms 114 ms 112 ms
12 nio-n2.cssi.renater.fr (193.51.206.13) 111 ms 114 ms 116 ms
13 nice.cssi.renater.fr (195.220.98.102) 123 ms 125 ms 124 ms
14 r3t2-nice.cssi.renater.fr (195.220.98.110) 126 ms 126 ms 124 ms
15 eurecom-valbonne.r3t2.ft.net (193.48.50.54) 135 ms 128 ms 133 ms
16 194.214.211.25 (194.214.211.25) 126 ms 128 ms 126 ms
17 * * *
18 * * * * means no response (probe lost, router not replying)
19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms

* Do some traceroutes from exotic countries at www.traceroute.org

Introduction 1-47
Packet loss
 queue (aka buffer) preceding link in buffer
has finite capacity
 packet arriving to full queue dropped (aka
lost)
 lost packet may be retransmitted by
previous node, by source end system, or
not at all
buffer
(waiting area) packet being transmitted
A

B
packet arriving to
full buffer is lost
* Check out the Java applet for an interactive animation on queuing and loss Introduction 1-48
 Throughput
 throughput: rate (bits/time unit) at which
bits transferred between sender/receiver
 instantaneous: rate at given point in time
 average: rate over longer period of time

server, with
server sends link capacity
pipe that can carry link capacity
pipe that can carry
file ofbits
F bits fluid at rate
Rs bits/sec fluid at rate
Rc bits/sec
to(fluid)
send into
to client
pipe Rs bits/sec) Rc bits/sec)

Introduction 1-49
Throughput (more)
 Rs < Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

 Rs > Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

bottleneck
link on link
end-end path that constrains end-end
throughput
Introduction 1-50
Throughput: Internet scenario

 per-connection
end-end Rs
throughput: Rs Rs
min(Rc,Rs,R/10)
 in practice: R or
c R
Rs is often
bottleneck Rc Rc

Rc

10 connections (fairly) share

backbone bottleneck link R bits/sec
Introduction 1-51
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

Introduction 1-52
Protocol “layers”
Networks are
complex,
with many
“pieces”: Question:
 hosts is there any hope of
organizing structure of
 routers network?
 links of various
media …. or at least our
 applications discussion of networks?
 protocols
 hardware,
software
Introduction 1-53
Organization of air travel
ticket (purchase) ticket (complain)

baggage (check) baggage (claim)

gates (load) gates (unload)

runway takeoff runway landing

airplane routing airplane routing

airplane routing

 a series of steps

Introduction 1-54
Layering of airline functionality

ticket (purchase) ticket (complain) ticket

baggage (check) baggage (claim baggage

gates (load) gates (unload) gate

runway (takeoff) runway (land) takeoff/landing

airplane routing airplane routing airplane routing airplane routing airplane routing

departure intermediate air-traffic arrival

airport control centers airport

layers: each layer implements a service

 via its own internal-layer actions
 relying on services provided by layer
below
Introduction 1-55
Why layering?
dealing with complex systems:
 explicit structure allows identification,
relationship of complex system’s pieces
 layered reference model for discussion
 modularization eases maintenance,
updating of system
 change of implementation of layer’s service
transparent to rest of system
 e.g., change in gate procedure doesn’t
affect rest of system
 layering considered harmful?

Introduction 1-56
Internet protocol stack
 application: supporting
network applications
 FTP, SMTP, HTTP application
 transport: process-process
data transfer transport
 TCP, UDP
network
 network: routing of
datagrams from source to
destination link
 IP, routing protocols
physical
 link: data transfer between
neighboring network
elements
 Ethernet, 802.111 (WiFi), PPP
Introduction 1-57

ISO/OSI reference model
 presentation: allow
applications to interpret application
meaning of data, e.g.,
encryption, compression, presentation
machine-specific
conventions session
 session: synchronization, transport
checkpointing, recovery of
network
data exchange
 Internet stack “missing” link
these layers! physical
 these services, if needed, must
be implemented in application
 needed?

Introduction 1-58
 source
message M application
Encapsulation
segment Ht M transport
datagram Hn Ht M network
frame Hl Hn Ht M link
physical
link
physical

switch

destination Hn Ht M network
M application
Hl Hn Ht M link Hn Ht M
Ht M transport physical
Hn Ht M network
Hl Hn Ht M link router
physical

Introduction 1-59
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

Introduction 1-60
Network security
 field of network security:
 how bad guys can attack computer
networks
 how we can defend networks against
attacks
 how to design architectures that are
immune to attacks
 Internet not originally designed with
(much) security in mind
 original vision: “a group of mutually trusting
users attached to a transparent network” 
 Internet protocol designers playing “catch-
up”
 security considerations in all layers!
Introduction 1-61
Bad guys: put malware into hosts via
Internet
 Malware: A type of malicious code/software
that can be used to obtain sensitive information,
or delete or modify files.
 malware can get in host from:
 virus: self-replicating infection by
receiving/executing object (e.g., e-mail
attachment)
 A virus attaches itself to some sort of executable
code/program.
 worm: self-replicating infection by passively
receiving object that gets itself executed (e.g.,
spread through vulnerable network)
 Worm can live on their own instead of attaching itself
onto something else.
Introduction 1-62
Bad guys: put malware into hosts via
Internet
 Trojan Horse: A malware that disguises
itself as one thing but does something
else.
 spyware malware can record
keystrokes, web sites visited, upload
info to collection site.
 Spy on you. Monitoring your activities.
 Ransomware: A type of attack that
holds your data or system hostage until
you pay some sort of ransom/money.

Introduction 1-63
Bad guys: attack server, network infrastructure

Denial of Service (DoS): attackers make resources

(server, bandwidth) unavailable to legitimate traffic
by overwhelming resource with bogus traffic

1. select target
2. break into hosts around
the network (see botnet)

3. send packets to target

from compromised
hosts target

Introduction 1-64
Bad guys can sniff packets
packet “sniffing”:
 broadcast media (shared Ethernet, wireless)
 promiscuous network interface reads/records all
packets (e.g., including passwords!) passing by

A C

src:B dest:A payload

B
 wireshark software is a (free) packet-sniffer

Introduction 1-65
 Bad guys can use fake
addresses
IP spoofing: send packet with false source
address
A C

src:B dest:A payload

… lots more on security (throughout, Chapter 8)

Introduction 1-66
Bad guys can do Phishing
Attack
Phishing Attack: malicious email, like-
giving a fake bank account link for
password reset

Introduction 1-67
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

Introduction 1-68
Introduction: summary
covered a “ton” of you now have:
material! context, overview,
Internet overview “feel” of networking
what’s a protocol? more depth, detail to
network edge, core, access follow!
network
packet-switching versus
circuit-switching
Internet structure
performance: loss, delay,
throughput
layering, service models
security
history
Introduction 1-69
Chapter 1
Additional
Slides

Introduction 1-70
 application
(www browser,
packet
email client)
analyzer
application

OS
packet Transport (TCP/UDP)
capture copy of all Network (IP)
Ethernet
Link (Ethernet)
(pcap) frames
sent/receive Physical
d