0% found this document useful (0 votes)
71 views43 pages

Chapter1 Intro PDF

The document provides an overview of the Internet, describing its structure including the network edge with end systems and applications, the network core consisting of interconnected routers, and the use of packet switching which divides data into packets that are transmitted through the network and shared statistically across links rather than through dedicated circuit allocation. It also discusses the transport protocols TCP and UDP that provide connection-oriented and connectionless data transfer services respectively.

Uploaded by

inza khizar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
71 views43 pages

Chapter1 Intro PDF

The document provides an overview of the Internet, describing its structure including the network edge with end systems and applications, the network core consisting of interconnected routers, and the use of packet switching which divides data into packets that are transmitted through the network and shared statistically across links rather than through dedicated circuit allocation. It also discusses the transport protocols TCP and UDP that provide connection-oriented and connectionless data transfer services respectively.

Uploaded by

inza khizar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 43

Chapter 1: roadmap

1.1 What is the Internet?


1.2 Network edge
1.3 Network core
Network access and physical media
Internet structure and ISPs
1.4 Delay & loss in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security (covered in
Chap. 8)
1.7 History
Introduction 1-1
What’s the Internet: “nuts and bolts” view
 millions of connected computing
devices: hosts = end systems router
workstation
 running network apps (email, server
Web, telephone, banking, time, mobile
updates, …)
local ISP
 communication links
 fiber, copper, radio, satellite
 transmission rate = bandwidth
 routers: forward packets regional ISP
(chunks of data)
 search engines: "crawl" the
Web, sorting Web sites by key
words into huge data bases
(e.g., Google).
 security systems: monitor the
company
Web traffic for malicious
activities. network

Introduction 1-2
What’s the Internet: “nuts and bolts” view
 protocols control sending, router workstation
receiving of msgs server
 e.g., TCP, IP, HTTP, FTP, mobile
Internet: “network of local ISP
networks”
 loosely hierarchical
 public Internet versus regional ISP
private intranet
 Internet standards
 RFC: Request for comments
 IETF: Internet Engineering
Task Force company
network

Introduction 1-3
What’s the Internet: a service view
 communication
infrastructure enables
distributed applications:
 Web, email, games, e-
commerce, file sharing
 communication services
provided to apps:
 Connectionless unreliable
 connection-oriented
reliable

Introduction 1-4
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,
when msgs received, order of msgs sent and
or other events received among network
entities, and actions
taken on msg
transmission, receipt
Introduction 1-5
What’s a protocol?
a human protocol and a computer network protocol:

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

Q: Other human protocols?


Introduction 1-6
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
1.3 Network core
Network access and physical media
Internet structure and ISPs
1.4 Delay & loss in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security (covered in
Chap. 8)
1.7 History
Introduction 1-7
A closer look at network structure:

 network edge:
applications and
hosts
 network core:
 routers
 network of
networks
 access networks,
physical media:
communication links
Introduction 1-8
The network edge:
 end systems (hosts):
 run application programs
 e.g. Web, email
 at “edge of network”
 client/server model
 client host requests, receives
service from always-on server
 e.g. Web browser/server;
email client/server
 peer-peer model:
 minimal (or no) use of
dedicated servers
 e.g. Skype, BitTorrent, KaZaA
Introduction 1-9
Network edge: connection-oriented service

Goal: data transfer TCP service [RFC 793]


between end systems  reliable, in-order byte-
 handshaking: setup stream data transfer
(prepare for) data  loss: acknowledgements
transfer ahead of time and retransmissions
 Hello, hello back -human  flow control:
protocol  sender won’t overwhelm
 set up “state” in two receiver
communicating hosts
 congestion control:
 TCP - Transmission  senders “slow down sending
Control Protocol rate” when network
 Internet’s connection- congested
oriented service
Introduction 1-10
Network edge: connectionless service

Goal: data transfer App’s using TCP:


between end systems  HTTP (Web), FTP (file
 same as before! transfer), Telnet
 UDP - User Datagram (remote login), SMTP
Protocol [RFC 768]: (email)
 connectionless App’s using UDP:
 unreliable data  streaming media,
transfer teleconferencing, DNS,
 no flow control Internet telephony,
 no congestion control Domain Name lookup,
Time lookup.

Introduction 1-11
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
1.3 Network core
Network access and physical media
Internet structure and ISPs
1.4 Delay & loss in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security (covered in
Chap. 8)
1.7 History
Introduction 1-12
The Network Core
 mesh of interconnected
routers
 the fundamental
question: how is data
transferred through net?
 circuit switching:
dedicated circuit per
call: telephone net
 packet-switching: data
sent thru net in
discrete “chunks”

Introduction 1-13
Network Core: Circuit Switching

End-end resources
reserved for “call”
 link bandwidth, switch
capacity
 dedicated resources:
no sharing
 circuit-like
(guaranteed)
performance
 call setup required

Introduction 1-14
Network Core: Circuit Switching
network resources  dividing link bandwidth
(e.g., bandwidth) into “pieces”
divided into “pieces”  frequency division
 pieces allocated to calls  time division (TDM)
 resource piece idle if  code division (CDM)
not used by owning call
(no sharing)

Introduction 1-15
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 (for short time) queue, wait for link use
 resources used as needed  store and forward:
