Chapter 1: Introduction. Chapter 1 Introduction. Cool internet appliances. What s the Internet: nuts and bolts view

Transcription

1 Chapter 1 Introduction A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete slides (including this one) and slide content to suit your needs. They obviously represent a lot of work on our part. In return for use, we only ask the following: If you use these slides (e.g., in a class) in substantially unaltered form, that you mention their source (after all, we d like people to use our book!) If you post any slides in substantially unaltered form on a www site, that you note that they are adapted from (or perhaps identical to) our slides, and note our copyright of this material. Thanks and enjoy! JFK/KWR All material copyright J.F Kurose and K.W. Ross, All Rights Reserved Computer Networking: A Top Down Approach, 4 th edition. Jim Kurose, Keith Ross Addison-Wesley, July Introduction 1-1 Chapter 1: Introduction Our goal: get feel and terminology more depth, detail later in course approach: use Internet as example Overview: what s the Internet? what s a protocol? edge; hosts, access net, media core: packet/circuit switching, Internet structure performance: loss, delay, throughput security protocol layers, service models history Introduction 1-2 What s the Internet: nuts and bolts view PC server wireless laptop cellular handheld router access points wired s millions of connected computing devices: hosts = end systems running apps communication s fiber, copper, radio, satellite transmission rate = bandwidth routers: forward packets (chunks of data) obile Home Global Regional Institutional Introduction 1- Cool internet appliances IP picture frame World s smallest web server Web-enabled toaster + weather forecaster Internet phones Introduction 1-4 What s the Internet: nuts and bolts view protocols control sending, receiving of msgs e.g., TCP, IP, HTTP, Skype, Ethernet Internet: of s loosely hierarchical public Internet versus private intranet Internet standards RFC: Request for comments IETF: Internet Engineering Task Force obile Home Global Regional Institutional Introduction 1-5 What s the Internet: a service view communication infrastructure enables distributed s: Web, VoIP, , games, e-commerce, file sharing communication services provided to apps: reliable data delivery from source to destination best effort (unreliable) data delivery Introduction 1-6

2 What s a protocol? What s a protocol? human protocols: what s the time? I have a question introductions specific msgs sent specific actions taken when msgs received, or other events protocols: machines rather than humans all communication activity in Internet governed by protocols protocols define format, order of msgs sent and received among entities, and actions taken on msg transmission, receipt Introduction 1-7 a human protocol and a computer protocol: Hi Hi Got the time? 2:00 time Q: Other human protocols? TCP connection request TCP connection response Get <file> Introduction 1-8 Key Elements of a Protocol A closer look at structure: Syntax Data formats Signal levels Semantics Control information Error handling Timing Speed matching Sequencing Introduction 1-9 edge: s and hosts access s, media: wired, wireless communication s core: interconnected routers of s Introduction 1- The edge: Network edge: connection-oriented service end systems (hosts): run programs e.g. Web, at edge of client/server model peer-peer client host requests, receives service from always-on server client/server e.g. Web browser/server; client/server peer-peer model: minimal (or no) use of dedicated servers e.g. Skype, BitTorrent Introduction 1-11 Goal: data transfer between end systems handshaking: setup (prepare for) data transfer ahead of time Hello, hello back human protocol set up state in two communicating hosts TCP - Transmission Control Protocol Internet s connectionoriented service TCP service [RFC 79] reliable, in-order bytestream data transfer loss: acknowledgements and retransmissions flow control: sender won t overwhelm receiver congestion control: senders slow down sending rate when congested Introduction 1-12

