Professional Documents
Culture Documents
frequency
frequency band
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
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
Introduction
1-5
Statistical multiplexing
A B
10 Mb/s Ethernet
statistical multiplexing
1.5 Mb/s
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
circuit-switching:
10 users
packet switching:
With 35 users, p(#active>10) < 0.0004 Q: How did we get value 0.0004?
Introduction
1-7
p(#active = n)
p(#active n)
Introduction 1-8
Introduction
1-9
Datagram network:
Introduction
1-11
Network taxonomy
Telecommunication networks
Circuit-switched 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
access
Network of cable and fiber attaches homes to ISP router Homes share access to router
Introduction 1-14
Introduction
1-15
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
cable modem
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 ISP
NAP
Tier 1 ISP
Tier 1 ISP
Introduction
1-18
Seattle Tacoma
POP: point-of-presence
to/from backbone
Stockton San Jose Cheyenne
Kansas City .
peering
Chicago Roachdale
Anaheim
Atlanta
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
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
Tier 1 ISP
NAP
Tier 1 ISP
Tier 1 ISP
Tier-2 ISP local 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
local 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
A B
packets queueing (delay) free (available) buffers: arriving packets dropped (loss) if no free buffers
Introduction
1-24
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
4. Propagation delay:
d = length of physical link s = propagation speed in medium (~2x108 m/sec) propagation delay = d/s
A B
transmission
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
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
Introduction
1-29
3 probes
1-31
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
baggage (check)
gates (load) runway takeoff airplane routing
airplane routing
airplane routing
a series of steps
Introduction 1-35
ticket (complain) baggage (claim gates (unload) runway (land) airplane routing airplane routing airplane routing
arrival airport
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
applications
LA1 workstation A
LA2 workstation C IP 1.2.3.5
LA3 router 1
Link protocol will deliver a message to the right device in local network
LA9
router 2 IP 7.8.9.10
Network protocol will help us deliver a message from source to destination via routers who know the nexthop from their routing table
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
Encapsulation
Hl Hn Ht
link physical
Hl Hn Ht
switch
destination
M
Ht
Hn Ht Hl Hn Ht
M M M
Hn Ht Hl Hn Ht
M
M
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