TCPIP Lecture 2 - PowerPoint PPT Presentation

1 / 43
About This Presentation
Title:

TCPIP Lecture 2

Description:

Local Area Network (LAN) High speed, data network over small ... Connects 2 networks of same technology extended LAN. Filters/forwards/floods based on MAC ... – PowerPoint PPT presentation

Number of Views:1520
Avg rating:3.0/5.0
Slides: 44
Provided by: kelly113
Category:
Tags: tcpip | lan | lecture

less

Transcript and Presenter's Notes

Title: TCPIP Lecture 2


1
TCP/IPLecture 2
  • cs193i Internet Technologies
  • Summer 2004
  • Stanford University

2
Announcements
  • Lab 1 due Wednesday
  • HW 1 assigned
  • Extra perl session tomorrow
  • Tuesday, June 29, 215-305pm, Skilling 193
  • Broadcast live on E2, Stanford Online
  • Silas Thursday office hours moved to Wednesday
    this week
  • Sweet Hall, 630-830pm

3
Communicating with Anyone
4
Local Area Network (LAN)
  • High speed, data network over small region
  • Few thousand meters
  • Network technologies
  • Ethernet
  • FDDI
  • Token ring
  • Data link layer
  • Packets routed based on physical address (MAC)

LAN 1
LAN 2
5
Local Area Network (LAN)
  • High speed, data network over small region
  • Few thousand meters
  • Network technologies
  • Ethernet
  • FDDI
  • Token ring
  • Data link layer
  • Packets routed based on physical address (MAC)

LAN 1
?
LAN 2
6
Connecting Below Internet Level
  • Hub
  • Center of star topology
  • In Ethernet, multiport repeater or concentrator
  • Bridge
  • Connects 2 networks of same technology extended
    LAN
  • Filters/forwards/floods based on MAC
  • Link layer - frames
  • Switch
  • Connects 2 networks packet-switched network
  • Reduces collisions

Hub
Bridge
Switch
7
Connecting at the Internet Level
  • Router
  • Originally gateway
  • Forwards packets based on network layer info (IP)
  • Separate broadcast domains
  • In each domain, IP packet encapsulated in
    domain-specific packet

Router
8
Internet Society
  • Governing body for Internet since 1992
  • http//www.isoc.org
  • Domain names and addresses assigned
  • Upper level Internet Assigned Numbers Authority
  • Regional
  • Latin America / Caribbean
  • Asia Pacific
  • America
  • Europe

9
How Does Everyone Work Together?
  • Networks
  • MCI Worldcom, Sprint, Earthlink,
  • Exchange points provide connections between
    networks
  • Network Access Points open access policies
  • Network Service Provider
  • Build national or global networks
  • Lease space at NAPs
  • Sell bandwidth to regional NSPs
  • Regional NSP sell bandwidth to ISP
  • Internet Service Provider sells bandwidth to end
    users

10
How Does Everyone Work Together?
11
OSI Reference Model for Network Design
Application (Layer 7) Presentation Session Transpo
rt Network Data Link Physical (Layer 1)
12
OSI vs. TCP/IP Stack
13
Internet Protocol
14
IP Datagram
15
IP Addresses
  • 4 8-bit numbers (Hierarchical)
  • Specifies both network and host
  • Number of bits allocated to specify network
    varies
  • Three classes

18.26.0.1
host
network
32-bits
16
IP Addresses
  • IP (Version 4) Addresses are 32 bits long
  • IP Addresses Assigned Statically or Dynamically
    (DHCP)
  • IPv6 addresses are 128 bits long

17
IP Address Space
  • Originally, 3 Classes
  • A, B, C
  • Problem
  • Classes too rigid (C too small, B too big)
  • Solution
  • Subnetting (e.g. within Stanford)
  • Classless Interdomain Routing (CIDR)

18
Subnetting
  • IP Address plus subnet mask (netmask)
  • IP Addr 171.64.15.82Netmask 0xFFFFFF00
    (111...1100000000)
  • First 24 bits are the Subnet ID (the
    neighborhood)
  • Last 8 bits are Host ID (the street address)
  • Can be written as Prefix Length
  • 171.64.15.0/24 or 171.64.15/24

19
Subnetting at Stanford
20
IP Routing
  • Routers are not omniscient
  • Next-Hop
  • Hop-by-Hop
  • Thus IP makes no guarantees
  • except to try its best (Best Effort)
  • packets may get there out of order, garbled,
    duplicated
  • may not get there at all!
  • Unreliable datagram service

21
IP Routing Hop-by-Hop
How a Router Forwards Datagrams
22
Classless Interdomain Routing (CIDR)
23
Classless Interdomain Routing (CIDR)
24
Classless Interdomain Routing (CIDR)
25
Classless Interdomain Routing (CIDR)
26
Five Minute Break
27
Network Programs
  • host
  • ping
  • traceroute
  • nslookup

28
Summary of IP
  • Connectionless/Datagram
  • Unreliable/Best Effort

29
Transmission Control Protocol
30
Characteristics
  • Connection-Oriented
  • Reliable
  • Byte-Stream
  • Flow Control (aka Congestion Control)

31
Three Phases
  • Establish Connection
  • Data Transfer
  • Terminate Connection

32
Establishing the Connection
33
Data Transfer
34
Data Transfer
35
Maintaining the Connection
36
Terminating the Connection
37
  • Connection-Oriented
  • Reliable
  • Byte-Stream
  • Flow Control (aka Congestion Control)

38
Reliability Flow Control
  • Sequence numbers Acknowledgements (ACKs)
  • Receiver detects Corrupt, Lost, Duplicated,
    Out-of-order
  • Tell sender which packets it has received
    correctly
  • Sender can resend
  • In Flight Window (Window Size)
  • Sender only has N unacknowledged packets in

39
Sending a Message
40
  • Connection-Oriented
  • Reliable
  • Byte-Stream
  • Flow Control (aka Congestion Control)

41
UDP
42
User Datagram Protocol (UDP)
  • Like TCP, in the Transport Layer
  • Characteristics
  • Connectionless, Datagram, Unreliable
  • Adds only application multiplexing/demultiplexing
    and checksumming to IP
  • Good for Streaming Media, Real-time Multiplayer
    Networked Games, VoIP

43
Summary
  • IP is the basis of Internetworking
  • TCP builds on top of IPadds reliable,
    congestion-controlled, connection-oriented
    byte-stream.
  • UDP builds on top of IPallows access to IP
    functionality
Write a Comment
User Comments (0)
About PowerShow.com