1. 1 CSSE 460 Computer Networks by Dr. Yingwu Zhu

2. 2 Course Overview

3. 3 Class Materials r Will be posted on my website m Lecture slides m Projects m Additional materials m Others r What counts in this class? m Performance (Pop quizzes, Assignments, Projects, Exams) m Active participation in discussion r 2 sessions per class, 10 minutes break

4. 4 What I Expect You to Do … r Reading is very important m Pre- and post-class reading textbook and supplemental materials m Lectures do not cover full stories r Active participation in class discussion r Accomplish projects

5. 5 Networking is everywhere! r Internet, ad-hoc wireless networks, sensor networks r Networking devices: m Computers, PDAs, i-pods, sensor nodes, others r Networking services m Web, emails, P2P file sharing, VoIP, VOD, multimedia streaming … r Changing our lives in many ways!

6. 6 Expectations This class IS about... Principles and Concepts in Computer Networks General-Purpose Computer Networks Internet Perspective Network Software and Programming Understanding Network Design Principles Application, Transport, Network Layers

7. 7 r This class IS NOT about... m Survey of protocol standards m Special Purpose Networks m OSI - TCP/IP Battle m Network Hardware Components m Queuing Theory m Link and physical layers

8. 8 Project machines r CS1.seattleu.edu r SEATTLE U account and password

9. 9 Introduction 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 history

10. 10 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

11. 11 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

12. 12 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

13. 13 Perspective r Network users: Does the network support the users’ applications m Reliability m Error free service m Speed of data transfer r Network designers: Cost efficient network design m Good utilization of network resources m Cost of building the network m Types of services to be supported

14. 14 Perspective r Network providers: Network administration and customer service m Maximize Revenue m Minimize Operations Expenses m Survivability and Resiliency (Why)

15. 15 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

16. 16 Connectivity r We may want a set of hosts (or devices) to be directly connected!WHY ? r We may not always strive for global connectivity!WHY? r Building Blocks to connect at the physical level: m links: coax cable, optical fiber... m nodes: general-purpose workstations… (though sometimes very specialized)

17. 17 Basic Connectivity r Two types of direct connectivity: m point-to-point m multiple access

18. 18 Discussions r If all computers had to be directly connected, networks would be either very limited or expensive and unmanageable! r Question: If n computers were to be completely and directly connected by point-to-point links of cost C, what would be the total cost of the net? r Question: Would it be less expensive to use a multiple-access network? What are the drawbacks and limitations?

19. 19 Building Blocks r Switches, Routers, Gateways m Special network components responsible for “moving” packets across the network from source to destination. r Network hosts, workstations, etc. m they generally represent the source and sink (destination) of data traffic (packets) r We can recursively build large networks by interconnecting networks via gateways and routers.

20. 20 An Interconnection Network

21. 21 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

22. 22 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

23. 23 Protocols r Building blocks of a network architecture r Each protocol object has two different interfaces m service interface: defines operations on this protocol m peer-to-peer interface: defines messages exchanged with peer r Term “protocol” is overloaded m specification of peer-to-peer interface m module that implements this interface

24. 24 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, Gnutella, Kazza

25. 25 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

26. 26 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

27. 27 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”

28. 28 Different Types of Switching r Different Types of Switching: m Circuit Switching (telephone network) dedicated circuit, sending and receiving bit streams m Message Switching m Packet Switching store and forward, sending and receiving packets m Virtual Circuit Switching m Cell Switching (ATM) r What are Packets? m Data to be transmitted is divided into discrete blocks

29. 29 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

30. 30 Cost-Effective Resource Sharing r Must share (multiplex) network resources among multiple users. r Common Multiplexing Strategies m Time-Division Multiplexing (TDM) m Frequency-Division Multiplexing (FDM): Frequency band  bandwidth r Multiplexing multiple logical flows over a single physical link.

31. 31 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

32. 32 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

33. 33 Network Core: Packet Switching A B C 10 Mbs Ethernet 1.5 Mbs 45 Mbs D E statistical multiplexing queue of packets waiting for output link On-demand sharing

34. 34 Network Core: Packet Switching Packet-switching: store and forward behavior

35. 35 Packet switching versus circuit switching r 1 Mbit link r each user: m 100Kbps when “active” m active 10% of time r circuit-switching: m 10 users r packet switching: m with 35 users, probability > 10 active less than.004 Packet switching allows more users to use network! N users 1 Mbps link