3 Network edge: connectionless service Access s and media Goal: data transfer between end systems same as before! UDP - User Datagram Protocol [RFC 768]: Internet s connectionless service unreliable data transfer no flow control no congestion control App s using TCP: HTTP (Web), FTP (file transfer), Telnet (remote login), STP ( ) App s using UDP: streaming media, teleconferencing, DNS, Internet telephony Q: How to connect end systems to edge router? residential access nets institutional access s (school, company) mobile access s Keep in mind: bandwidth (bits per second) of access? shared or dedicated? Introduction 1-1 Introduction 1-14 Residential access: point to point access Residential access: cable modems 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 bps upstream (today typically < 256 kbps) up to 8 bps downstream (today typically < 1 bps) dedicated line to telephone central office HFC: hybrid fiber coax asymmetric: up to 0bps downstream, 2 bps upstream of cable and fiber attaches homes to router homes share access to router deployment: available via cable TV companies Introduction 1-15 Introduction 1-16 Residential access: cable modems Cable Network Architecture: Overview Typically 500 to 5,000 homes cable headend cable distribution (simplified) home Diagram: Introduction 1-17 Introduction 1-18

4 Cable Network Architecture: Overview Cable Network Architecture: Overview server(s) cable headend cable headend cable distribution home cable distribution (simplified) home Introduction 1-19 Introduction 1-20 Cable Network Architecture: Overview Company access: area s FD (more shortly): cable headend cable distribution 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 Channels home company/univ area (LAN) connects end system to edge router Ethernet: bs, 0bps, 1Gbps, Gbps Ethernet modern configuration: end systems connect into Ethernet switch LANs: chapter 5 Introduction 1-21 Introduction 1-22 Wireless access s Home s shared wireless access connects end system to router router via base station aka access point base wireless LANs: station b/g (WiFi): 11 or 54 bps wider-area wireless access provided by telco operator ~1bps over cellular system (EVDO, HSDPA) next up (?): WiAX ( s bps) over wide area mobile hosts Typical home components: DSL or cable modem router/firewall/nat Ethernet wireless access point to/from cable headend cable modem router/ firewall Ethernet wireless access point wireless laptops Introduction 1-2 Introduction 1-24

5 Physical edia Physical edia: coax, fiber Bit: propagates between transmitter/rcvr pairs : what lies between transmitter & receiver guided media: signals propagate in solid media: copper, fiber, coax unguided media: signals propagate freely, e.g., radio Twisted Pair (TP) two insulated copper wires Category : traditional phone wires, bps Ethernet Category 5: 0bps Ethernet Coaxial cable: two concentric copper conductors bidirectional baseband: single channel on cable legacy Ethernet broadband: multiple channels on cable HFC Fiber optic cable: glass fiber carrying light pulses, each pulse a bit high-speed operation: high-speed point-to-point transmission (e.g., s- 0 s Gps) low error rate: repeaters spaced far apart ; immune to electromagnetic noise Introduction 1-25 Introduction 1-26 Physical media: radio signal carried in electromagnetic spectrum no wire bidirectional propagation environment effects: reflection obstruction by objects interference Radio types: terrestrial microwave e.g. up to 45 bps channels LAN (e.g., Wifi) 11bps, 54 bps wide-area (e.g., cellular) G cellular: ~ 1 bps satellite Kbps to 45bps channel (or multiple smaller channels) 270 msec end-end delay geosynchronous versus low altitude 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-27 Introduction 1-28 Network Core: Circuit Switching Network Core: Circuit Switching End-end resources reserved for call bandwidth, switch capacity dedicated resources: no sharing circuit-like (guaranteed) performance call setup required resources (e.g., bandwidth) divided into pieces pieces allocated to calls resource piece idle if not used by owning call (no sharing) dividing bandwidth into pieces frequency division time division Introduction 1-29 Introduction 1-0

