CAPITULO 1

Introducción

Redes de Computadores,
4th edición.
Jim Kurose, Keith Ross
Addison-Wesley.
Traducido al español por:
Luis Ortiz F.

Introduction 1-1
Capítulo 1: Introduccción
Nuestro Objetivo: Apresiación global:
 ¿Qué es el internet?
 ¿Qué es un protocolo?
 Entender la
 El extremo de la red; hosts, acceso a
terminologia la red, medios fisicos
 Tener más  El núcleo de la red: conmutación de
conocimiento después circuitos y paquetes, estructura del
del curso internet
 Usar como ejemplo al  Rendimiento: perdidas, retardos
internet.  Seguridad
 Capas de protocolo, modelos de
servicio
 Historia

Introduction 1-2
Capítulo 1: Indice
1.1 ¿Qué es el internet?
1.2 El extremo de la red
 sistemas terminales, redes de acceso, links
1.3 El núcleo de la red
 conmutación de circuitos, conmutación de paquetes,
estructura de la red
1.4 Retardos, pérdidas en redes de conmutación de
paquetes
1.5 Capas de protocolo y sus modelos de servicio
1.6 Historia

Introduction 1-3
¿Qué es el internet? “Vision práctica”
Red móvil
PC
 Conecta millones de ISP Global
servidor
dsipositivos de cómputo:
Portátiles hosts(anfitriones) = sistemas
con wireless
terminales Red casera
celulares
 running network apps
ISP regional
 Enlaces de comunicación
 fibra, cable coaxial de

Puntos cobre, ondas de radio, Red Institutional

de acceso satélite
enlaces  Tasa de transmisión=
alambrados
ancho de banda

 routers: difunden paquetes

router (trozos de información)

Introduction 1-4
Aparatos que pueden conectarse a
internet

Tostadora con conexión a

internet y pronosticador del
tiempo

Marco de fotos, IP
http://www.ceiva.com/

Servidor de red más pequeño del mundo

http://www-ccs.cs.umass.edu/~shri/iPic.html Teléfonos con conexión a internet

Introduction 1-5
 ¿Qué es el internet? “Vision práctica”
Red móvil
 Los protocolos controlan el
envio y recepción de ISP Global
mensajes
 e.j., TCP, IP, HTTP, Skype,
Ethernet Red Casera
 Internet: “red de redes” ISP Regional
 Flojamente jerárquico
 Internet público versus
Red Institucional
intranet privado
 Estándares del Internet
 RFC: Request for comments
(solicitudes de comentarios)
 IETF: Internet Engineering
Task Force
Introduction 1-6
¿Qué es el internet? “Vision orientada al servicio”

 infraestructura que lanza e

inventa nuevas aplicaciones
distribuídas:
 Web, VoIP, email, juegos,
comercio electrónico, archivos
compartidos

 los servicios orientado a conexón

proporcionaron a las aplicaciones:
entrega de datos fiable, de la
fuente al destino
 Realizan el “máximo esfuerzo”
(inestable) en la entrega de
datos

Introduction 1-7
¿Qué es un protocolo?
Protocolos humanos: Protocolos de red:
 “¿qué hora es?”  máquinas en lugar de los
humanos
 “yo tengo una pregunta”
 toda la actividad de
comunicación en Internet
… mensajes específicos está gobernada por
que enviamos protocolos
… acciones específicas que Un protocolo define el formato y
tomamos como el orden de los mensajes
intercambiados entre dos o más
respuesta a los entidades que se comunican, así
mensajes de como las aciones que se toman en
contestacion u otros la transmisión y/o recepción de un
eventos mensaje u otro evento.

Introduction 1-8
 ¿Qué es un protocolo?
Un protocolo humano y un protocolo de red:

Hola solicitu
d de co
nexión
T CP

Hola
exió n TCP
¿Qué esta de co n
hora R e sp u
e s?
Get http://www.awl.com/kurose-ross
2:00
<archivo>
tiempo

Pregunta: ¿Otros protocolos humanos?