36. 36 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! Is packet switching a “slam dunk winner?”

37. 37 Packet-switched networks: routing r Goal: move packets among routers from source to destination m we’ll study several path selection algorithms 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 m ATM

38. 38 Access networks and physical media Q: How to connect 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?

39. 39 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

40. 40 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, Comcast

41. 41 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

42. 42 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 stations) base station mobile hosts router

43. 43 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 freely, e.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

44. 44 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

45. 45 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

46. 46 Different Types of Links Sometimes you install your own!

47. 47 Bigger Pipes! Sometimes leased from the phone company STS: Synchronous Transport Signal

48. 48 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

49. 49 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!

50. 50 Bandwidth (throughput) r Amount of data that can be transmitted per time unit r Example: 10Mbps r link versus end-to-end r Notation m KB = 2 10 bytes m Mbps = 10 6 bits per second Performance

51. 51 r Bandwidth related to “bit width” Performance a) b) 1 second

52. 52 Latency (delay) r Time it takes to send message from point A to point B r Example: 24 milliseconds (ms) r Sometimes interested in in round-trip time (RTT) r Components of latency Latency = Propagation + Transmit + Queue + Proc. Propagation = Distance / SpeedOfLight Transmit = Size / Bandwidth

53. Transmission and Propagation Delays r Propagation delay m The propagation delay over a link is the time it takes a bit to travel from on end of the link to the other m = d/s r Transmission delay m It is the amount of time it takes to push the packet onto the link m =L/B r Total latency over the link m = transmission delay + propagation delay 53

54. 54 Bandwidth v.s. Latency r Consider a standard 6250 bpi magnetic tape that holds 180 Megabytes. A station wagon can easily transport 200 tapes. Suppose the source and destination are an hour’s drive apart. r Calculate the effective throughput: m 288000 megabits in 3600 seconds m or 80 Mbps r What is the moral of this story ?

55. 55 Bandwidth v.s. Latency r Never underestimate the bandwidth of a station wagon full of tapes pacing down the highway. r But … What happens to the latency?

56. 56 The “hard” limit r Speed of light m 3.0 x 10 8 meters/second in a vacuum m 2.3 x 10 8 meters/second in a cable m 2.0 x 10 8 meters/second in a fiber r Notes m no queuing delays in direct link m bandwidth not relevant if Size = 1 bit m process-to-process latency includes software overhead m software overhead can dominate when Distance is small

57. 57 r Relative importance of bandwidth and latency m small message (e.g., 1 byte): 1ms vs. 100ms dominates 1Mbps vs. 100Mbps m large message (e.g., 25 MB): 1Mbps vs. 100Mbps dominates 1ms vs. 100ms r Consider two channels of 1Mbps and 100 Mbps respectively. For a 1 byte message, the available bandwidth is relatively insignificant given a RTT of 1 ms. The transmit delay for each channel is 8  s and 0.08  s, respectively.

58. 58  Delay x Bandwidth Product e.g., 100ms RTT and 45Mbps Bandwidth = 560KB of data r We have to view the network as a buffer. This may have interesting consequences: m How much data did the sender transmit before a response can be received? Bandwidth Delay

59. 59 r Application Needs m bandwidth requirements: burst versus peak rate m jitter: variance in latency (inter-packet gap) r Average Bandwidth Requirement is Not enough: m consider a source with an avg. BW-requirement of 2Mbps. If the application generates 1 Mbit in one second interval and 3Mbit in a second, a channel that can support 2 Mbps max. will have a tough time. r Other Quality of Service (QOS) Parameters: m max. and min. delay m max. and min. bandwidth demand m rates for dynamic increase of demands m Cell-Loss Rate

60. 60 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!

61. 61 What Goes Wrong in the Network? r Different types of Error: m Bit-level errors (electrical interference) 1 in 10 6 -10 7 in copper - 1 in 10 12 - 10 14 in fiber m Packet-level errors (congestion) m Link and node failures r How should we deal with these types of error? r What are the consequences of errors?

62. 62 Other types of problems in the Network? r Messages are delayed r Messages are deliver out-of-order r Third parties eavesdrop The key problem is to fill in the gap between what applications expect and what the underlying technology provides.