6 Circuit Switching: FD and TD Example: FD 4 users frequency FD ja TD TD frequency time time Introduction 1-1 TD ja STD Network Core: Packet Switching data addr data each end-end data stream divided into packets user A, B packets share resources each packet uses full 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 use store and forward: packets move one hop at a time Node receives complete packet before forwarding Introduction 1-4 Packet Switching: Statistical ultiplexing Packet-switching: store-and-forward A 0 b/s Ethernet statistical multiplexing C L R R R B queue of packets waiting for output 1.5 b/s D Sequence of A & B packets does not have fixed pattern, bandwidth shared on demand statistical multiplexing. TD: each host gets same slot in revolving TD frame. E Introduction 1-5 takes L/R seconds to transmit (push out) packet of L bits on to at R bps store and forward: entire packet must arrive at router before it can be transmitted on next delay = L/R (assuming zero propagation delay) Example: L = 7.5 bits R = 1.5 bps transmission delay = 15 sec more on delay shortly Introduction 1-6

7 Packet switching versus circuit switching Packet switching allows more users to use! 1 b/s each user: 0 kb/s when active active % of time circuit-switching: users packet switching: with 5 users, probability > active at same time is less than.0004 N users 1 bps Q: how did we get value ? Introduction 1-7 Packet switching versus circuit switching 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-8 Packet Switching: essage Segmenting Packet size Now break up the message into 5000 packets Each packet 1,500 bits 1 msec to transmit packet on one pipelining: each works in parallel Delay reduced from 15 sec to sec A 1 2 B time = 99 Introduction 1-9 Packet size Packet size A 1 2 B time = 65 A 1 2 B time = 72

8 . Packet-switched s: forwarding Goal: move packets through routers from source to destination we ll study several path selection (i.e. routing)algorithms (chapter 4) datagram : destination address in packet determines next hop routes may change during session analogy: driving, asking directions virtual circuit : each packet carries tag (virtual circuit ID), tag determines next hop fixed path determined at call setup time, remains fixed thru call routers maintain per-call state Introduction 1-4 Network Taxonomy FD Circuit-switched s Telecommunication s TD Packet-switched s Networks with VCs Datagram is not either connection-oriented or connectionless. Internet provides both connection-oriented (TCP) and connectionless services (UDP) to apps. Datagram Networks Introduction 1-44 Internet structure: of s roughly hierarchical at center: tier-1 s (e.g., Verizon, Sprint, AT&T, Cable and Wireless), national/international coverage treat each other as equals Tier-1 : e.g., Sprint POP: point-of-presence to/from backbone peering Tier-1 providers interconnect (peer) privately Tier 1 Tier 1 Tier 1 to/from customers Introduction 1-45 Introduction 1-46 Internet structure: of s Tier-2 s: smaller (often regional) s Connect to one or more tier-1 s, possibly other tier-2 s Internet structure: of s Tier- s and s last hop ( access ) (closest to end systems) Tier-2 pays tier-1 for connectivity to rest of Internet tier-2 is customer of tier-1 provider Tier-2 Tier 1 Tier-2 Tier 1 Tier-2 Tier 1 Tier-2 Tier-2 s also peer privately with each other. Tier-2 Introduction 1-47 Local and tier- s are customers of higher tier s connecting them to rest of Internet Tier Tier-2 Tier 1 Tier-2 Tier 1 Tier-2 Tier 1 Tier-2 Tier-2 Introduction 1-48

9 Internet structure: of s a packet passes through many s! Tier Tier-2 Tier 1 Tier-2 How do loss and delay occur? packets queue in router buffers packet arrival rate to exceeds output capacity packets queue, wait for turn A packet being transmitted (delay) Tier 1 Tier-2 Tier 1 Tier-2 Tier-2 Introduction 1-49 B packets queueing (delay) free (available) buffers: arriving packets dropped (loss) if no free buffers Introduction 1-50 Four sources of packet delay Delay in packet-switched s 1. nodal processing: check bit errors determine output 2. queueing time waiting at output for transmission depends on congestion level of router. Transmission delay: R= bandwidth (bps) L=packet length (bits) time to send bits into = L/R 4. Propagation delay: d = length of s = propagation speed in medium (~2x 8 m/sec) propagation delay = d/s A B transmission nodal processing propagation queueing Introduction 1-51 A B transmission nodal processing propagation queueing Note: s and R are very different quantities! Introduction 1-52 Packet Processing inside switches Forwarding Table Forwarding Decision Interconnect Output Scheduling Switching Fabric Forwarding Table Forwarding Decision Forwarding Table Forwarding Decision Introduction 1-5 Introduction 1-54