packets move one hop
at a time
Bandwidth division into “pieces”  Node receives complete
Dedicated allocation packet before forwarding
Resource reservation

Introduction 1-16
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,


shared on demand statistical multiplexing.
TDM: each host gets same slot in revolving TDM frame.
Introduction 1-17
Packet-switching: store-and-forward
L
R1 R2 R3

Delay Time = L/R1 + L/ R2 + L/R3


 Takes L/R seconds to
transmit (push out) Example: or if
packet of L bits on to  L = 7.5 Mbits - 7.5 kbits
link or R bps  R = 1.5 Mbps - 1.5 Mbps
 Entire packet must  delay = 15 sec - 15 msec
arrive at router before Note: local connection so that
it can be transmitted on (a) propagation time is
next link: store and negligible, and (b) no delay
forward due to congestion.
 delay = sum L/Ri more on delay shortly …
(assuming zero queing
propagation delays) Introduction 1-18
Packet switching versus circuit switching
Is packet switching a “slam dunk winner?”
 Great for bursty data
resource sharing
 simpler, no call setup
 If excessive congestion: packet delay and loss.
 protocols needed for reliable data transfer,
congestion control (TCP does a good job)
 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-19
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
1.3 Network core
Network access and physical media
Internet structure and ISPs
1.4 Delay & loss in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security (covered in
Chap. 8)
1.7 History
Introduction 1-20
Access networks and physical media
Q: How to connect end Routers
systems to edge router?
 residential access nets
 institutional access
networks (school,
company)
 mobile access networks

Keep in mind:
 Bit rate [bandwidth]
(bits per second) of
access network?
 shared or dedicated?
Introduction 1-21
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
1.3 Network core
Network access and physical media
Internet structure and ISPs
1.4 Delay & loss in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security (covered in
Chap. 8)
1.7 History
Introduction 1-22
Internet structure: network of networks

 roughly hierarchical
 at center: “tier-1” ISPs (e.g., MCI, Sprint, AT&T, Cable
and Wireless), national/international coverage
 treat each other as equals

Tier-1 providers
also interconnect
Tier-1 at public network
providers
Tier 1 ISP
NAP access points
interconnect (NAPs)
(peer)
privately
Tier 1 ISP Tier 1 ISP

Introduction 1-23
Tier-1 ISP: e.g., Sprint
Sprint US backbone network
DS3 (45 Mbps)
OC3 (155 Mbps)
OC12 (622 Mbps)
OC48 (2.4 Gbps)
Seattle
Tacoma
POP: point-of-presence

to/from backbone
New York
Stockton Cheyenne Chicago
peering Pennsauken

San Jose
… … Relay
Wash. DC
Roachdale
Kansas City
.
Anaheim

Atlanta
to/from customers
Fort Worth

Orlando
Introduction 1-24
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 NAP interconnect
 tier-2 ISP is
at NAP*
customer of
tier-1 provider Tier 1 ISP Tier 1 ISP Tier-2 ISP

Tier-2 ISP Tier-2 ISP

* NAP - Network Access Point Introduction 1-25


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 NAP
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-26
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
NAP

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-27
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
1.3 Network core
Network access and physical media
Internet structure and ISPs
1.4 Delay & loss in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security (covered in
Chap. 8)
1.7 History
Introduction 1-28
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-29
Four sources of packet delay
 1. nodal processing:  2. queueing (node "i")
 check bit errors  time waiting at output
 determine output link link for transmission
 depends on congestion
Small - Neglect level of router
processing delay in all
problems  = Qi /Rout
transmission
A propagation

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

Introduction 1-32
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-33
Multiple links: sum over nodes i (Qi/Ri)
sum over links i (L/Ri)
Nodal delay Xtotal / s

d nodal = d proc + dqueue + d trans + d prop

 dproc = processing delay (negligible)


 typically a few microsecs (actually, nanosec.s) or less

 dqueue = queuing delay


 depends on congestion, Q/R (Q=size of queue in bits (8*bytes) )

 dtrans = transmission delay (L= bits (8*bytes) in packet)


 = L/R, significant for low-speed links

 dprop = propagation delay (radio: s=300 m/us, other


media: s=200 m/us)
 a few microsec.s (us) to hundreds of msec.s (ms)
Introduction 1-34
“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

* Windows: Command Prompt (CMD) - use "tracert"


Introduction 1-35
“Real” Internet delays and routes
traceroute: gaia.cs.umass.edu to www.eurecom.fr
MS Windows: in MSdos window, type "tracert www.cnn.com"
or "tracert 64.128.24.156" 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
link
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
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-36
Packet loss due to buffer
overflow
 queue (aka "buffer") – each output link of
router has buffer with finite capacity
 many input links may be putting packets
into the queue.
 when packet arrives to full queue, packet is
dropped (aka "lost" or "dropped")
 lost packet may be retransmitted by
previous node, by source end system, or
not retransmitted at all

"aka" = "also known as"


Introduction 1-37
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
1.3 Network core
Network access and physical media
Internet structure and ISPs
1.4 Delay & loss in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security (covered in
Chap. 8)
1.7 History
Introduction 1-38
Protocol “Layers”
Networks are complex!
 many “pieces”:
 hosts Question:
 routers Is there any hope of
 links of various organizing structure of
media network?
 applications
 protocols Or at least our discussion
 hardware, of networks?
software

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

Introduction 1-43

You might also like