Lect-2: BasicsComputer Networks : An Introduction to Computer Networks Handout #2: Foundations and Basic Concepts Additional Reading Text book: Chaps. 1.2,3.1 Homepage

Lect-2: BasicsComputer Networks2 Outline  A Detailed FTP Example  Layering  Packet Switching and Circuit Switching  Some terms  Data rate, “Bandwidth” and “throughput”  Propagation delay  Packet, header, address  Bandwidth-delay product, RTT

Lect-2: BasicsComputer Networks3 Example: FTP over the Internet Using TCP/IP and Ethernet App OS R2 R3 R4 R1 R5 Ethernet “A” (BGU) “B” (TECH) Ethernet App OS

Lect-2: BasicsComputer Networks4 In the sending host 1. Application-Programming Interface (API)  Application requests TCP connection with “B” 2. Transmission Control Protocol (TCP)  Creates TCP “Connection setup” packet  TCP requests IP packet to be sent to “B” TCP Data TCP Header TCP Packet Type = Connection Setup Empty

Lect-2: BasicsComputer Networks5 In the sending host (cont.) 3. Internet Protocol (IP)  Creates IP packet with correct addresses.  IP requests packet to be sent to router. IP Data TCP Packet Encapsulation IP Header IP Packet Destination Address: IP “B” Source Address: IP “A” Protocol = TCP TCP Data TCP Header

Lect-2: BasicsComputer Networks6 In the sending host (cont.) 4. Link (“MAC” or Ethernet) Protocol  Creates MAC frame with Frame Check Sequence (FCS).  Wait for Access to the line.  MAC requests PHY to send each bit of the frame. Ethernet Data IP Packet Ethernet FCS Ethernet Header Ethernet Packet Destination Address: MAC “R1” Source Address: MAC “A” Protocol = IP IP Data IP Header Encapsulation

Lect-2: BasicsComputer Networks7 In Router R1 5. Link (“MAC” or Ethernet) Protocol  Accept MAC frame, check address and Frame Check Sequence (FCS).  Pass data to IP Protocol. Ethernet Data IP Packet Ethernet FCS Ethernet Header Ethernet Packet Destination Address: MAC “R1” Source Address: MAC “A” Protocol = IP IP Data IP Header De-capsulation

Lect-2: BasicsComputer Networks8 In Router R1 6. Internet Protocol (IP)  Use IP destination address to decide where to send packet next (“next-hop routing”).  Request Link Protocol to transmit packet. IP Data IP Header IP Packet Destination Address: IP “B” Source Address: IP “A” Protocol = TCP

Lect-2: BasicsComputer Networks9 In Router R1 7. Link (“MAC” or Ethernet) Protocol  Creates MAC frame with Frame Check Sequence (FCS).  Wait for Access to the line.  MAC requests PHY to send each bit of the frame. Ethernet Data IP Packet Ethernet FCS Ethernet Header Ethernet Packet Destination Address: MAC “R2” Source Address: MAC “R1” Protocol = IP IP Data IP Header Encapsulation

Lect-2: BasicsComputer Networks10 In Routers R2, R3, R5 Same operations as Router R1 16. Link (“MAC” or Ethernet) Protocol  Creates MAC frame with Frame Check Sequence (FCS).  Wait for Access to the line.  MAC requests PHY to send each bit of the frame. Ethernet Data IP Packet Ethernet FCS Ethernet Header Ethernet Packet Destination Address: MAC “B” Source Address: MAC “R5” Protocol = IP IP Data IP Header Encapsulation

Lect-2: BasicsComputer Networks11 In the receiving host 17. Link (“MAC” or Ethernet) Protocol  Accept MAC frame, check address and Frame Check Sequence (FCS).  Pass data to IP Protocol. Ethernet Data IP Packet Ethernet FCS Ethernet Header Ethernet Packet Destination Address: MAC “B” Source Address: MAC “R5” Protocol = IP IP Data IP Header De-capsulation

