Chapter 1

Overview of
Computer Network

A note on the use of these ppt slides:

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,
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
Computer Networking:
ask the following: A Top Down Approach ,
 If you use these slides (e.g., in a class) that you mention their source
(after all, we’d like people to use our book!)
5th edition.
 If you post any slides on a www site, that you note that they are adapted Jim Kurose, Keith Ross
from (or perhaps identical to) our slides, and note our copyright of this
material.
Addison-Wesley, April
2009.
Thanks and enjoy! JFK/KWR

All material copyright 1996-2012

J.F Kurose and K.W. Ross, All Rights Reserved

Introduction 1-1
Chapter 1: Introduction
Our goal: Overview:
 get “feel” and  what’s the Internet?
terminology
 what’s a protocol?
 more depth, detail
later in course  network edge; hosts, access
 approach:
net, physical media
 use Internet as  network core: packet/circuit
example switching, Internet structure
 performance: loss, delay,
throughput
 security
 protocol layers, service models
 history
Introduction 1-2
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
 end systems, access networks, links
1.3 Network core
 circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched
networks
1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History

Introduction 1-3
What’s the Internet: “nuts and bolts” view
PC  millions of connected Mobile network
server computing devices: Global ISP
wireless hosts = end systems
laptop
 running network
cellular
handheld apps Home network
Regional ISP
 communication links
access  fiber, copper,
points
wired
radio, satellite Institutional network
links
 transmission
rate = bandwidth
 routers: forward
router
packets (chunks of
data)
Introduction 1-4
“Cool” internet appliances

IP picture frame
http://www.ceiva.com/

Web-enabled toaster +
weather forecaster

World’s smallest web Internet

server refrigerator
http://www- Internet phones
ccs.cs.umass.edu/~shri/iPi
c.html Introduction 1-5
Q/A
1. what do yout think about internet of things ?
2. What are the benefits of using IoT
technology for humans?
3. What are the challenges in using IoT
technology?
4. provide examples of IoT applications for the
future

Introduction 1-6
 Network Component
The Network System consists of 5 interconnected
components, namely:
1. Hardware / Network equipment consists of Data
Terminating Equipment (DTE): the starting and ending
place of sending and receiving data, for example: PC,
laptop, server, host, printer, etc. Data communicating
equipment (DCE) as an interface / network core, for
example router, switch, modem, hub
2. Software / Network operating system
3. Transmission medium / transmission link such as cable
and wireless
4. Communication protocol
5. Content / message sent / received

Introduction 1-7
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-8
What’s a protocol?
human protocols: network protocols:
 “what’s the time?”  machines rather than
 “I have a question” humans
 introductions  all communication
activity in Internet
… specific msgs sent governed by protocols
… specific actions taken protocols define format, order
when msgs received, of msgs sent and received
or other events among network entities,
and actions taken on msg
transmission, receipt
Introduction 1-9
What’s a protocol?
Basically, communication protocols can be divided into 3
stages, namely
1. the initiation stage or pre-establishment stage,
2. the message delivery stage, and
3. the connection termination stage.

Introduction 1-10
 Internet structure: network of networks
 roughly hierarchical
 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
 See warrior of the net film
 at center: “tier-1” ISPs (e.g., Verizon, Sprint, AT&T, Cable and
Wireless), national/international coverage
 treat each other as equals

Tier-1
providers
Tier 1 ISP
interconnect
(peer)
privately
Tier 1 ISP Tier 1 ISP
Introduction 1-11
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 access
net net
access
net
access
access net
net

access
IXP access
net
net
ISP A
Content provider network
access IXP access
net ISP B net

access
ISP B
net
access
net

access
net regional net
access
net
access access
net access net
net
Tier-1 ISP: e.g., Sprint
POP: point-of-presence

to/from backbone

peering
… …
.
…
…

to/from customers

Introduction 1-13
 Internet structure: network of networks

 “Tier-2” ISPs: smaller (often regional) ISPs

 Connect to one or more tier-1 ISPs, possibly other tier-2 ISPs

Tier-2 ISPs
Tier-2 ISP pays Tier-2 ISP also peer
Tier-2 ISP privately with
tier-1 ISP for
connectivity to Tier 1 ISP each other.
rest of Internet
 tier-2 ISP is
customer of
tier-1 provider Tier 1 ISP Tier 1 ISP Tier-2 ISP

