Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching, packet switching, network structure 1.4 Delay, loss and throughput in packet-switched networks 1.5 Protocol layers, service models 1.6 Networks under attack: security 1.7 History

Introduction 1-2 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 Alternative core: circuit switching end-end resources allocated to, reserved for “call” between source & dest:  In diagram, each link has four circuits.  call gets 2 nd circuit in top link and 1 st circuit in right link.  dedicated resources: no sharing  circuit-like (guaranteed) performance  circuit segment idle if not used by call (no sharing)  Commonly used in traditional telephone networks 1-3

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

Introduction 1-5 Circuit Switching: FDM and TDM FDM frequency time TDM (GSM uses this) frequency time 4 users Example: TDMA: Time Division Multiplexing Access

Introduction 1-6 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 Mbps  Each link uses TDM with 24 slots/sec  500 msec to establish end-to-end circuit Let’s work it out!

Unix Server Used in This Class  A Unix server set up in CS department will be used for some programming projects  Need to use SSH to remote login  Machine name: eustis.eecs.ucf.edu  SSH free software (many many others): Command shell client: PuTTY File transfer: WinSCP (for windows)  Student can login using default password Pyymmdd (birth year, month and day).  For any login problems, please Introduction 1-7

Basic Usage of Unix  You only need to remember a few basic commands for using the Eustis machine for this class  Editor: pico  There are many tutorials online    Command line reference: Introduction 1-8

Introduction 1-9 Network Core: Packet Switching each end-end data stream divided into packets  user A, B packets share network resources  each packet uses full link bandwidth  resources used as needed Bandwidth division into “pieces” Dedicated allocation Resource reservation A B C D

Introduction 1-10 resource contention:  aggregate resource demand can exceed amount available  congestion: packets queue, wait for link use  store and forward: packets move one hop at a time  Node receives complete packet before forwarding Network Core: Packet Switching A B C D

Introduction Packet-switching: store-and-forward  takes L/R seconds to transmit (push out) L-bit packet into link at R bps  store and forward: entire packet must arrive at router before it can be transmitted on next link one-hop numerical example:  L = 7.5 Mbits  R = 1.5 Mbps  one-hop transmission delay = 5 sec more on delay shortly … 1-11 source R bps destination L bits per packet R bps  end-end delay = 2L/R (assuming zero propagation delay)

Introduction 1-12 Packet Switching: Statistical Multiplexing Sequence of A & B packets does not have fixed pattern, shared on demand  statistical multiplexing. A B C 10 Mb/s Ethernet 1.5 Mb/s D E statistical multiplexing queue of packets waiting for output link

Network Layer4-13 Two key network-core functions forwarding : move packets from router’s input to appropriate router output routing: determines source- destination route taken by packets  routing algorithms routing algorithm local forwarding table header value output link dest address in arriving packet’s header

Introduction Packet switching versus circuit switching example:  1 Mb/s link  each user: 100 kb/s when “active” active 10% of time  circuit-switching:  10 users  packet switching:  with 35 users, probability > 10 active at same time is less than.0004 * packet switching allows more users to use network! N users 1 Mbps link Q: how did we get value ? Q: what happens if > 35 users ? … * Check out the online interactive exercises for more examples

Introduction 1-15 Packet switching versus circuit switching  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  QoS – Quality of Service  still an unsolved problem (chapter 7) Is packet switching a “slam dunk winner?”

Internet structure: network of networks  End systems connect to Internet via access ISPs (Internet Service Providers)  Residential, company and university ISPs  Access ISPs in turn must be interconnected.  So that any two hosts can send packets to each other  Resulting network of networks is very complex  Evolution was driven by economics and national policies  Let’s take a stepwise approach to describe current Internet structure

Internet structure: network of networks Question: given millions of access ISPs, how to connect them together? access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net … … … … … …

Internet structure: network of networks Option: connect each access ISP to every other access ISP? access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net … … … … … … … … … … … connecting each access ISP to each other directly doesn’t scale: O(N 2 ) connections.

Internet structure: network of networks access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net … … … … … … Option: connect each access ISP to a global transit ISP? Customer and provider ISPs have economic agreement. global ISP

Internet structure: network of networks access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net … … … … … … But if one global ISP is viable business, there will be competitors …. ISP B ISP A ISP C

Internet structure: network of networks access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net … … … … … … But if one global ISP is viable business, there will be competitors …. which must be interconnected ISP B ISP A ISP C IXP peering link Internet exchange point

Internet structure: network of networks access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net … … … … … … … and regional networks may arise to connect access nets to ISPs ISP B ISP A ISP C IXP regional net

Internet structure: network of networks access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net … … … … … … … and content provider networks (e.g., Google, Microsoft, Akamai ) may run their own network, to bring services, content close to end users ISP B ISP A ISP B IXP regional net Content provider network

