3rd edition chapter 1 - new york university第三版1章-纽约大学

Introduction,1-1,Data Communication and Networks,Lecture 1Introduction and Overview September 9, 2004Joseph ConronComputer Science DepartmentNew York U,Introduction,1-2,Chapter 1: Introduction,Our goal: get “feel” and terminologymore depth, detail later in courseapproach:use Internet as example,Overview:whats the Internetwhats a protocol?network edgenetwork coreInternet/ISP structureperformance: loss, delayprotocol layers, service modelsnetwork modeling,Introduction,1-3,Chapter 1: roadmap,1.1 What is the Internet?1.2 Network edge1.3 Network core1.4 Internet structure and ISPs1.5 Delay & loss in packet-switched networks1.6 Protocol layers, service models1.7 History,Introduction,1-4,Whats the Internet: “nuts and bolts” view,millions of connected computing devices: hosts = end systems running network appscommunication linksfiber, copper, radio, satellitetransmission rate = bandwidthrouters: forward packets (chunks of data),Introduction,1-5,Whats the Internet: “nuts and bolts” view,protocols control sending, receiving of msgse.g., TCP, IP, HTTP, FTP, PPPInternet: “network of networks”loosely hierarchicalpublic Internet versus private intranetInternet standardsRFC: Request for commentsIETF: Internet Engineering Task Force,local ISP,companynetwork,regional ISP,router,workstation,server,mobile,Introduction,1-6,Whats the Internet: a service view,communication infrastructure enables distributed applications:Web, email, games, e-commerce, file sharingcommunication services provided to apps:Connectionless unreliableconnection-oriented reliable,Introduction,1-7,Whats a protocol?,human protocols:“whats the time?”“I have a question”introductions specific msgs sent specific actions taken when msgs received, or other events,network protocols:machines rather than humansall 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,Introduction,1-8,Whats a protocol?,a human protocol and a computer network protocol:,Q: Other human protocols?,Hi,Hi,TCP connection req,Introduction,1-9,Protocol Specification,As designers, we can specify a protocol usingSpace-Time DiagramsTransition DiagramsWe can implement a protocol with a Finite State Machine (FSM)Internet Protocols are formalized by RFCs which are administered by IETF,2/4/2018,Introduction,1-10,Space-Time Diagrams,Defines causal ordering Defines indication/request/response actions,Introduction,1-11,Transition Diagram,IllustratesStatesInput (the event that causes transition)Transitions (to new states),Introduction,1-12,Chapter 1: roadmap,1.1 What is the Internet?1.2 Network edge1.3 Network core1.4 Internet structure and ISPs 1.6 Delay & loss in packet-switched networks1.6 Protocol layers, service models1.7 History,Introduction,1-13,A closer look at network structure:,network edge: applications and hostsnetwork core: routersnetwork of networksaccess networks, physical media: communication links,Introduction,1-14,The network edge:,end systems (hosts):run application programse.g. Web, emailat “edge of network”client/server modelclient host requests, receives service from always-on servere.g. Web browser/server; email client/serverpeer-peer model: minimal (or no) use of dedicated serverse.g. Gnutella, KaZaA,Introduction,1-15,Network edge: connection-oriented service,Goal: data transfer between end systemshandshaking: setup (prepare for) data transfer ahead of timeHello, hello back human protocolset up “state” in two communicating hostsTCP - Transmission Control Protocol Internets connection-oriented service,TCP service RFC 793reliable, in-order byte-stream data transferloss: acknowledgements and retransmissionsflow control: sender wont overwhelm receivercongestion control: senders “slow down sending rate” when network congested,Introduction,1-16,Network edge: connectionless service,Goal: data transfer between end systemssame as before!UDP - User Datagram Protocol RFC 768: connectionless unreliable data transferno flow controlno congestion control,Apps using TCP: HTTP (Web), FTP (file transfer), Telnet (remote login), SMTP (email)Apps using UDP:streaming media, teleconferencing, DNS, Internet telephony,Introduction,1-17,Chapter 1: roadmap,1.1 What is the Internet?1.2 Network edge1.3 Network core1.4 Internet structure and ISPs 1.5 Delay & loss in packet-switched networks1.6 Protocol layers, service models1.7 History,Introduction,1-18,The Network Core,mesh of interconnected routersthe fundamental question: how is data transferred through net?circuit switching: dedicated circuit per call: telephone netpacket-switching: data sent thru net in discrete “chunks”,Introduction,1-19,Network Core: Circuit Switching,End-end resources reserved for “call”link bandwidth, switch capacitydedicated resources: no sharingcircuit-like (guaranteed) performancecall setup required,Introduction,1-20,Network Core: Circuit Switching,network resources (e.g., bandwidth) divided into “pieces”pieces allocated to callsresource piece idle if not used by owning call (no sharing),dividing link bandwidth into “pieces”frequency divisiontime division,Introduction,1-21,Circuit Switching: FDM and TDM,Introduction,1-22,Numerical example,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 MbpsEach link uses TDM with 24 slots500 msec to establish end-to-end circuitWork it out!,Introduction,1-23,Network Core: Packet Switching,each end-end data stream divided into packetsuser A, B packets share network resources each packet uses full link bandwidth resources used as needed,resource contention: aggregate resource demand can exceed amount availablecongestion: packets queue, wait for link usestore and forward: packets move one hop at a timeNode receives complete packet before forwarding,Introduction,1-24,Packet Switching: Statistical Multiplexing,Sequence of A & B packets does not have fixed pattern statistical multiplexing.In TDM each host gets same slot in revolving TDM frame.,A,B,C,10 Mb/sEthernet,1.5 Mb/s,statistical multiplexing,queue of packetswaiting for outputlink,Introduction,1-25,Packet switching versus circuit switching,1 Mb/s linkeach user: 100 kb/s when “active”active 10% of timecircuit-switching: 10 userspacket switching: with 35 users, probability 10 active less than .0004,Packet switching allows more users to use network!,N users,1 Mbps link,Introduction,1-26,Packet switching versus circuit switching,Great for bursty dataresource sharingsimpler, no call setupExcessive congestion: packet delay and lossprotocols needed for reliable data transfer, congestion controlQ: How to provide circuit-like behavior?bandwidth guarantees needed for audio/video appsstill an unsolved problem (chapter 6),Is packet switching a “slam dunk winner?”,Introduction,1-27,Packet-switching: store-and-forward,Takes L/R seconds to transmit (push out) packet of L bits on to link or R bpsEntire packet must arrive at router before it can be transmitted on next link: store and forwarddelay = 3L/R,Example:L = 7.5 MbitsR = 1.5 Mbpsdelay = 15 sec,R,R,R,L,Introduction,1-28,Packet-switched networks: forwarding,Goal: move packets through routers from source to destinationwell study several path selection (i.e. routing) algorithms (chapter 4)datagram network: destination address in packet determines next hoproutes may change during sessionanalogy: driving, asking directions virtual circuit network: each packet carries tag (virtual circuit ID), tag determines next hopfixed path determined at call setup time, remains fixed thru callrouters maintain per-call state,Introduction,1-29,Network Taxonomy,Telecommunicationnetworks,Datagram network is not either connection-oriented or connectionless. Internet provides both connection-oriented (TCP) and connectionless services (UDP) to apps.,Introduction,1-30,Chapter 1: roadmap,1.1 What is the Internet?1.2 Network edge1.3 Network core1.4 Internet structure and ISPs1.5 De