10 Switching Interconnects Two basic techniques Caravan analogy 0 km 0 km Input Queuing Output Queuing ten-car caravan toll booth toll booth Usually a non-blocking switch fabric (e.g. crossbar) Usually a fast bus cars propagate at 0 km/hr toll booth takes 12 sec to service car (transmission time) car~bit; caravan ~ packet Q: How long until caravan is lined up before 2nd toll booth? Time to push entire caravan through toll booth onto highway = 12* = 120 sec Time for last car to propagate from 1st to 2nd toll both: 0km/(0km/hr)= 1 hr A: 62 minutes Introduction 1-55 Introduction 1-56 Caravan analogy (more) ten-car caravan toll booth Cars now propagate at 00 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? 0 km 0 km toll booth Yes! After 7 min, 1st car at 2nd booth and cars still at 1st booth. 1st bit of packet can arrive at 2nd router before packet is fully transmitted at 1st router! See Ethernet applet at AWL Web site Nodal delay d = d + d + d + d nodal proc d proc = processing delay queue trans typically a few microsecs or less d queue = queuing delay depends on congestion d trans = transmission delay = L/R, significant for low-speed s d prop = propagation delay a few microsecs to hundreds of msecs prop Introduction 1-57 Introduction 1-58 Queueing delay (revisited) Real Internet delays and routes R= 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! 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. probes probes probes Introduction 1-59 Introduction 1-60

11 Real Internet delays and routes traceroute: gaia.cs.umass.edu to Three delay measurements from gaia.cs.umass.edu to cs-gw.cs.umass.edu 1 cs-gw ( ) 1 ms 1 ms 2 ms 2 border1-rt-fa5-1-0.gw.umass.edu ( ) 1 ms 1 ms 2 ms cht-vbns.gw.umass.edu ( ) 6 ms 5 ms 5 ms 4 jn1-at wor.vbns.net ( ) 16 ms 11 ms 1 ms 5 jn1-so wae.vbns.net ( ) 21 ms 18 ms 18 ms 6 abilene-vbns.abilene.ucaid.edu ( ) 22 ms 18 ms 22 ms 7 nycm-wash.abilene.ucaid.edu ( ) 22 ms 22 ms 22 ms ( ) 4 ms 9 ms 6 ms 9 de2-1.de1.de.geant.net ( ) 9 ms 2 ms 4 ms de.fr1.fr.geant.net ( ) 11 ms 121 ms 114 ms 11 renater-gw.fr1.fr.geant.net ( ) 112 ms 114 ms 112 ms 12 nio-n2.cssi.renater.fr ( ) 111 ms 114 ms 116 ms 1 nice.cssi.renater.fr ( ) 12 ms 125 ms 124 ms 14 rt2-nice.cssi.renater.fr ( ) 126 ms 126 ms 124 ms 15 eurecom-valbonne.rt2.ft.net ( ) 15 ms 128 ms 1 ms ( ) 126 ms 128 ms 126 ms 17 * * * 18 * * * 19 fantasia.eurecom.fr ( ) 12 ms 128 ms 16 ms trans-oceanic * means no response (probe lost, router not replying) Introduction 1-61 Packet loss queue (aka buffer) preceding 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 A B buffer (waiting area) packet arriving to full buffer is lost packet being transmitted Introduction 1-62 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 Throughput (more) R s < R c What is average end-end throughput? R s bits/sec R c bits/sec R s > R c What is average end-end throughput? R s bits/sec R c bits/sec server server, sends with bits (fluid) file of into F bits pipe to send to client pipe that capacity can carry fluid R s bits/sec at rate R s bits/sec) pipe that capacity can carry Rfluid c bits/sec at rate R c bits/sec) bottleneck on end-end path that constrains end-end throughput Introduction 1-6 Introduction 1-64 Throughput: Internet scenario Switching Techniques Revisited per-connection end-end throughput: min(r c,r s,r/) in practice: R c or R s is often bottleneck R s R s R s R R c R c R c connections (fairly) share backbone bottleneck R bits/sec Introduction 1-65 Introduction 1-66

