1. 1: Introduction1 Part I: Introduction Chapter goal: r get context, overview, “feel” of networking r more depth, detail later in course r approach: m descriptive m use Internet as example Overview: r what’s the Internet r what’s a protocol? r network edge r network core r access net, physical media r performance: loss, delay r protocol layers, service models r backbones, NAPs, ISPs r history r ATM network

2. 1: Introduction2 What’s the Internet: “nuts and bolts” view r millions of connected computing devices: hosts, end-systems m pc’s workstations, servers m PDA’s phones, toasters running network apps r communication links m fiber, copper, radio, satellite r routers: forward packets (chunks) of data thru network local ISP company network regional ISP router workstation server mobile

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

4. 1: Introduction4 What’s the Internet: a service view r communication infrastructure enables distributed applications: m WWW, email, games, e- commerce, database., voting, m more? r communication services provided: m connectionless m connection-oriented r cyberspace [Gibson]: “a consensual hallucination experienced daily by billions of operators, in every nation,...."

5. 1: Introduction5 What’s a protocol? human protocols: r “what’s the time?” r “I have a question” r introductions … specific msgs sent … specific actions taken when msgs received, or other events network protocols: r machines rather than humans r all communication activity in Internet governed by protocols protocols define format, order of msgs sent and received among network entities, and actions taken on msg transmission, receipt

6. 1: Introduction6 What’s a protocol? a human protocol and a computer network protocol: Q: Other human protocol? Hi Got the time? 2:00 TCP connection req. TCP connection reply. Get http://gaia.cs.umass.edu/index.htm time

7. 1: Introduction7 A closer look at network structure: r network edge: applications and hosts r network core: m routers m network of networks r access networks, physical media: communication links

8. 1: Introduction8 The network edge: r end systems (hosts): m run application programs m e.g., WWW, email m at “edge of network” r client/server model m client host requests, receives service from server m e.g., WWW client (browser)/ server; email client/server r peer-peer model: m host interaction symmetric m e.g.: teleconferencing

9. 1: Introduction9 Network edge: connection-oriented service Goal: data transfer between end sys. r handshaking: setup (prepare for) data transfer ahead of time m Hello, hello back human protocol m set up “state” in two communicating hosts r TCP - Transmission Control Protocol m Internet’s connection- oriented service TCP service [RFC 793] r reliable, in-order byte- stream data transfer m loss: acknowledgements and retransmissions r flow control: m sender won’t overwhelm receiver r congestion control: m senders “slow down sending rate” when network congested

10. 1: Introduction10 Network edge: connectionless service Goal: data transfer between end systems m same as before! r UDP - User Datagram Protocol [RFC 768]: Internet’s connectionless service m unreliable data transfer m no flow control m no congestion control App’s using TCP: r HTTP (WWW), FTP (file transfer), Telnet (remote login), SMTP (email) App’s using UDP: r streaming media, teleconferencing, Internet telephony

11. 1: Introduction11 The Network Core r mesh of interconnected routers r the fundamental question: how is data transferred through net? m circuit switching: dedicated circuit per call: telephone net m packet-switching: data sent thru net in discrete “chunks”

12. 1: Introduction12 Network Core: Circuit Switching End-end resources reserved for “call” r link bandwidth, switch capacity r dedicated resources: no sharing r circuit-like (guaranteed) performance r call setup required

13. 1: Introduction13 Network Core: Circuit Switching network resources (e.g., bandwidth) divided into “pieces” r pieces allocated to calls r resource piece idle if not used by owning call (no sharing) r dividing link bandwidth into “pieces” m frequency division m time division

14. 1: Introduction14 Numerical example r How long does it take to send a file of 640,000 bits from host A to host B over a circuit-switched network? m All links are 1.536 Mbps m Each link uses TDM with 24 slots m 500 msec to establish end-to-end circuit Work it out!

15. 1: Introduction15 Network Core: Packet Switching each end-end data stream divided into packets r user A, B packets share network resources r each packet uses full link bandwidth r resources used as needed, resource contention: r aggregate resource demand can exceed amount available r congestion: packets queue, wait for link use r store and forward: packets move one hop at a time m transmit over link m wait turn at next link Bandwidth division into “pieces” Dedicated allocation Resource reservation