Introduction Internet structure: network of networks  at center: small # of well-connected large networks  “tier-1” commercial ISPs (e.g., Level 3, Sprint, AT&T, NTT), national & international coverage  content provider network (e.g, Google): private network that connects its data centers to Internet, often bypassing tier-1, regional ISPs 1-24 access ISP access ISP access ISP access ISP access ISP access ISP access ISP access ISP Regional ISP IXP Tier 1 ISP Google IXP

Introduction Tier-1 ISP: e.g., Sprint … to/from customers peering to/from backbone … … … … POP: point-of-presence 1-25

Introduction 1-26 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching, packet switching, network structure 1.4 Delay, loss and throughput in packet-switched networks 1.5 Protocol layers, service models 1.6 Networks under attack: security 1.7 History

Introduction 1-27 How do loss and delay occur? packets queue in router buffers  packet arrival rate to link exceeds output link capacity  packets queue, wait for turn A B packet being transmitted (delay) packets queueing (delay) free (available) buffers: arriving packets dropped (loss) if no free buffers

Introduction 1-28 Four sources of packet delay  1. nodal processing:  check bit errors  determine output link A B propagation transmission nodal processing queueing  2. queueing  time waiting at output link for transmission  depends on congestion level of router

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

Introduction 1-30 Nodal delay  d proc = processing delay  typically a few microsecs or less  d queue = queuing delay  depends on congestion  d trans = transmission delay  = L/R, significant for low-speed links  d prop = propagation delay  a few microsecs to hundreds of msecs

Introduction  R: link bandwidth (bps)  L: packet length (bits)  a: average packet arrival rate traffic intensity = La/R  La/R ~ 0: avg. queueing delay small  La/R  1: avg. queueing delay large  La/R > 1: more “work” arriving than can be serviced, average delay infinite! average queueing delay La/R ~ 0 Queueing delay (revisited) La/R  * Check out the Java applet for an interactive animation on queuing and loss

Introduction 1-32 “Real” Internet delays and routes  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. 3 probes

Introduction 1-33 “Real” Internet delays and routes 1 cs-gw ( ) 1 ms 1 ms 2 ms 2 border1-rt-fa5-1-0.gw.umass.edu ( ) 1 ms 1 ms 2 ms 3 cht-vbns.gw.umass.edu ( ) 6 ms 5 ms 5 ms 4 jn1-at wor.vbns.net ( ) 16 ms 11 ms 13 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 ( ) 104 ms 109 ms 106 ms 9 de2-1.de1.de.geant.net ( ) 109 ms 102 ms 104 ms 10 de.fr1.fr.geant.net ( ) 113 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 13 nice.cssi.renater.fr ( ) 123 ms 125 ms 124 ms 14 r3t2-nice.cssi.renater.fr ( ) 126 ms 126 ms 124 ms 15 eurecom-valbonne.r3t2.ft.net ( ) 135 ms 128 ms 133 ms ( ) 126 ms 128 ms 126 ms 17 * * * 18 * * * 19 fantasia.eurecom.fr ( ) 132 ms 128 ms 136 ms traceroute: gaia.cs.umass.edu to Three delay measurements from gaia.cs.umass.edu to cs-gw.cs.umass.edu * means no response (probe lost, router not replying) trans-oceanic link Under Windows is “tracert”

Introduction 1-34 Traceroute from My Home Computer (last year)

Traceroute from My Home Computer (another time) Introduction 1-35

Introduction 1-36

Online Traceroute Tools  Because UCF campus network blocks all ICMP packets, you need an outside machine to try it.  Try on  Try from different countries from  Check traceroute virtual path at: and Introduction 1-37

Introduction 1-38 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 (UDP) A B packet being transmitted packet arriving to full buffer is lost buffer (waiting area)

Introduction 1-39 Throughput  throughput: rate (bits/time unit) at which bits transferred between sender/receiver  instantaneous: rate at given point in time  average: rate over long(er) period of time server, with file of F bits to send to client link capacity R s bits/sec link capacity R c bits/sec pipe that can carry fluid at rate R s bits/sec) pipe that can carry fluid at rate R c bits/sec) server sends bits (fluid) into pipe

Introduction 1-40 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 link on end-end path that constrains end-end throughput bottleneck link

Introduction 1-41 Throughput: Internet scenario 10 connections (fairly) share backbone bottleneck link R bits/sec RsRs RsRs RsRs RcRc RcRc RcRc R  per-connection end-end throughput: min(R c,R s,R/10)  in practice: R c or R s is often bottleneck

Introduction 1-42 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching, packet switching, network structure 1.4 Delay, loss and throughput in packet-switched networks 1.5 Protocol layers, service models 1.6 Networks under attack: security 1.7 History

Introduction 1-43 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-44 Organization of air travel  a series of steps ticket (purchase) baggage (check) gates (load) runway takeoff airplane routing ticket (complain) baggage (claim) gates (unload) runway landing airplane routing

Introduction 1-45 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  via its own internal-layer actions  relying on services provided by layer below

Introduction 1-46 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?  Duplicate functions

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