Lect-2: BasicsComputer Networks12 In the receiving host (2) 18. Internet Protocol (IP)  Verify IP address.  Extract/de-capsulate TCP packet from IP packet.  Pass TCP packet to TCP Protocol. IP Data TCP Packet De-capsulation IP Header IP Packet Destination Address: IP “B” Source Address: IP “A” Protocol = TCP TCP Data TCP Header

Lect-2: BasicsComputer Networks13 In the receiving host (3) 19. Transmission Control Protocol (TCP)  Accepts TCP “Connection setup” packet  Establishes connection by sending “Ack”. 20. Application-Programming Interface (API)  Application receives request for TCP connection with “A”. TCP Data TCP Header TCP Packet Type = Connection Setup Empty

Lect-2: BasicsComputer Networks14 Outline  A Detailed FTP Example  Layering  Packet Switching and Circuit Switching  Some terms  Data rate, “Bandwidth” and “throughput”  Propagation delay  Packet, header, address  Bandwidth-delay product, RTT

Lect-2: BasicsComputer Networks15 Layering: The OSI Model Session Network Link Physical Application Presentation Transport Network Link Network Transport Session Presentation Application Network Link Physical Peer-layer communication layer-to-layer communication Router

Lect-2: BasicsComputer Networks16 Layering: Our FTP Example Network Link Transport Application Presentation Session Transport Network Link Physical The 7-layer OSI Model The 4-layer Internet model Application FTP ASCII/Binary IP TCP Ethernet

Lect-2: BasicsComputer Networks17 Outline  A Detailed FTP Example  Layering  Packet Switching and Circuit Switching  Some terms  Data rate, “Bandwidth” and “throughput”  Propagation delay  Packet, header, address  Bandwidth-delay product, RTT

Lect-2: BasicsComputer Networks18 Circuit Switching AB SourceDestination  It’s the method used by the telephone network.  A call has three phases: 1.Establish circuit from end-to-end (“dialing”), 2.Communicate, 3.Close circuit (“tear down”).  Originally, a circuit was an end-to-end physical wire.  Nowadays, a circuit is like a virtual private wire: each call has its own private, guaranteed data rate from end-to-end.

Lect-2: BasicsComputer Networks19 Circuit Switching Telephone Network Source “Caller” Central Office “C.O.” Destination “Callee” Central Office “C.O.” Trunk Exchange Each phone call is allocated 64kb/s. So, a 2.5Gb/s trunk line can carry about 39,000 calls.

Lect-2: BasicsComputer Networks20 Packet Switching A R1 R2 R4 R3 B SourceDestination  It’s the method used by the Internet.  Each packet is individually routed packet-by-packet, using the router’s local routing table.  The routers maintain no per-flow state.  Different packets may take different paths.  Several packets may arrive for the same output link at the same time, therefore a packet switch has buffers.

Lect-2: BasicsComputer Networks21 Packet Switching Simple router model R1 Link 1 Link 2 Link 3 Link 4 Link 1, ingressLink 1, egress Link 2, ingressLink 2, egress Link 3, ingressLink 3, egress Link 4, ingressLink 4, egress

Lect-2: BasicsComputer Networks22 Link rate, R X(t) Dropped packets B Queue Length X(t) Time Packet buffer Packets for one output Packet Switching Statistical Multiplexing DataHdr DataHdr DataHdr R R R  Because the buffer absorbs temporary bursts, the egress link need not operate at rate N.R.  But the buffer has finite size, B, so losses will occur. 1 2 N

Lect-2: BasicsComputer Networks23 Virtual Circuit Switching AB SourceDestination  A widely used method for packet switching.  Differs from datagram switching: 1.Connection oriented delivery of packets 2.A virtual connection is setup from source to destination 3.All packets follow the same circuit 4.A circuit link can be shared by several virtual circuits  Each Virtual Circuit (VC) has an Identifier (VCI)  A session gets a VCI and its packets are routed based on VCI  There are two types: Permanent VC (PVC), Switched VC (SVC)