Tier-2 ISP Tier-2 ISP

Introduction 1-14
 Internet structure: network of networks

 “Tier-3” ISPs and local ISPs

 last hop (“access”) network (closest to end systems)

local
ISP Tier 3 local
local local
ISP ISP
ISP ISP
Local and tier- Tier-2 ISP Tier-2 ISP
3 ISPs are
customers of Tier 1 ISP
higher tier
ISPs
connecting
them to rest
Tier 1 ISP Tier 1 ISP Tier-2 ISP
of Internet
local
Tier-2 ISP Tier-2 ISP
ISP
local local local
ISP ISP ISP Introduction 1-15
 Internet structure: network of networks

 a packet passes through many networks!

local
ISP Tier 3 local
local local
ISP ISP
ISP ISP
Tier-2 ISP Tier-2 ISP

Tier 1 ISP

Tier 1 ISP Tier 1 ISP Tier-2 ISP

local
Tier-2 ISP Tier-2 ISP
ISP
local local local
ISP ISP ISP Introduction 1-16
A closer look at network structure:

 network edge: mobile network

 hosts: clients and global ISP

servers
 servers often in data
home
centers network
regional ISP
 access networks, physical
media: wired, wireless
communication links
 network core:
 interconnected routers
 network of networks institutional
network

Introduction 1-17
 The network edge:
 end systems (hosts):
 run application programs
 e.g. Web, email
 at “edge of network” peer-peer

 client/server model
 client host requests, receives
service from always-on server
client/server
 e.g. Web browser/server;
email client/server
 peer-peer model:
 minimal (or no) use of
dedicated servers
 e.g. Skype, BitTorrent

Introduction 1-18
Q/A
 explain what are the advantages and
disadvantages of client/server model based
network services
 explain what are the advantages and
disadvantages of peer to peer model based
network services

Introduction 1-19
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?
 shared or dedicated?
Introduction 1-20
Q/A
 What is the difference between data
transfer speeds in terms of bandwidth,
throughput, and goodput?
 What is the difference between the terms
internet, intranet and extranet? and give
examples

Introduction 1-21
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-22
Wireless access networks
 shared wireless access network connects end system to router
 via base station aka “access point”

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

to Internet

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

packet time needed to L (bits)

transmission = transmit L-bit =
delay packet into link R (bits/sec)
1-24
Physical Media
Twisted Pair (TP)
 Bit: propagates between  two insulated copper
transmitter/rcvr pairs wires
 physical link: what lies  Category 3: traditional
between transmitter & phone wires, 10 Mbps
receiver Ethernet
Category 5:
 guided media:

100Mbps Ethernet
 signals propagate in solid
 Cat6 : 1Gbps
media: copper, fiber, coax
 unguided media:
 signals propagate freely,
e.g., radio

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

Introduction 1-26
Physical media: radio
 signal carried in Radio link types:
electromagnetic  terrestrial microwave
spectrum  e.g. up to 45 Mbps channels

 no physical “wire”  LAN (e.g., Wifi)

 bidirectional  11Mbps, 54 Mbps

 propagation  wide-area (e.g., cellular)

environment effects:  3G cellular: ~ 1 Mbps

 reflection  satellite
 obstruction by objects  Kbps to 45Mbps channel (or
 interference multiple smaller channels)
 270 msec end-end delay
 geosynchronous versus low
altitude
Introduction 1-27
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
 end systems, access networks, links
1.3 Network core
 circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched
networks
1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History

Introduction 1-28
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-29
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
Introduction 1-30
Circuit Switching: FDM and TDM
Example:
FDM
4 users

frequency

time
TDM

frequency

time
Introduction 1-31
Network Core: Packet Switching
each end-end data stream resource contention:
divided into packets  aggregate resource
 user A, B packets share demand can exceed
network resources amount available
 each packet uses full link  congestion: packets
bandwidth queue, wait for link use
 resources used as needed  store and forward:
packets move one hop
at a time
 Node receives complete
packet before forwarding

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

L bits
per packet

3 2 1
source destination
R bps R bps

takes L/R seconds to transmit


one-hop numerical
(push out) L-bit packet into
link at R bps
example:
 store and forward: entire  L = 7.5 Mbits
packet must arrive at router  R = 1.5 Mbps
before it can be transmitted  one-hop transmission
on next link delay = 5 sec
 end-end delay = 2L/R (assuming
zero propagation delay) more on delay shortly …
Introduction 1-33
Packet Switching: Statistical Multiplexing
100 Mb/s
A Ethernet statistical multiplexing C