12 Protocol Layers Organization of air travel Networks are complex! many pieces : hosts routers s of various media s protocols hardware, software Question: Is there any hope of organizing structure of? Or at least our discussion of s? ticket (purchase) ticket (complain) baggage (check) baggage (claim) gates (load) gates (unload) runway takeoff runway landing a series of steps Introduction 1-67 Introduction 1-68 Organization of air travel: a different view Layering of airline functionality ticket (purchase) baggage (check) gates (load) runway takeoff Layers: each layer implements a service via its own internal-layer actions ticket (complain) baggage (claim) gates (unload) runway landing relying on services provided by layer below Introduction 1-69 ticket (purchase) baggage (check) gates (load) runway (takeoff) departure airport intermediate air-traffic control centers Layers: each layer implements a service via its own internal-layer actions ticket (complain) baggage (claim gates (unload) runway (land) arrival airport relying on services provided by layer below ticket baggage gate takeoff/landing Introduction 1-70 Layered air travel: services Distributed implementation of layer functionality Counter-to-counter delivery of person+bags baggage-claim-to-baggage-claim delivery people transfer: loading gate to arrival gate runway-to-runway delivery of plane from source to destination Departing airport ticket (purchase) ticket (complain) baggage (check) baggage (claim) gates (load) gates (unload) runway takeoff runway landing intermediate air traffic sites arriving airport Introduction 1-71 Introduction 1-72

13 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-7 Internet protocol stack : supporting s FTP, STP, HTTP : process-process data transfer TCP, UDP : routing of datagrams from source to destination IP, routing protocols : data transfer between neighboring elements PPP, Ethernet : bits on the wire Introduction 1-74 ISO/OSI reference model Layering: logical communication presentation: allow s to interpret meaning of data, e.g., encryption, compression, machinespecific conventions session: synchronization, checkpointing, recovery of data exchange Internet stack missing these layers! these services, if needed, must be implemented in needed? presentation session Each layer: distributed entities implement layer functions at each node entities perform actions, exchange messages with peers Introduction 1-75 Introduction 1-76 Layering: logical communication E.g.: take data from app add addressing, reliability check info to form datagram send datagram to peer wait for peer to ack receipt analogy: post office data data ack data Layering: communication data data Introduction 1-77 Introduction 1-78

14 An Network Example Addressing level Level in architecture at which entity is named Unique address for each end system (computer) and router Network level address IP or internet address (TCP/IP) Network service access point or NSAP (OSI) Process within the system Port number (TCP/IP) Service access point or SAP (OSI) Introduction 1-79 Introduction 1-80 Address Concepts Addressing Scope Global non-ambiguity Global address identifies unique system There is only one system with address X Global applicability It is possible at any system (any address) to identify any other system (address) by the global address of the other system Address X identifies that system from anywhere on the e.g. AC address on IEEE 802 s Introduction 1-81 Introduction 1-82 Connection Identifiers Connection oriented data transfer (virtual circuits) Allocate a connection name during the transfer phase Reduced overhead as connection identifiers are shorter than global addresses Routing may be fixed and identified by connection name Entities may want multiple connections - multiplexing State information Introduction 1-8 Addressing ode Usually an address refers to a single system Unicast address Sent to one machine or person ay address all entities within a domain Broadcast Sent to all machines or users ay address a subset of the entities in a domain ulticast Sent to some machines or a group of users Introduction 1-84

15 ultiplexing Supporting multiple connections on one machine apping of multiple connections at one level to a single connection at another Carrying a number of connections on one fiber optic cable Aggregating or bonding ISDN lines to gain bandwidth Protocol layering and data Each layer takes data from above adds header information to create new data unit passes new data unit to layer below Ht HnHt Hl HnHt source destination Ht HnHt Hl HnHt message segment datagram frame Introduction 1-85 Introduction 1-86 segment H t datagram H n H t frame H l H n H t H t H n H t H n H l message H t destination source H t H n H t H n H l Encapsulation H t H n switch router Network Security The field of security is about: how bad guys can attack computer s how we can defend s 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 Internet protocol designers playing catch-up Security considerations in all layers! Introduction 1-87 Introduction 1-88 Bad guys can put malware into hosts via Internet Bad guys can put malware into hosts via Internet alware 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. alware is often self-replicating: from an infected host, seeks entry into other hosts Introduction 1-89 Trojan horse Hidden part of some otherwise useful software Today often on a Web page (Active-X, plugin) Virus infection by receiving object (e.g., attachment), actively executing self-replicating: propagate itself to other hosts, users 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) Introduction 1-90