Introduction 1-9
Capítulo 1: Índice
1.1 ¿Qué es el internet?
1.2 El extremo de la red
 sistemas terminales, redes de acceso, links
1.3 El núcleo de la red
 conmutación de circuitos, conmutación de paquetes,
estructura de la red
1.4 Retardos, pérdidas en redes de conmutación
de paquetes
1.5 Capas de protocolo y sus modelos de servicio
1.6 Historia

Introduction 1-10
Una mirada más profunda a la
estructura de la red:
 Extremo de la red:
aplicaciones y hosts

 redes de acceso, medios de

comunicación físicos:
alambrado, enlaces de
comunicación inalámbricos

 Nucleo de la red:
 Routers
interconectados
 Red of redes

Introduction 1-11
 El extremo de la red:
 Sistemas terminales (hosts):
 Ejecutan programas de
aplicación
 e.j. Web, mail
Colega-colega

cli
en
 Modelo cliente/servidor

te
 Un anfitrión (host) cliente

/s
solicita y recibe un servicio de

er
vid
un anfitrión (host) servidor

or
 e.j. buscador Web/servidor;
cliente de un email/servidor
 Modelo colega a colega:
 uso mínimo (o ningúno) de
servidores especializados
 e.g. Skype, BitTorrent
Introduction 1-12
Redes de acceso y los medios de
comunicación físicos
Q: ¿Cómo conectar sistemas
terminales a un router
extremo? 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-13
Residential access: point to point access

 Dialup via modem

 up to 56Kbps direct access to
router (often less)
 Can’t surf and phone at same
time: can’t be “always on”
 DSL: digital subscriber line
 deployment: telephone company (typically)
 up to 1 Mbps upstream (today typically < 256 kbps)
 up to 8 Mbps downstream (today typically < 1 Mbps)
 dedicated physical line to telephone central office

Introduction 1-14
Residential access: cable modems

 HFC: hybrid fiber coax

 asymmetric: up to 30Mbps downstream, 2
Mbps upstream
 network of cable and fiber attaches homes to
ISP router
 homes share access to router
 deployment: available via cable TV companies

Introduction 1-15
Residential access: cable modems

Diagram: http://www.cabledatacomnews.com/cmic/diagram.html Introduction 1-16

Cable Network Architecture: Overview

Typically 500 to 5,000 homes

cable headend

home
cable distribution
network (simplified)

Introduction 1-17
Cable Network Architecture: Overview

server(s)

cable headend

home
cable distribution
network

Introduction 1-18
Cable Network Architecture: Overview

cable headend

home
cable distribution
network (simplified)

Introduction 1-19
Cable Network Architecture: Overview

FDM (more shortly):

C
O
V V V V V V N
I I I I I I D D T
D D D D D D A A R
E E E E E E T T O
O O O O O O A A L

1 2 3 4 5 6 7 8 9

Channels

cable headend

home
cable distribution
network

Introduction 1-20
Company access: local area networks
 company/univ local area
network (LAN) connects
end system to edge router
 Ethernet:
 10 Mbs, 100Mbps,
1Gbps, 10Gbps Ethernet
 modern configuration:
end systems connect
into Ethernet switch
 LANs: chapter 5

Introduction 1-21
Wireless access networks
 shared wireless access
network connects end system
to router router
 via base station aka “access
point”
base
 wireless LANs: station
 802.11b/g (WiFi): 11 or 54 Mbps

 wider-area wireless access

 provided by telco operator
 ~1Mbps over cellular system
mobile
(EVDO, HSDPA)
 next up (?): WiMAX (10’s Mbps)
hosts
over wide area

Introduction 1-22
Home networks
Typical home network components:
 DSL or cable modem
 router/firewall/NAT
 Ethernet
 wireless access
point
wireless
to/from laptops
cable router/
cable
modem firewall
headend
wireless
access
Ethernet point

Introduction 1-23
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
 guided media:
 Category 5:
100Mbps Ethernet
 signals propagate in solid
media: copper, fiber, coax
 unguided media:
 signals propagate freely,
e.g., radio

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