16. 1: Introduction16 Network Core: Packet Switching Packet-switching versus circuit switching: human restaurant analogy r other human analogies? A B C 10 Mbs Ethernet 1.5 Mbs 45 Mbs D E statistical multiplexing queue of packets waiting for output link

17. 1: Introduction17 Network Core: Packet Switching Packet-switching: store and forward behavior

18. 1: Introduction18 Packet switching versus circuit switching r Great for bursty data m resource sharing m no call setup r Excessive congestion: packet delay and loss m protocols needed for reliable data transfer, congestion control r Q: How to provide circuit-like behavior? m bandwidth guarantees needed for audio/video apps still an unsolved problem (chapter 6) Is packet switching a “slam dunk winner?”

19. 1: Introduction19 Packet-switched networks: routing r Goal: move packets among routers from source to destination m we’ll study several path selection algorithms (chapter 4) r datagram network: m destination address determines next hop m routes may change during session m analogy: driving, asking directions r virtual circuit network: m each packet carries tag (virtual circuit ID), tag determines next hop m fixed path determined at call setup time, remains fixed thru call m routers maintain per-call state

20. 1: Introduction20 Access networks and physical media Q: How to connection end systems to edge router? r residential access nets r institutional access networks (school, company) r mobile access networks Keep in mind: r bandwidth (bits per second) of access network? r shared or dedicated?

21. 1: Introduction21 Residential access: point to point access r Dialup via modem m up to 56Kbps direct access to router (conceptually) r ISDN: intergrated services digital network: 128Kbps all- digital connect to router r ADSL: asymmetric digital subscriber line m up to 1 Mbps home-to-router m up to 8 Mbps router-to-home m ADSL deployment: UPDATE THIS

22. 1: Introduction22 Residential access: cable modems r HFC: hybrid fiber coax m asymmetric: up to 10Mbps upstream, 1 Mbps downstream r network of cable and fiber attaches homes to ISP router m shared access to router among home m issues: congestion, dimensioning r deployment: available via cable companies, e.g., MediaOne

23. 1: Introduction23 Institutional access: local area networks r company/univ local area network (LAN) connects end system to edge router r Ethernet: m shared or dedicated cable connects end system and router m 10 Mbs, 100Mbps, Gigabit Ethernet r deployment: institutions, home LANs soon r LANs: chapter 5

24. 1: Introduction24 Wireless access networks r shared wireless access network connects end system to router r wireless LANs: m radio spectrum replaces wire m e.g., Lucent Wavelan 10 Mbps r wider-area wireless access m CDPD: wireless access to ISP router via cellular network base station mobile hosts router

25. 1: Introduction25 Physical Media r physical link: transmitted data bit propagates across link r guided media: m signals propagate in solid media: copper, fiber r unguided media: m signals propagate freelye.g., radio Twisted Pair (TP) r two insulated copper wires m Category 3: traditional phone wires, 10 Mbps ethernet m Category 5 TP: 100Mbps ethernet

26. 1: Introduction26 Physical Media: coax, fiber Coaxial cable: r wire (signal carrier) within a wire (shield) m baseband: single channel on cable m broadband: multiple channel on cable r bidirectional r common use in 10Mbs Ethernet Fiber optic cable: r glass fiber carrying light pulses r high-speed operation: m 100Mbps Ethernet m high-speed point-to-point transmission (e.g., 5 Gps) r low error rate

27. 1: Introduction27 Physical media: radio r signal carried in electromagnetic spectrum r no physical “wire” r bidirectional r propagation environment effects: m reflection m obstruction by objects m interference Radio link types: r microwave m e.g. up to 45 Mbps channels r LAN (e.g., waveLAN) m 2Mbps, 11Mbps r wide-area (e.g., cellular) m e.g. CDPD, 10’s Kbps r satellite m up to 50Mbps channel (or multiple smaller channels) m 270 Msec end-end delay m geosynchronous versus LEOS

28. 1: Introduction28 Delay in packet-switched networks packets experience delay on end-to-end path r four sources of delay at each hop r nodal processing: m check bit errors m determine output link r queueing m time waiting at output link for transmission m depends on congestion level of router A B propagation transmission nodal processing queueing