16 Bad guys can attack servers and 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 (see botnet). send packets toward target from compromised hosts target The bad guys can sniff packets Packet sniffing: broadcast media (shared Ethernet, wireless) promiscuous interface reads/records all packets (e.g., including passwords!) passing by A src:b dest:a C payload Wireshark software used for end-of-chapter labs is a (free) packet-sniffer B Introduction 1-91 Introduction 1-92 The bad guys can use false source addresses IP spoofing: send packet with false source address A src:b dest:a payload C B 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 A C src:b dest:a user: B; password: foo B Introduction 1-9 Introduction 1-94 Network Security more throughout this course chapter 8: focus on security crypographic techniques: obvious uses and not so obvious uses Internet History : 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 program ARPAnet has 15 nodes Introduction 1-95 Introduction 1-96

17 Internet History : Intering, new and proprietary nets Internet History : new protocols, a proliferation of s 1970: ALOHAnet satellite in Hawaii 1974: Cerf and Kahn - architecture for interconnecting s 1976: Ethernet at Xerox PARC ate70 s: proprietary architectures: DECnet, SNA, XNA late 70 s: switching fixed length packets (AT precursor) 1979: ARPAnet has 200 nodes Cerf and Kahn s intering principles: minimalism, autonomy - no internal changes required to interconnect s best effort service model stateless routers decentralized control define today s Internet architecture 198: deployment of TCP/IP 1982: smtp protocol defined 198: DNS defined for name-to-ipaddress translation 1985: ftp protocol defined 1988: TCP congestion control new national s: Csnet, BITnet, NSFnet, initel 0,000 hosts connected to confederation of s Introduction 1-97 Introduction 1-98 Internet History Internet History 1990, 2000 s: commercialization, the Web, new apps Early 1990 s: ARPAnet decommissioned 1991: NSF lifts restrictions on commercial use of NSFnet (decommissioned, 1995) early 1990s: Web hypertext [Bush 1945, Nelson 1960 s] HTL, HTTP: Berners-Lee 1994: osaic, later Netscape late 1990 s: commercialization of the Web Late 1990 s 2000 s: more killer apps: instant messaging, P2P file sharing security to forefront est. 50 million host, 0 million+ users backbone s running at Gbps 2007: ~500 million hosts Voice, Video over IP P2P s: BitTorrent (file sharing) Skype (VoIP), PPLive (video) more s: YouTube, gaming wireless, mobility Introduction 1-99 Introduction 1-0 Introduction: Summary Covered a ton of material! Internet overview what s a protocol? edge, core, access packet-switching versus circuit-switching Internet structure performance: loss, delay, throughput layering, service models security history You now have: context, overview, feel of ing more depth, detail to follow! Introduction 1-1