Circuit switching: FDM and TDM
Example: FDM (Frequency division multiplexing) 4 users
frequency
frequency band
time TDM (Time division multiplexing)
frame
frequency time
slot
Introduction
1-1
Exercise
How long does it take to send a file of 640,000 bits from host A to host B over a circuit-switched network?
All links are 1.536 Mbps (in the whole freq. range) Each link uses TDM with 24 slots/sec 500 msec to establish end-to-end circuit
Introduction
1-2
Exercise
How long does it take to send a file of 640,000 bits from host A to host B over a circuit-switched network?
All links are 1.536 Mbps (in the whole freq. range) Each link uses FDM with 24 channels/frequency band 500 msec to establish end-to-end circuit
Introduction
1-3
Network Core: Packet switching
Each end-end data stream divided into packets user A, B packets share network resources each packet uses full link bandwidth resources used as needed
Bandwidth division into pieces Dedicated allocation Resource reservation
Resource contention: aggregate resource demand can exceed amount available congestion: packets queue, wait for link use, may get lost when queue fills store and forward: packets move one hop at a time
Node receives complete packet before forwarding
Introduction 1-4
Delay of store-and-forward
L R Takes L/R seconds to transmit (push out) packet of L bits on to link or R bps Entire packet must arrive at router before it can be transmitted on next link: R R
Example: L = 7.5 Mbits R = 1.5 Mbps delay = 15 sec
store and forward
Delay on 3 links = 3L/R (assuming zero propagation delay)
Introduction
1-5
Statistical multiplexing
A B
10 Mb/s Ethernet
statistical multiplexing
1.5 Mb/s
queue of packets waiting for output link
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-6
Packet switching vs circuit switching
Packet switching allows more users to use network!
1 Mb/s link Each user:
100 kb/s when active active 10% of time
circuit-switching:
10 users
N users 1 Mbps link
packet switching:
With 35 users, p(#active>10) < 0.0004 Q: How did we get value 0.0004?
Introduction
1-7
Packet switching vs circuit switching
p(#active = n)
p(#active n)
Introduction 1-8
Packet switching vs circuit switching
Packet switching is great for bursty data Packet switching problem: Excessive congestion leading to packet delay and loss Circuit switching is good for guaranteed-quality services but expensive
Sending video over the network Protocols needed for reliable data transfer, congestion control Resource sharing Simple, no call setup
Introduction
1-9
Packet-switched networks: forwarding
How do routers know how to get from A to B?
They keep tables showing them the next hop neighbor on that route
Datagram network:
Destination address in packet determines next hop
Router tables contain destination nexthop maps Routes may change during session
Virtual circuit network:
Each packet carries tag (virtual circuit ID VC ID), one tag per call Router tables contain VC ID nexthop maps Fixed path determined at call setup time, remains fixed thru call
Introduction 1-10
Datagram vs virtual circuit
VC tables are smaller and faster to search
Only active calls on local links
Datagram forwarding can handle route changes easier
No per-call state in routers
Introduction
1-11
Network taxonomy
Telecommunication networks
Circuit-switched networks
Packet-switched networks Networks with VCs Datagram Networks
FDM
TDM
Datagram network is not either connection-oriented or connectionless. Internet provides both connection-oriented (TCP) and connectionless services (UDP) to apps.
Introduction 1-12
Access networks
How to connect end systems to edge router? Residential access nets Institutional access networks (school, company) Mobile access networks
Access networks features: Bandwidth (bits per second) Shared or dedicated?
Introduction
1-13
Residential access
Dialup via modem
Up to 56Kbps direct access to router (often less) Cant surf and phone at same time: cant be always on
dedicated access
ADSL: asymmetric digital subscriber line
Up to 1 Mbps upstream (today typically < 256 kbps) Up to 8 Mbps downstream (today typically < 1 Mbps) FDM on phone line for upstream, downstream and voice shared
HFC: hybrid fiber coaxial cable
Asymmetric: up to 30Mbps downstream, 2 Mbps upstream
access
Network of cable and fiber attaches homes to ISP router Homes share access to router
Introduction 1-14
Company access: local area networks
Company/university local area network (LAN) connects end system to edge router Ethernet:
Shared or dedicated link connects end system and router 10 Mbs, 100Mbps, Gigabit Ethernet
Introduction
1-15
Wireless access networks
Shared wireless access network connects end system to router Wireless LANs:
Via base station aka access point router 802.11b (WiFi): 11 Mbps
Wider-area wireless access
Connect to them via WAP phones Provided by telco operator Popular in Europe and Japan
base station
mobile hosts
Introduction
1-16
Home networks
Typical home network components: ADSL or cable modem Router/firewall/NAT Ethernet Wireless access point
wireless laptops wireless access point
Introduction 1-17
to/from cable headend
cable modem
router/ firewall Ethernet
Internet structure
Roughly hierarchical At center: tier-1 ISPs (e.g., MCI, Sprint, AT&T), national/international coverage
Treat each other as equals
Tier-1 providers also interconnect at public network access points (NAPs)
Tier-1 providers interconnect (peer) privately
Tier 1 ISP
NAP
Tier 1 ISP
Tier 1 ISP
Introduction
1-18
Tier-1 ISP: 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
Stockton San Jose Cheyenne
Kansas City .
peering
Chicago Roachdale
New York Pennsauken Relay Wash. DC
Anaheim
Atlanta
to/from customers Fort Worth
Orlando
Introduction
1-19
Internet structure
Tier-2 ISPs: smaller (often regional) ISPs
Connect to one or more tier-1 ISPs, possibly other tier-2 ISPs
Tier-2 ISP pays tier-1 ISP for connectivity to rest of Internet
Tier-2 ISP is customer of tier-1 provider
Tier-2 ISP
Tier-2 ISP
Tier 1 ISP
NAP
Tier-2 ISPs also peer privately with each other, interconnect at NAP
Tier-2 ISP
Tier 1 ISP
Tier-2 ISP
Tier 1 ISP
Tier-2 ISP
Introduction
1-20
Internet structure
Tier-3 ISPs and local ISPs
Last hop (access) network (closest to end systems)
local ISP Local and tier3 ISPs are customers of higher tier ISPs connecting them to rest of Internet Tier 3 ISP Tier-2 ISP local ISP
local ISP
local ISP Tier-2 ISP
Tier 1 ISP
NAP
Tier 1 ISP
Tier 1 ISP
Tier-2 ISP local ISP
Tier-2 ISP local ISP
Introduction 1-21
Tier-2 ISP local local ISP ISP
Internet structure
Two networks can have
Customer-provider relationship provider sells access to customer Peer-peer relationship networks can reach each others customers at no charge Networks peer if they have same size/status
Introduction
1-22
Internet structure
A packet passes through many networks!
local ISP
Tier 3 ISP Tier-2 ISP
local ISP
local ISP Tier-2 ISP
local ISP
Tier 1 ISP
NAP
Tier 1 ISP
Tier-2 ISP local local ISP ISP
Tier 1 ISP
Tier-2 ISP local ISP
Tier-2 ISP local ISP
Introduction 1-23
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 If queue is full, packets are dropped
packet being transmitted (delay)
A B
packets queueing (delay) free (available) buffers: arriving packets dropped (loss) if no free buffers
Introduction
1-24
Four sources of packet delay
1. processing:
Check bit errors Determine output link
2. queueing
Time waiting at output link for transmission Depends on congestion level of router
A B
transmission
propagation
nodal processing
queueing
Introduction 1-25
Four sources of packet delay
3. Transmission delay:
R=link bandwidth (bps) L=packet length (bits) time to send bits into link = L/R
4. Propagation delay:
d = length of physical link s = propagation speed in medium (~2x108 m/sec) propagation delay = d/s
A B
transmission
Note: s and R are very different quantities!
propagation
nodal processing
queueing
Introduction 1-26
Caravan analogy
100 km 10-car caravan toll booth toll booth 100 km
Cars propagate at 100 km/hr Toll booth takes 12 sec to service a car (transmission time) car~bit; caravan ~ packet Q: How long until the whole caravan is lined up before 2nd toll booth?
Time to push entire caravan through toll booth onto highway = 12*10 = 120 sec Time for last car to propagate from 1st to 2nd toll both: 100km/(100km/hr)= 1 hr A: 62 minutes
Introduction 1-27
Caravan analogy (more)
100 km 10-car caravan toll booth toll booth 100 km
Cars now propagate at 1000 km/hr Toll booth now takes 1 min to service a car Q: Will cars arrive to 2nd booth before all cars serviced at 1st booth?
Yes! After 7 min, 1st car at 2nd booth and 3 cars still at 1st booth. 1st bit of packet can arrive at 2nd router before packet is fully transmitted at 1st router!
Introduction
1-28
Nodal delay
d nodal d proc d queue d trans d prop
dproc = processing delay dqueue = queuing delay
typically a few microsecs or less
depends on congestion = L/R, significant for low-speed links a few microsecs to hundreds of msecs
dtrans = transmission delay dprop = propagation delay
Introduction
1-29
Queueing delay (revisited)
R=link bandwidth (bps) L=packet length (bits) a=average packet arrival rate traffic intensity = La/R L*a/R ~ 0: average queueing delay small L*a/R -> 1: delays become large L*a/R > 1: more work arriving than can be serviced, average delay infinite!
Introduction 1-30
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
Introduction
3 probes
1-31
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 link 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 * * * * means no response (probe lost, router not replying) 18 * * * 19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms
Introduction 1-32
Packet loss
Queue (aka buffer) preceding link in buffer has finite capacity When packet arrives to full queue, packet is dropped (aka lost) Lost packet may be retransmitted by previous node, by source end system, or not retransmitted at all
Introduction
1-33
Protocol Layers
Networks are complex! many pieces: hosts routers links of various media applications protocols hardware, software
Question:
Is there any hope of organizing structure of network?
Or at least our discussion of networks?
Introduction
1-34
Organization of air travel
ticket (purchase) ticket (complain) baggage (claim) gates (unload) runway landing
baggage (check)
gates (load) runway takeoff airplane routing
airplane routing
airplane routing
a series of steps
Introduction 1-35
Layering of airline functionality
ticket (purchase) baggage (check) gates (load) runway (takeoff) airplane routing
departure airport
ticket (complain) baggage (claim gates (unload) runway (land) airplane routing airplane routing airplane routing
arrival airport
ticket baggage gate takeoff/landing airplane routing
intermediate air-traffic control centers
Layers: each layer implements a service via its own internal-layer actions relying on services provided by layer below
Introduction
1-36
Why layering?
Dealing with complex systems:
Explicit structure allows identification, relationship of complex systems pieces Modularization eases maintenance, updating of system Change of implementation of layers service transparent to rest of system e.g., change in gate procedure doesnt affect rest of system
Introduction
1-37
Internet protocol stack
Application: supporting network
applications
FTP, SMTP, HTTP
application transport network link physical
Transport: host-host data transfer TCP, UDP
Network: routing of datagrams
from source to destination
IP, routing protocols
Link: data transfer between
neighboring network elements
PPP, Ethernet
Physical: bits on the wire
Introduction 1-38
Link layer vs. network layer
IP 1.2.3.4 LA4
LA1 workstation A
LA2 workstation C IP 1.2.3.5
LA5 LA6 LA7 LA8
LA3 router 1
Link protocol will deliver a message to the right device in local network
LA9
router 2 IP 7.8.9.10
Ethernet Shared link medium
LA10 server B
Introduction 1-39
Network protocol will help us deliver a message from source to destination via routers who know the nexthop from their routing table
How to talk on the Internet?
workstation A router 1
link layer link protocol This is a message for router 1 network layer IP protocol This is message from A to B
router 2
transport layer TCP/UDP/ protocol This is message 2 for Web application application layer HTTP protocol I want this webpage!
router 3 server B
Introduction 1-40
source
datagram Hn Ht
Hl Hn Ht
message segment Ht
M M M M
frame
application transport network link physical
Encapsulation
Hl Hn Ht
link physical
Hl Hn Ht
switch
destination
M
Ht
Hn Ht Hl Hn Ht
M M M
application transport network link physical
Hn Ht Hl Hn Ht
M
M
network link physical
Hn Ht Hl Hn Ht
M M
router
Introduction
1-41
Internet History
1961-1972: Early packet-switching principles
1961: Kleinrock - queueing theory shows effectiveness of packetswitching 1964: Baran - packetswitching in military nets 1967: ARPAnet conceived by Advanced Research Projects Agency 1969: first ARPAnet node operational 1972: ARPAnet public demonstration NCP (Network Control Protocol) first host-host protocol first e-mail program ARPAnet has 15 nodes
Introduction
1-42
Internet History
1972-1980: Internetworking, new and proprietary nets
1970: ALOHAnet satellite network in Hawaii 1974: Cerf and Kahn architecture for interconnecting networks 1976: Ethernet at Xerox PARC late70s: proprietary architectures: DECnet, SNA, XNA late 70s: switching fixed length packets (ATM precursor) 1979: ARPAnet has 200 nodes Cerf and Kahns internetworking principles: minimalism, autonomy - no internal changes required to interconnect networks best effort service model stateless routers decentralized control define todays Internet architecture
Introduction
1-43
Internet History
1980-1990: new protocols, a proliferation of networks
1983: deployment of TCP/IP 1982: smtp e-mail protocol defined 1983: DNS defined for name-to-IP-address translation 1985: ftp protocol defined 1988: TCP congestion control New national networks: Csnet, BITnet, NSFnet, Minitel 100,000 hosts connected to confederation of networks
Introduction
1-44
Internet History
1990, 2000s: commercialization, the Web, new apps
Early 1990s: ARPAnet Late 1990s 2000s: 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 1960s] Backbone links running at HTML, HTTP: Berners-Lee Gbps 1994: Mosaic, later Netscape Late 1990s: commercialization of the Web
Introduction 1-45
Introduction
1-46