29. 1: Introduction29 Delay in packet-switched networks Transmission delay: r R=link bandwidth (bps) r L=packet length (bits) r time to send bits into link = L/R Propagation delay: r d = length of physical link r s = propagation speed in medium (~2x10 8 m/sec) r propagation delay = d/s A B propagation transmission nodal processing queueing Note: s and R are very different quantitites!

30. 1: Introduction30 Queueing delay (revisited) r R=link bandwidth (bps) r L=packet length (bits) r a=average packet arrival rate traffic intensity = La/R r La/R ~ 0: average queueing delay small r La/R -> 1: delays become large r La/R > 1: more “work” arriving than can be serviced, average delay infinite!

31. 1: Introduction31 “Real” Internet delays and routes 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 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 * * * 19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms traceroute: gaia.cs.umass.edu to www.eurecom.fr Three delay measements from gaia.cs.umass.edu to cs-gw.cs.umass.edu * means no reponse (probe lost, router not replying) trans-oceanic link

32. 1: Introduction32 Packet loss r queue (aka buffer) preceding link in buffer has finite capacity r when packet arrives to full queue, packet is dropped (aka lost) r lost packet may be retransmitted by previous node, by source end system, or not retransmitted at all

33. 1: Introduction33 Protocol “Layers” Networks are complex! r many “pieces”: m hosts m routers m links of various media m applications m protocols m hardware, software Question: Is there any hope of organizing structure of network? Or at least our discussion of networks?

34. 1: Introduction34 Organization of air travel r a series of steps ticket (purchase) baggage (check) gates (load) runway takeoff airplane routing ticket (complain) baggage (claim) gates (unload) runway landing airplane routing

35. 1: Introduction35 ticket (purchase) baggage (check) gates (load) runway (takeoff) airplane routing departure airport arrival airport intermediate air-traffic control centers airplane routing ticket (complain) baggage (claim gates (unload) runway (land) airplane routing ticket baggage gate takeoff/landing airplane routing Layering of airline functionality Layers: each layer implements a service m via its own internal-layer actions m relying on services provided by layer below

36. 1: Introduction36 Why layering? Dealing with complex systems: r explicit structure allows identification, relationship of complex system’s pieces m layered reference model for discussion r modularization eases maintenance, updating of system m change of implementation of layer’s service transparent to rest of system m e.g., change in gate procedure doesn’t affect rest of system r layering considered harmful?

37. 1: Introduction37 Internet protocol stack r application: supporting network applications m FTP, SMTP, STTP r transport: host-host data transfer m TCP, UDP r network: routing of datagrams from source to destination m IP, routing protocols r link: data transfer between neighboring network elements m PPP, Ethernet r physical: bits “on the wire” application transport network link physical

38. 1: Introduction38 Internet History r 1961: Kleinrock - queueing theory shows effectiveness of packet- switching r 1964: Baran - packet- switching in military nets r 1967: ARPAnet conceived by Advanced Research Projects Agency r 1969: first ARPAnet node operational r 1972: m ARPAnet demonstrated publicly m NCP (Network Control Protocol) first host- host protocol m first e-mail program m ARPAnet has 15 nodes 1961-1972: Early packet-switching principles

39. 1: Introduction39 Internet History r 1970: ALOHAnet satellite network in Hawaii r 1973: Metcalfe’s PhD thesis proposes Ethernet r 1974: Cerf and Kahn - architecture for interconnecting networks r late70’s: proprietary architectures: DECnet, SNA, XNA r late 70’s: switching fixed length packets (ATM precursor) r 1979: ARPAnet has 200 nodes Cerf and Kahn’s internetworking principles: m minimalism, autonomy - no internal changes required to interconnect networks m best effort service model m stateless routers m decentralized control define today’s Internet architecture 1972-1980: Internetworking, new and proprietary nets

40. 1: Introduction40 Internet History r Early 1990’s: ARPAnet decommissioned r 1991: NSF lifts restrictions on commercial use of NSFnet (decommissioned, 1995) r early 1990s: Web m hypertext [Bush 1945, Nelson 1960’s] m HTML, HTTP: Berners-Lee m 1994: Mosaic, later Netscape m late 1990’s: commercialization of the Web Late 1990’s – 2000’s: r more killer apps: instant messaging, P2P file sharing r network security to forefront r est. 50 million host, 100 million+ users r backbone links running at Gbps 1990, 2000’s: commercialization, the Web, new apps