1 / 56

Understanding Network Switching Methods: Circuit Switching and Packet Switching

This article provides an overview of the two major network switching methods, circuit switching and packet switching. It explains how data is transferred through the network using each method, the advantages and disadvantages of each, and their applications in different network environments.

pisano
Télécharger la présentation

Understanding Network Switching Methods: Circuit Switching and Packet Switching

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 1.1 what is the Internet? 1.2 network edge end systems, access networks, links 1.3 network core packet switching, circuit switching, network structure 1.4 delay, loss, throughput in networks 1.5 protocol layers, service models 1.6 networks under attack: security 1.7 history Chapter 1: roadmap Introduction

  2. mesh of interconnected routers 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” The network core Introduction

  3. Circuit switching end-end resources allocated to (reserved for) “call” between source & dest: In diagram, each link has four circuits. call gets 2nd circuit in top link and 1st circuit in right link. call setup required dedicated resources: no sharing guaranteed performance circuit segment idle if not used by call (no sharing) Commonly used in traditional telephone networks Introduction

  4. Circuit switching: FDM versus TDM Example: 4 users FDM (frequency division multiplexing) frequency time TDM (time division multiplexing) frequency time network resources (e.g., bandwidth) divided into “pieces” Introduction

  5. Circuit switching: FDM versus TDM 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? • Assumption • All links’ bandwidth are 1.536 Mbps • Each link uses TDM with 24 slots/sec • 500 msec to establish end-to-end circuit • No delay in switching • No propagation delay • Answer • 1.536Mbps = 1536000 bits per second • Link transmission rate = 1536000/24 = 64000 bps • Total time = 640000/64000 + 0.5 = 10.5 seconds Introduction

  6. packet-switching: hosts break application-layer messages into packets forward packetsfrom one router to the next, across links on path from source to destination each packet transmitted at full link capacity Bandwidth Sharing user A, B packets share network resources resources used as needed Packet-switching: packets Introduction

  7. 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 L bits per packet 1 3 2 source destination R bps R bps • A packet’s end-to-end delay in the figure= 2L/R (assuming zero propagation delay) Introduction

  8. Packet-switching: Statistical Multiplexing D E 100 Mb/s Ethernet C A statistical multiplexing 1.5 Mb/s B queue of packets waiting for output link Sequence of A & B packets does not have fixed pattern, bandwidth shared on demand statistical multiplexing= dynamic bandwidth allocation (채널 상에 전송이 요구되는 패킷의 개수에 따라 통계적으로 가변되는 다중화 방식) Introduction

  9. Packet Switching: queueing delay, loss C R = 100 Mb/s A D R = 1.5 Mb/s B E queue of packets waiting for output link queuing and loss: • If arrival rate (in bits) to link exceeds transmission rate of link for a period of time: • packets will queue, wait to be transmitted on link • packets can be dropped (lost) if memory (buffer) fills up Introduction

  10. Two key network-core functions routing:determines source-destination route taken by packets • routing algorithms forwarding:move packets from router’s input to appropriate router output routing algorithm local forwarding table header value output link 0100 0101 0111 1001 3 2 2 1 1 0111 2 3 dest address in arriving packet’s header Introduction

  11. Packet switching vs. 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! Q: how did we get value 0.0004? Q: what happens if > 35 users ? N users ….. 1 Mbps link * Check out the online interactive exercises for more examples Introduction

  12. Packet switching vs. circuit switching Packet switching allows more users to use network! • packet switching: • When there are 10 or fewer active simultaneous users, users’ packets flow without any delay • But, when there are more than 10 active users, the output queue will begin to grow. • That is, some delay will happen. • Sometimes, packet drops (loss) may happen N users ….. 1 Mbps link Introduction

  13. great for bursty data resource sharing simpler, no call setup excessive congestion possible: 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) is packet switching a “slam dunk winner?” Packet switching vs. circuit switching Q: human analogies of reserved resources (circuit switching) versus on-demand allocation (packet-switching)? Introduction

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

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

  16. Internet structure: network of networks Option: connect each access ISP to every other access ISP? … … … … connecting each access ISP to each other directly doesn’t scale. … … … … 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 … … …

  17. Internet structure: network of networks Option: connect each access ISP to a global transit ISP? Customer and provider ISPs have economic agreement. … … … … globalISP 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 … …

  18. Internet structure: network of networks But if global ISP is viable business, there will be competitors …. … … ISP B ISP A ISP C … … 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 … …

  19. Internet structure: network of networks But if global ISP is viable business, there will be competitors …. which must be interconnected Internet exchange point … … ISP B ISP C ISP A IXP IXP … … 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 peering link … …

  20. Internet structure: network of networks … and regional networks may arise to connect access nets to ISPs … … ISP B ISP C ISP A IXP IXP … … 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 Regional ISP … … - Global ISP (Tier-1 ISP) provides internet access in cities and towns nationwide and have a much larger technical support team. - Regional ISP (Tier-2 ISP) provides internet access to a specific area and usually has a smaller technical support team than Global ISP.

  21. Internet structure: network of networks … 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 B ISP A IXP IXP … … Content provider network 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 Regional ISP … …

  22. Internet structure: network of networks at core: small # of well-connected large networks “tier-1” commercial ISPs(e.g., Sprint, AT&T, NTT, KT, SKT…), national & international coverage - It is also called “Internet backbone” content provider network (e.g., Google): private network that connects it data centers to Internet, sometimes bypassing tier-1 or regional ISPs Tier 1 ISP Tier 1 ISP Google IXP IXP IXP Regional ISP Regional ISP access ISP access ISP access ISP access ISP access ISP access ISP access ISP access ISP Introduction

  23. Chapter 1: roadmap 1.1 what is the Internet? 1.2 network edge end systems, access networks, links 1.3 network core packet switching, circuit switching, network structure 1.4 delay, loss, throughput in networks 1.5 protocol layers, service models 1.6 networks under attack: security 1.7 history Introduction

  24. How do loss and delay occur? packets queue in router buffers “Packet Loss” happens when packet arrival rate to link exceeds output link queue capacity packet being transmitted (delay) packets queueing(delay) - free (available) buffers: arriving packets - packet dropped (loss) if no free buffers A B Introduction

  25. Four sources of packet delay dproc: processing delay check bit errors determine output link typically < msec transmission A propagation B processing queueing dnodal = dproc + dqueue + dtrans + dprop dqueue: queueing delay • time waiting at output link for transmission • depends on congestion level of router Introduction

  26. dtrans and dprop very different Four sources of packet delay transmission A propagation B processing queueing dnodal = dproc + dqueue + dtrans + dprop dprop: propagation delay: • d: length of physical link • s: propagation speed in medium (~2x108 m/sec) • dprop = d/s dtrans: transmission delay: • L: packet length (bits) • R: link bandwidth (bps) • dtrans= L/R * Check out the Java applet for an interactive animation on trans vs. prop delay Introduction

  27. Caravan analogy car ~ bit & caravan ~ packet cars “propagate” at 100 km/hr toll booth takes 12 sec to service a car (bit processing & transmission time) Q: Currently, the caravan is lined up before 1st tool booth. How long until caravan is lined up before 2nd toll booth? time to “push” entire caravan through toll booth onto highway (Processing & Transmission Delay)= 12*10 = 120 sec = 2min time for last car to propagate from 1st to 2nd toll both: 100km/(100km/hr)= 1 hr A: 62 minutes 100 km 100 km 10 cars in a caravan toll booth toll booth Caravan: 대열 Introduction See the applet: http://wps.aw.com/aw_kurose_network_5/111/28536/7305312.cw/index.html

  28. Caravan analogy (more) suppose cars now “propagate” at 1000 km/hr and suppose toll booth now takes 1 min to service (process & transmit) a car Q: Will cars arrive to 2nd booth before all cars serviced at 1st booth? Q: What if cars now propagate at 2x108 m/s? A: Yes! after 7 min, 1st car arrives at 2nd booth; three cars still at 1st booth. 100 km 100 km ten-car caravan toll booth toll booth Introduction

  29. R: link bandwidth (bps) L: packet length (bits) a: average packet arrival rate Queueing delay (revisited) average queueing delay traffic intensity = La/R traffic intensity = La/R (must be less than 1) • 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! La/R ~ 0 La/R -> 1 * Check out the Java applet for an interactive animation on queuing and loss Introduction

  30. “Real” Internet delays and routes what do “real” Internet delay & loss look like? traceroute program: provides delay measurement from source to each router along end-to-end Internet path towards destination. - For each router 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. Windows System: tracert 3 probes 3 probes 3 probes Introduction

  31. “Real” Internet delays, routes traceroute: gaia.cs.umass.edu to www.eurecom.fr 3 delay measurements from gaia.cs.umass.edu to cs-gw.cs.umass.edu 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 136ms trans-oceanic link 시간이 오히려 줄었네… why? * means no response (probe lost or router not replying) * Do some traceroutes from exotic countries at www.traceroute.org Introduction

  32. Packet loss queue (aka buffer) preceding link 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 buffer (waiting area) packet being transmitted A B packet arriving to full buffer is lost * Check out the Java applet for an interactive animation on queuing and loss Introduction

  33. Throughput(처리율) Throughput: rate (bits/time unit) at which bits transferred between sender/receiver Instantaneous throughput: rate at given point in time Average throughput: rate over longer period of time pipe that can carry fluid at rate Rsbits/sec) pipe that can carry fluid at rate Rcbits/sec) server sends bits (fluid) into pipe link capacity Rsbits/sec server, with file of F bits to send to client link capacity Rcbits/sec Introduction

  34. Throughput (more) Rs < RcWhat is average end-end throughput? Rsbits/sec Rcbits/sec Rcbits/sec bottleneck link link on end-to-end path that constrains end-to-end throughput Rsbits/sec • Rs > RcWhat is average end-end throughput? Introduction

  35. Throughput: Internet scenario per-connection end-to-end throughput: min(Rc,Rs,R/10) in practice: A link in the core network has very high transmission rate So, Rc or Rs is often bottleneck Rs Rs Rs R Rc Rc Rc 10 connections (fairly) share backbone (bottleneck) link Rbits/sec Introduction

  36. Chapter 1: roadmap 1.1 what is the Internet? 1.2 network edge end systems, access networks, links 1.3 network core packet switching, circuit switching, network structure 1.4 delay, loss, throughput in networks 1.5 protocol layers, service models 1.6 networks under attack: security 1.7 history Introduction

  37. Protocol “layers” Networks are complex, with 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

  38. Organization of air travel a series of steps ticket (complain) baggage (claim) gates (unload) runway landing airplane routing ticket (purchase) baggage (check) gates (load) runway takeoff airplane routing airplane routing Introduction

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

  40. 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 Introduction

  41. Internet protocol stack application: supporting network applications FTP, SMTP, HTTP transport: process-process data transfer TCP, UDP network: routing of datagrams from source to destination IP, routing protocols link: data transfer between neighboring network elements Ethernet, 802.111 (WiFi), PPP physical: bits “on the wire” application transport network link physical Introduction

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

  43. Encapsulation network link physical link physical M M M Ht M Hn Hn Hn Hn Ht Ht Ht Ht M M M M Ht Hn Ht Hl Hl Hl Hn Hn Hn Ht Ht Ht M M M source message application transport network link physical segment datagram frame switch destination application transport network link physical router Introduction

  44. Chapter 1: roadmap 1.1 what is the Internet? 1.2 network edge end systems, access networks, links 1.3 network core packet switching, circuit switching, network structure 1.4 delay, loss, throughput in networks 1.5 protocol layers, service models 1.6 networks under attack: security 1.7 history Introduction

  45. Network security field of network security: how bad guys can attack computer networks how we can defend networks 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 network” Internet protocol designers playing “catch-up” security considerations in all layers! Introduction

  46. Bad guys: put malware into hosts via Internet malware can get in host from: Virus: self-replicating infection by receiving/executing object (e.g., e-mail attachment) Worm: self-replicating infection by passively receiving object that gets itself executed Trojan horse: Hidden part of some otherwise useful software - Today often on a Web page (Active-X, plugin) spyware malware can record keystrokes, web sites visited, upload info to collection site infected host can be enrolled in botnet, used for spam. DDoS (Distributed DoS) attacks Introduction

  47. Distributed Denial of Service (DDoS): attackers make resources (server, bandwidth) unavailable to legitimate traffic by overwhelming resource with bogus traffic target Bad guys: attack server, network infrastructure 1. select target 2. break into hosts around the network (see botnet) 3. send packets to target from compromised hosts Introduction

  48. Bad guys can sniff packets packet “sniffing”: broadcast media (shared ethernet, wireless) promiscuous network interface reads/records all packets (e.g., including passwords!) passing by src:B dest:A payload C A B • wireshark software used for end-of-chapter labs is a (free) packet-sniffer Introduction

  49. Bad guys can use fake addresses IP spoofing:send packet with false source address src:B dest:A payload C A B … lots more on security (throughout, Chapter 8) Introduction

  50. Chapter 1: roadmap 1.1 what is the Internet? 1.2 network edge end systems, access networks, links 1.3 network core packet switching, circuit switching, network structure 1.4 delay, loss, throughput in networks 1.5 protocol layers, service models 1.6 networks under attack: security 1.7 history Introduction

More Related