Introduction 1-25
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-26
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-27
El núcleo de la red
 malla de routers
interconectados
 La pregunta fundamental
es: ¿cómo se transfieren los
datos a través de la red?
 Conmutación de
circuitos: circuito
dedicado para cada
llamada: red telefónica
 Conmutación de
paquetes: data sent thru
net in discrete “chunks”

Introduction 1-28
El núcleo de la red: Conmutación de
Circuitos
Los recursos estan
reservados para la
comunicación entre
sistemas terninales

 Ancho de banda de
enlace, capacidad de
conmutación
 Transmisión de datos a
una tasa constante
garantizada
 call setup required

Introduction 1-29
 El núcleo de la red: Conmutación de
Circuitos

Recursos de red (e.j.,  Dividiendo el ancho de

ancho de banda) banda del enlace en
dividido en “pedazos” “pedazos”
 División de frecuencia

 un “pedazo” del A.B. es  División de tiempo

asignado a cada conexión

 El tiempo se pierde si no
es usado por la conexión

Introduction 1-30
Conmutación de Circuitos : FDM y TDM
Ejemplo:
FDM
4 usuarios

frecuencia

tiempo
TDM

frecuencia

tiempo
Introduction 1-31
Ejemplo numérico
 ¿Cuánto tiempo toma para enviar un archivo
de 640,000 bits del host A a un host B
sobre una red de conmutación de
circuitos?
 Todos los enlaces son de 1.536 Mbps
 Cada enlace usa TDM con 24 slots/sec
 Se nececitan 500 msec para establecer una
conexión terminal a terminal

Trabajemos en esto!
Introduction 1-32
El núcleo de la red: Conmutación de
Paquetes
Los mensajes largos se dividen en
trozos más pequeños de datos
llamados paquetes.
 los paquetes de A, B comparten
recursos de la red
 Cada paquete utiliza todo el
ancho de banda del enlace
 resources used as needed
División del ancho de banda en
“trozos”
Asisgnacion dedicada
Reservación de recursos
Disputa de recursos:
 la demanda del recurso
agregado puede exceder
cantidad disponible
 congestión: los paquetes
hacen cola, esperando poder
usar el enlace
 almacenar y reeviar: los
paquetes se mueven un paso
a la vez
 El nodo recibe el
paquete completo antes
de empezar a transmitir
Introduction 1-33
 Conmutación de Paquetes : Multiplexación
Estadística
Ethernet
A 100 Mb/s Multiplexación estadística C

1.5 Mb/s
B
Cola de paquetes
esperando por el
enlace de salida

D E

La secuencia de paquetes A y B no sigue un patrón fijo, el ancho

de banda es compartido multplexación estadística.
TDM: cada nodo consigue la misma partición en un marco
rotatorio TDM.
Introduction 1-34
Conmutación de Paquetes : almacenar y reenviar
L
R R R

 toma L/R segundos Ejemplo:

transmitir un paquete de L
bits por un enlace de R bps
 L = 7.5 Mbits
 almacenar y reenviar: el  R = 1.5 Mbps
paquete entero debe llegar  Retardo de
al router antes de que pueda
transmitirse en el próximo transmisión= 15 sec
eslace
 retardo = QL/R (asumiendo
que no hay retardo de
propagación)

Introduction 1-35
 Conmutación de Paquetes versus Conmutación de
Circuitos
¡La conmutación de paquetes permite a más usuarios usar red!
 Enlace 1 Mb/s
 Cada usuario:
 Utiliza 100 kb/s cuando
esta “activo”
 Esta activo 10% del tiempo
N usuarios
 Conmutación de circuitos:
 10 usuarios Enlace
 Conmutación de paquetes: 1 Mbps
 con 35 usuarios, la
probabilidad de que haya P: Como conseguimos nosotros el valor de 0.0004?
11 o más usuarios activos
simultaneamente es de
0.0004
Introduction 1-36
 Conmutación de Paquetes versus Conmutación de
Circuitos

Is packet switching a “slam dunk winner?”

 great for bursty data