Lect-2: BasicsComputer Networks24 Statistical Multiplexing B A time rate x x A x B x

Lect-2: BasicsComputer Networks25 Statistical Multiplexing Gain A B C 2x C < 2x A+B time rate Statistical multiplexing gain = 2x/C Note: the gain could be defined for a particular loss probability (in this case, x and C were chosen so that there were no losses).

Lect-2: BasicsComputer Networks26 Why does the Internet use packet switching? 1. Efficient use of expensive links:  The links are assumed to be expensive and scarce.  Packet switching allows many, bursty flows to share the same link efficiently.  “Circuit switching is rarely used for data networks,... because of very inefficient use of the links” - Gallager 2. Resilience to failure of links & routers:  ”For high reliability,... [the Internet] was to be a datagram subnet, so if some lines and [routers] were destroyed, messages could be... rerouted” - Tanenbaum Source: Networking 101

Lect-2: BasicsComputer Networks27 Some Definitions  Packet length, P, is the length of a packet in bits.  Link length, L, is the length of a link in meters.  Data rate, R, is the rate at which bits can be sent, in bits/second, or b/s. 1  Propagation delay, PROP, is the time for one bit to travel along a link of length, L. PROP = L/c.  Transmission time, TRANSP, is the time to transmit a packet of length P. TRANSP = P/R.  Latency is the time from when the first bit begins transmission, until the last bit has been received. On a link: Latency = PROP + TRANSP. 1. Note that a kilobit/second, kb/s, is 1000 bits/second, not 1024 bits/second.

Lect-2: BasicsComputer Networks28 Packet Switching Host A Host B R1 R2 R3 A R1 R2 R4 R3 B TRANSP 1 TRANSP 2 TRANSP 3 TRANSP 4 PROP 1 PROP 2 PROP 3 PROP 4 SourceDestination “Store-and-Forward” at each Router

Lect-2: BasicsComputer Networks29 Packet Switching Why not send the entire message in one packet? Breaking message into packets allows parallel transmission across all links, reducing end to end latency. It also prevents a link from being “hogged” for a long time by one message. Host A Host B R1 R2 R3 M/R Host A Host B R1 R2 R3 M/R

Lect-2: BasicsComputer Networks30 Packet Switching Queueing Delay Host A Host B R1 R2 R3 TRANSP 1 TRANSP 2 TRANSP 3 TRANSP 4 PROP 1 PROP 2 PROP 3 PROP 4 Q2Q2 Because the egress link is not necessarily free when a packet arrives, it may be queued in a buffer. If the network is busy, packets might have to wait a long time.

Lect-2: BasicsComputer Networks31 Packet Switching  It’s often useful to model a router as a queue per output link A A R A B CB C B C

Lect-2: BasicsComputer Networks32 Packet Switching Little’s Result

Lect-2: BasicsComputer Networks33 Packet Switching A useful, simple fluid model A(t) D(t) Cumulative number of departed bits up until time t. time Service process Cumulative number of bits Cumulative number of bits that arrived up until time t. R A(t) D(t) X(t) Properties of A(t), D(t):  A(t), D(t) are non-decreasing  A(t) >= D(t)

Lect-2: BasicsComputer Networks34 D(t) A(t) time Q(t) d(t) Queue occupancy: Q(t) = A(t) - D(t). Queueing delay, d(t), is the time spent in the queue by a bit that arrived at time t, and if the queue is served first-come-first-served (FCFS or FIFO) Fluid Model Cumulative number of bits

Lect-2: BasicsComputer Networks35 D(t) A(t) time Q(t) d(t) Fluid Model Example Cumulative number of bits Example: Every second, a train of 100 bits arrive at rate 1000b/s. The maximum departure rate is 500b/s. What is the average queue occupancy?