Introduction 1-48 ISO/OSI reference model  presentation: allow applications to interpret meaning of data, e.g., encryption, compression, machine- specific conventions  session: synchronization, checkpointing, recovery of data exchange  Internet stack “missing” these layers!  these services, if needed, must be implemented in application  needed? application presentation session transport network link physical

Introduction 1-49 message segment datagram frame source application transport network link physical HtHt HnHn HlHl M HtHt HnHn M HtHt M M destination application transport network link physical HtHt HnHn HlHl M HtHt HnHn M HtHt M M network link physical link physical HtHt HnHn HlHl M HtHt HnHn M HtHt HnHn HlHl M HtHt HnHn M HtHt HnHn HlHl M HtHt HnHn HlHl M router switch Encapsulation

Introduction 1-50 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching, packet switching, network structure 1.4 Delay, loss and throughput in packet-switched networks 1.5 Protocol layers, service models 1.6 Networks under attack: security 1.7 History

Introduction 1-51 Network Security  attacks on Internet infrastructure:  infecting/attacking hosts: malware, spyware, worms, unauthorized access (data stealing, user accounts)  denial of service: deny access to resources (servers, link bandwidth)  Internet not originally designed with (much) security in mind  original vision: “a group of mutually trusting users attached to a transparent network”  Internet protocol designers playing “catch-up”  Security considerations in all layers!

Introduction 1-52 What can bad guys do: malware?  Spyware:  infection by downloading web page with spyware  records keystrokes, web sites visited, upload info to collection site  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-53 Denial of service attacks  attackers make resources (server, bandwidth) unavailable to legitimate traffic by overwhelming resource with bogus traffic 1. select target 2. break into hosts around the network (see malware) 3. send packets toward target from compromised hosts target

Introduction 1-54 Sniff, modify, delete your packets Packet sniffing:  broadcast media (shared Ethernet, wireless)  promiscuous network interface reads/records all packets (e.g., including passwords!) passing by A B C src:B dest:A payload  Ethereal software used for end-of-chapter labs is a (free) packet-sniffer  more on modification, deletion later

Introduction 1-55 Masquerade as you  IP spoofing: send packet with false source address A B C src:B dest:A payload

Introduction 1-56 Masquerade as you  IP spoofing: send packet with false source address  record-and-playback : sniff sensitive info (e.g., password), and use later  password holder is that user from system point of view A B C src:B dest:A user: B; password: foo

Introduction 1-57 Masquerade as you  IP spoofing: send packet with false source address  record-and-playback : sniff sensitive info (e.g., password), and use later  password holder is that user from system point of view A B later ….. C src:B dest:A user: B; password: foo

Introduction 1-58 Network Security  more throughout this course  chapter 8: focus on security  cryptographic techniques

Introduction 1-59 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching, packet switching, network structure 1.4 Delay, loss and throughput in packet-switched networks 1.5 Protocol layers, service models 1.6 Networks under attack: security 1.7 History

Introduction Internet history  1961: Kleinrock - queueing theory shows effectiveness of packet- switching  1964: Baran - packet- switching in military nets  1967: ARPAnet conceived by Advanced Research Projects Agency  1969: first ARPAnet node operational  1972:  ARPAnet public demo  NCP (Network Control Protocol) first host-host protocol  first program  ARPAnet has 15 nodes : Early packet-switching principles 1-60

Introduction  1970: ALOHAnet satellite network in Hawaii  1974: Cerf and Kahn - architecture for interconnecting networks  1976: Ethernet at Xerox PARC  late70’s: proprietary architectures: DECnet, SNA, XNA  late 70’s: switching fixed length packets (ATM precursor)  1979: ARPAnet has 200 nodes Cerf and Kahn’s internetworking principles:  minimalism, autonomy - no internal changes required to interconnect networks  best effort service model  stateless routers  decentralized control define today’s Internet architecture : Internetworking, new and proprietary nets Internet history 1-61

Introduction  1983: deployment of TCP/IP  1982: smtp 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 : new protocols, a proliferation of networks Internet history 1-62

Introduction  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]  HTML, HTTP: Berners-Lee  1994: Mosaic, later Netscape  late 1990’s: commercialization of the Web late 1990’s – 2000’s:  more killer apps: instant messaging, P2P file sharing  network security to forefront  est. 50 million host, 100 million+ users  backbone links running at Gbps 1990, 2000’s: commercialization, the Web, new apps Internet history 1-63

Introduction 2005-present  ~750 million hosts  Smartphones and tablets  Aggressive deployment of broadband access  Increasing ubiquity of high-speed wireless access  Emergence of online social networks:  Facebook: soon one billion users  Service providers (Google, Microsoft) create their own networks  Bypass Internet, providing “instantaneous” access to search, emai, etc.  E-commerce, universities, enterprises running their services in “cloud” (eg, Amazon EC2) Internet history 1-64

Introduction 1-65 Introduction: Summary Covered a lot of material!  Internet overview  what’s a protocol?  network edge, core, access network  packet-switching versus circuit-switching  Internet structure  performance: loss, delay, throughput  layering, service models  security  history You now have:  context, overview, “feel” of networking  more depth, detail to follow!