resource sharing
 simpler, no call setup
 excessive congestion: 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-37
 Internet structure: network of networks
 roughly hierarchical
 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-38
Tier-1 ISP: e.g., Sprint
POP: point-of-presence

to/from backbone

peering
… …
.
…
…

to/from customers

Introduction 1-39
 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-40
 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-41
 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-42
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-43
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-44
Four sources of packet delay
 1. nodal processing:
 check bit errors
 determine output link
 2. queueing
 time waiting at output
link for transmission
 depends on congestion
level of router

transmission
A propagation

B
nodal
processing queueing

Introduction 1-45
Delay in packet-switched networks
3. Transmission delay: 4. 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 (~2x108 m/sec)
link = L/R  propagation delay = d/s

Note: s and R are very

different quantities!
transmission
A propagation

B
nodal
processing queueing
Introduction 1-46
 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 booth
 toll booth takes 12 sec to onto highway = 12*10 = 120
service car (transmission sec
time)  Time for last car to
 car~bit; caravan ~ packet propagate from 1st to 2nd
 Q: How long until caravan is toll both:
lined up before 2nd toll 100km/(100km/hr)= 1 hr
booth?  A: 62 minutes

Introduction 1-47
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 arrive
min to service a car at 2nd router before
 Q: Will cars arrive to packet is fully transmitted
2nd booth before all at 1st router!
cars serviced at 1st  See Ethernet applet at AWL
booth? Web site

Introduction 1-48
Nodal delay
d nodal  d proc  d queue  d trans  d prop

 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-49
Queueing delay (revisited)

 R=link bandwidth (bps)

 L=packet length (bits)
 a=average packet
arrival rate

traffic intensity = La/R

 La/R ~ 0: average queueing delay small

 La/R -> 1: delays become large
 La/R > 1: more “work” arriving than can be
serviced, average delay infinite!
Introduction 1-50
“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-51
“Real” Internet delays and routes
traceroute: gaia.cs.umass.edu to www.eurecom.fr
Three 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

Introduction 1-52
 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-53
 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,
server sendswith link
bits pipe capacity
that can carry link that
pipe capacity
can carry
file of
(fluid) F bits
into pipe fluid at rate
Rs bits/sec Rfluid at rate
c bits/sec
to send to client Rs bits/sec) Rc bits/sec)

Introduction 1-54
 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
link on end-end path that constrains end-end throughput
Introduction 1-55
Throughput: Internet scenario

Rs
 per-connection
Rs Rs
end-end
throughput:
R
min(Rc,Rs,R/10)
 in practice: Rc or Rs Rc Rc

is often bottleneck Rc

10 connections (fairly) share

backbone bottleneck link R bits/sec
Introduction 1-56
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-57
Protocol “Layers”
Networks are complex!
 many “pieces”:
 hosts Question:
 routers Is there any hope of
 links of various organizing structure of
network?
media
 applications
Or at least our discussion of
 protocols networks?
 hardware,
software

Introduction 1-58
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-59
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-60
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-61
Internet protocol stack
 application: supporting
 network applications
 FTP, SMTP, HTTP
application
 transport: process-process data transfer
 TCP, UDP
transport
 network: routing of datagrams from
source to destination network
 IP, routing protocols
 link: data transfer between neighboring link
network elements
 PPP, Ethernet physical
 physical: bits “on the wire”

Introduction 1-62
ISO/OSI reference model
 presentation: allow applications to
interpret meaning of data, e.g., application
encryption, compression, machine-
specific conventions presentation
 session: synchronization, session
checkpointing, recovery of data transport
exchange
 Internet stack “missing” these
network
layers! link
 these services, if needed, must be
physical
implemented in application
 needed?

Introduction 1-63
 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-64
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-65
Network Security
 The field of network security is about:
 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-66
Bad guys can put malware into
hosts via Internet
 Malware can get in host from a virus, worm, or
trojan horse.

 Spyware malware can record keystrokes, web

sites visited, upload info to collection site.

 Infected host can be enrolled in a botnet, used

for spam and DDoS attacks.

 Malware is often self-replicating: from an