1.5 Mb/s
B
queue of packets
waiting for output
link

D E
Sequence of A & B packets does not have fixed pattern, bandwidth
shared on demand  statistical multiplexing.
TDM: each host gets same slot in revolving TDM frame.
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-34
 Two key network-core functions
routing: determines source- forwarding: move packets
destination route taken by from router’s input to
packets
 routing algorithms appropriate router output

routing algorithm

local forwarding table

header value output link
0100 3 1
0101 2
0111 2 3 2
1001 1

dest address in arriving

packet’s header Network Layer 4-35
Q/A
 What advantage does a circuit-switched
network have over a packet-switched
network?
 What are the advantages and
disadvantages of network core using circuit
switching vs packet switching technology?
Provide them in the form of parameters in
the table

Introduction 1-36
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
 end systems, access networks, links
1.3 Network core
 circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched
networks
1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History

Introduction 1-37
How do loss and delay occur?
packets queue in router buffers
 packet arrival rate to link 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-38
Four sources of packet delay
1. dproc: nodal processing  2. dqueue: queueing delay
 check bit errors  time waiting at output link
 determine output link for transmission
 typically < msec  depends on congestion
level of router

dnodal = dproc + dqueue + dtrans + dprop

transmission
A propagation

B
nodal
processing queueing
Introduction 1-39
Delay in packet-switched networks
3. dtrans: transmission delay 4. dprop: propagation delay:
R=link bandwidth (bps)  d = length of physical link
 L=packet length (bits)  s = propagation speed in
 time to send bits into medium (equal.~3x108
link = dtrans = L/R m/sec)
 propagation delay = d/s
 typically < msec
transmission
A propagation

B
nodal Note: s and R are very different
processing queueing quantities!
 Read in book chap 1
Introduction 1-40
 Caravan analogy
100 km 100 km
ten-car toll toll
caravan booth booth
 cars “propagate” at  Time to “push” entire
100 km/hr caravan through toll
 toll booth takes 12 sec to booth onto highway =
service car (transmission 12*10 = 120 sec
time)  Time for last car to
 car~bit; caravan ~ packet propagate from 1st to
2nd toll both:
 Q: How long until caravan
100km/(100km/hr)= 1 hr
is lined up before 2nd toll
booth?  A: 62 minutes

Introduction 1-41
Caravan analogy (more)
100 km 100 km
ten-car toll toll
caravan booth booth
 Yes! After 7 min, 1st car
 Cars now “propagate” at at 2nd booth and 3 cars
1000 km/hr still at 1st booth.
 Toll booth now takes 1  1st bit of packet can
min to service a car arrive at 2nd router
 Q: Will cars arrive to before packet is fully
2nd booth before all transmitted at 1st router!
cars serviced at 1st
booth?

Introduction 1-42
Nodal delay
dnodal  dproc  dqueue  d trans  dprop

 dproc = processing delay

 typically a few microsecs or less
 dqueue = queuing delay
 depends on congestion
 dtrans = transmission delay
= L/R, significant for low-speed links
 dprop = propagation delay
a few microsecs to hundreds of msecs
Introduction 1-43
Queueing delay (revisited)

average queueing
 R: link bandwidth (bps)

delay
 L: packet length (bits)
 a: average packet
arrival rate
traffic intensity
 La/R ~ 0: avg. queueing delay small = La/R
 La/R -> 1: avg. queueing delay large La/R ~ 0
 La/R > 1: more “work” arriving
than can be serviced, average delay infinite!

* Check out the Java applet for an interactive animation on queuing and loss La/R > 1
Introduction 1-44
“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-45
 “Real” Internet delays and routes
traceroute: gaia.cs.umass.edu to www.eurecom.fr
Three packets 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
8 62.40.103.253 (62.40.103.253) 104 ms 109 ms 106 ms trans-oceanic
9 de2-1.de1.de.geant.net (62.40.96.129) 109 ms 102 ms 104 ms
10 de.fr1.fr.geant.net (62.40.96.50) 113 ms 121 ms 114 ms link
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

Detail explain : http://ezine.echo.or.id/ezine3/ez-r03-samuel-analisa_jaringan_dengan_ping&&traceroute.txt

Introduction 1-46
 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
Introduction 1-47