infected host, seeks entry into other hosts

Introduction 1-67
Bad guys can put malware into
hosts via Internet
 Trojan horse
 Hidden part of some
otherwise useful
software
 Today often on a Web
page (Active-X, plugin)
 Virus
 infection by receiving
 Worm:
 infection by passively
receiving object that gets
itself executed
 self- replicating: propagates
to other hosts, users
Sapphire Worm: aggregate scans/sec
in first 5 minutes of outbreak (CAIDA, UWisc data)

object (e.g., e-mail

attachment), actively
executing
 self-replicating:
propagate itself to other
hosts, users
Introduction 1-68
 Bad guys can attack servers and
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 toward
target from target
compromised hosts

Introduction 1-69
The 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 used for end-of-chapter
labs is a (free) packet-sniffer
Introduction 1-70
The bad guys can use false source
addresses
 IP spoofing: send packet with false source address
A C

src:B dest:A payload

Introduction 1-71
The bad guys can record and
playback
 record-and-playback: sniff sensitive info (e.g.,
password), and use later
 password holder is that user from system point of view

C
A

src:B dest:A user: B; password: foo

Introduction 1-72
Network Security
 more throughout this course
 chapter 8: focus on security
 crypographic techniques: obvious uses and
not so obvious uses

Introduction 1-73
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-74
Internet History
1961-1972: Early packet-switching principles
 1961: Kleinrock - queueing  1972:
theory shows  ARPAnet public demonstration
effectiveness of packet-  NCP (Network Control Protocol)
switching
first host-host protocol
 1964: Baran - packet-
 first e-mail program
switching in military nets
 ARPAnet has 15 nodes
 1967: ARPAnet conceived
by Advanced Research
Projects Agency
 1969: first ARPAnet node
operational

Introduction 1-75
 Internet History
1972-1980: Internetworking, new and proprietary nets
 1970: ALOHAnet satellite Cerf and Kahn’s internetworking
network in Hawaii principles:
 1974: Cerf and Kahn -  minimalism, autonomy - no
architecture for internal changes required
interconnecting networks to interconnect networks
 best effort service model
 1976: Ethernet at Xerox
PARC  stateless routers
 decentralized control
 ate70’s: proprietary
architectures: DECnet, SNA, define today’s Internet
XNA architecture
 late 70’s: switching fixed
length packets (ATM
precursor)
 1979: ARPAnet has 200 nodes

Introduction 1-76
Internet History
1980-1990: new protocols, a proliferation of networks

 1983: deployment of  new national networks:

TCP/IP Csnet, BITnet,
 1982: smtp e-mail NSFnet, Minitel
protocol defined  100,000 hosts
 1983: DNS defined connected to
for name-to-IP- confederation of
address translation networks
 1985: ftp protocol
defined
 1988: TCP congestion
control
Introduction 1-77
Internet History
1990, 2000’s: commercialization, the Web, new apps
 Early 1990’s: ARPAnet Late 1990’s – 2000’s:
decommissioned  more killer apps: instant
 1991: NSF lifts restrictions on messaging, P2P file sharing
commercial use of NSFnet  network security to
(decommissioned, 1995)
forefront
 early 1990s: Web
 est. 50 million host, 100
 hypertext [Bush 1945,
million+ users
Nelson 1960’s]  backbone links running at
 HTML, HTTP: Berners-Lee
Gbps
 1994: Mosaic, later Netscape
 late 1990’s:
commercialization of the Web

Introduction 1-78
Internet History

2007:
 ~500 million hosts
 Voice, Video over IP
 P2P applications: BitTorrent
(file sharing) Skype (VoIP),
PPLive (video)
 more applications: YouTube,
gaming
 wireless, mobility

Introduction 1-79
Introduction: Summary
Covered a “ton” of material!
You now have:
 Internet overview
 context, overview,
 what’s a protocol?
“feel” of networking
 network edge, core, access  more depth, detail to
network follow!
 packet-switching versus
circuit-switching
 Internet structure
 performance: loss, delay,
throughput
 layering, service models
 security
 history
Introduction 1-80