Chapter 1 - 7

Semester-End Review

A note on the use of these ppt slides:

We’re making these slides freely available to all (faculty, students, readers). Computer Networking:
They’re in powerpoint form so you can add, modify, and delete slides
(including this one) and slide content to suit your needs. They obviously A Top Down Approach
represent a lot of work on our part. In return for use, we only ask the Featuring the Internet,
following:
 If you use these slides (e.g., in a class) in substantially unaltered form,
that you mention their source (after all, we’d like people to use our book!) 2nd edition.
Jim Kurose, Keith Ross
 If you post any slides in substantially unaltered form on a www site, that
you note that they are adapted from (or perhaps identical to) our slides, and
note our copyright of this material. Addison-Wesley, July
Thanks and enjoy! JFK/KWR 2002.
All material copyright 1996-2002
J.F Kurose and K.W. Ross, All Rights Reserved
Review R-1
Internet protocol stack
 application: supporting network
applications
❍ FTP, SMTP, HTTP
application
 transport: host-host data transfer
❍ TCP, UDP
transport
 network: routing of datagrams from
source to destination network
❍ IP, addressing, routing, forwarding
 link: data transfer between link
neighboring network elements
❍ Error Checking, MAC, Ethernet physical
 physical: bits “on the wire”

Review R-2
Logical communication: Application Layer
User Proc
 Take instructions
from user or server application
application
processes transport
 Form messages network
 Define how application link
processes interact physical Reply
❍ Messages types network
❍ Message formats application Request link
❍ Message ordering transport physical
❍ Application network Server Proc
dependent link
physical
application application
application
 Send messages to the transport transport
other party at the network network
application layer link link
 Wait for returning physical physical
messages
Review R-3
Logical communication: Transport Layer
mesg
 Take messages from application
application layer transport
transport
 Form segments network
 Define how link
transport-layer physical
components interact ack network
❍ Segment formats application link
❍ In case of TCP transport segt physical
• Reliability check
network
link
• Congestion mesg
control physical
application application
transport transport
transport
 Send segments to network network
the other party at link link
the transport layer physical physical
 Wait for
acknowledgement
Review R-4
Logical communication: Network Layer
 Take segments from segt
application
transport layer transport
 Form datagrams network
network
link
 Define how network- physical dgrm
layer components network
network
interact application link
❍ Datagram formats transport physical dgrm
❍ Routing network
link
❍ Forwarding
physical
application application
segt
 Send datagram to transport transport
network network
network
the other party at link link
the network layer physical physical
 …

Review R-5
Logical communication: Link Layer
 Take datagrams
application
from network layer
dgrm
transport
 Form frames
network
 Define how link-layer link
components interact physical dgrm dgrm
❍ Frame formats frame network
❍ Error detection application link
link
link
and/or correction transport physical
❍ Multi-Access network frame
Control link
❍ Link-layer physical
technology application application
dependent transport transport
dgrm
network network
 Send frame to the link link
link
physical physical
other party(ies) at
the link layer
 … might wait for
Review R-6
returning frames
Physical communication
data
application
transport
network
link
physical
network
application link
transport physical
network
link
physical data
application application
transport transport
network network
link link
physical physical

Review R-7
 Protocol layering and data
Each layer takes data from above
 adds header information to create new data unit
 passes new data unit to layer below

source destination
M application application M message
Ht M transport transport Ht M segment
Hn Ht M network network Hn Ht M datagram
Hl Hn Ht M link link Hl Hn Ht M frame
physical physical

Review R-8
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

Review R-9
 The network edge:
 end systems (hosts):
❍ run application programs
❍ e.g. Web, email
❍ at “edge of network”
 client/server model
❍ client host requests, receives
service from always-on server
❍ e.g. Web browser/server;
email client/server
 peer-peer model:
❍ minimal (or no) use of
dedicated servers
❍ e.g. Gnutella, KaZaA

Review R-10
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”

Review R-11
End-to-end vs. Hop-by-hop
 Between the end systems  Between the routers (hop)
 Application layer  Network layer
❍ HTTP, FTP, SMTP, DNS ❍ Routing Principles:
❍ Content Distribution • DV vs. LS
 Transport layer ❍ IPv4
❍ UDP and TCP: • Addressing
• Forwarding
• Multiplexing
• Fragmentation
• Demultiplexing
• ICMP, DHCP, NAT
• checksuming
❍ TCP
❍ IP Routing
• Intra-domain (Intra-AS)
• Reliable data transfer
routing: RIP, OSPF
• Congestion control
• Inter-domain (Inter-AS)
• Flow control routing: BGP
• Connection management ❍ Router Architecture
• RTT and Timeout
estimation
❍ IPv6, Multicast
 Link layer
Review R-12
End-to-end vs. Hop-by-hop
 Between the end systems  Between the routers
 Application layer (hop)
❍ HTTP, FTP, SMTP, DNS  Network layer
❍ P2P
 Transport layer  Link layer
❍ UDP and TCP: ❍ Principles:
• Multiplexing • Error detection and
• Demultiplexing correction
• checksuming • MAC
❍ TCP ❍ LAN
• Reliable data transfer • Address and ARP
• Congestion control • Ethernet
• Flow control
– CSMA/CD
• Connection management
• Hubs vs. switches
• RTT and Timeout
estimation

Review R-13
End-to-end vs. Hop-by-hop
 Between the end systems  Between the routers
 Application layer
(hop)
❍ HTTP, FTP, SMTP, DNS
❍ P2P  Network layer
 Transport layer  Link layer
❍ UDP and TCP: ❍ Principles:
• Multiplexing
• Demultiplexing • Error detection and
• checksuming correction
❍ TCP • MAC
• Reliable data transfer ❍ LAN
• Congestion control
• Address and ARP
• Flow control
• Connection management
• Ethernet
• RTT and Timeout • Hubs, switches
estimation

Review R-14
Uni-media Networking
 Data transferred over Web HTTP, FTP,
SMTP, DNS
❍ Mostly text
❍ Some static pictures
❍ Few short sound clip

 What other forms of data we’d like to

communicate through the Internet?
❍ Human voice conversations
❍ TV broadcast
❍ Box movies

Review R-15
Multi-media Networking
 Human voice conversations, TV broadcast, box
movies
❍ Audio and video stream
❍ Some playback, some live
❍ Some interactive, some non-interactive
 Internet works for all these?
❍ Not really!
• Network layer
– Scheduling, IntServ, RSVP, DiffServ
❍ But we tried
• Application layer
– RTSP, Internet Phone
• Transport layer
– RTP/RTCP, SIP

Review R-16
6 Chapters in a Semester
1. Overview
2. Application Layer
3. Transport Layer
4. Network Layer
5. Link Layer
6. Wireless and Mobile Networking
7. Multimedia Networking

Review R-17
The Exam Problems
 A number of problems
 Each problem contains a number of questions,
from easier to more difficult
❍ Easier ones are to explain terms
• Ex. What is parity check and how does it work?
❍ Intermediate ones are to solve problems based on the
rules
• Ex. Given a 2-dimensional matrix of 0’s and 1’s with parity
row and column, can you tell if any bit in there is corrupted?
❍ Difficult ones are to compare different mechanisms
• Ex. Compare parity check with CRC in terms of computation
complexity and error detection rate

Review R-18
Keywords: Chapter 1
 Taxonomy
❍ Packet switching vs. Circuit switching
❍ Statistical Multiplexing
❍ Datagram network vs. Virtual circuit network
 Structure
❍ ISP
❍ NAP vs. Private peering
 Nodal delay
 Layered reference model
 Payload vs. header

Review R-19
Keywords: Chapter 2
 Intro  FTP
❍ Application vs. application- ❍ Out-of-band control
layer protocol
 EMail
❍ Client-server vs. peer-to-
peer paradigm ❍ SMTP vs. HTTP
❍ Socket ❍ POP3 vs. IMAP
❍ IP address and port  DNS
number ❍ Root, local, authoritative
❍ QoS servers
❍ TCP vs. UDP ❍ Iterated query
 Web and HTTP
❍ Caching
❍ Web page vs. web object
 P2P system
❍ URL
❍ HTTP 1.0 vs. 1.1 ❍ Centralized directory vs.
❍ Cookies vs. privacy decentralized directory
❍ HTTP client-side caching
❍ Why Web caching Review R-20
Keywords: Chapter 3
 Common functionality  TCP connection
❍ Multiplexing and management
demultiplexing ❍ Three-way handshake
❍ Checksum
 Reliable data transfer  Congestion control
❍ rdt 3.0 ❍ End-to-end vs. network-
❍ Stop-and-wait vs. pipelined assisted congestion
rdt control
❍ GBN vs. selective repeat  TCP congestion control
 TCP error recovery ❍ AIMD
❍ SampleRTT vs. ❍ Slow start
EstimatedRTT vs. DevRTT ❍ 3 duplicate acks
❍ Fast retransmit ❍ Conservative after
timeout events

Review R-21
Keywords: Chapter 4
 Virtual circuit vs. datagram  AS
 Routing ❍ Gateway routers
❍ Global vs. decentralized ❍ Intra-AS vs. Inter-AS
information routing
❍ Static vs. dynamic
 IPv4
 LS
❍ Oscillation problem
❍ IP address vs. interface
 DV
vs. network
❍ Iterative, asynchronous,
❍ Class-ful vs. CIDR
distributed addressing
❍ Good news travel fast vs. ❍ Fragmentation vs.
Bad news travel slow reassembly
❍ Count to infinity problem ❍ MTU
 LS vs. DV ❍ DHCP
❍ NAT
Review R-22
Keywords: Chapter 4
 IP routing  IPv6
❍ Stub AS vs. multi-homed ❍ Changes from IPv4 to IPv6
AS vs. transit AS ❍ Transition from IPv4 to
❍ Two-level routing IPv6: dual stack vs.
❍ IGP vs. EGP tunneling
❍ RIP vs. OSPF vs. IGRP  Multicast routing
❍ BGP ❍ Multicast vs. unicast
❍ Path Vector ❍ IGMP v1 vs. v2
 Router architecture ❍ Source-specific vs. group-
shared tree
❍ Input port vs. output port
❍ Reverse path forwarding
❍ HOL blocking
❍ Memory vs. bus vs.
❍ DVMRP
crossbar ❍ PIM dense mode vs. sparse
mode

Review R-23
Keywords: Chapter 5
 EDC  LAN, physical, MAC,
❍ Error detection vs. error Ethernet address
correction ❍ IP vs. LAN address
❍ EDC vs. D bits ❍ ARP vs. DNS
❍ Parity checking vs. ❍ ARP query vs. ARP reply
Internet checksum vs. CRC ❍ ARP cache
 MAC  Ethernet
❍ Channel partitioning vs. ❍ CSMA/CD
random access vs. taking
turns
❍ Jam signal
❍ TDMA vs. FDMA vs. CDMA
❍ Bit time
❍ Slotted Aloha vs. pure
❍ Exponential backoff
Aloha vs. CSMA vs. ❍ 10Base2 vs. 10BaseT vs.
CSMA/CD 100BaseT vs. Gbit
❍ Polling vs. token passing Ethernet
❍ Manchester encoding

Review R-24
Keywords: Chapter 6
 WLAN  Mobility
❍ 802.11b vs. 802.11a vs. ❍ Mobility with indirect
802.11g routing vs. direct
❍ Base station vs. ad hoc routing
mode ❍ Care-of address
❍ AP vs. BSS mode ❍ Triangle routing
❍ Hidden terminal ❍ Mobile IP
problem ❍ Cell phone net mobility
❍ CSMA/CA
❍ Binary backoff
❍ RTS, CTS, Data, Ack

Review R-25
Keywords: Chapter 7
 Application  Internet phone
❍ Talk spurt
❍ Multimedia application
❍ Network loss vs. delay loss
❍ QoS ❍ Fixed playout delay vs.
❍ Stored A/V vs. live A/V adaptive playout delay
vs. interactive A/V ❍ FEC simple vs. FEC
piggybacking vs.
❍ Delay sensitive, loss
interleaving
tolerant  Transport
❍ Delay jitter ❍ RTP vs. RTCP
 Streaming ❍ RTCP bandwidth scaling
❍ SIP
❍ HTTP vs. RTSP ❍ 5060
❍ FTP vs. RTSP ❍ SIP registrar vs. SIP
proxy

Review R-26
Keywords: Chapter 7
 How CDN works  IntServ
 Next generation ❍ Guaranteed vs.

Internet controlled load service

❍ RSVP  DiffServ
❍ IntServ vs. DiffServ ❍ In-profile vs. out-
profile
 Scheduling
❍ Expedited vs. assured
❍ FIFO vs. priority vs.
forwarding
round robin vs.
weighted fair
scheduling
❍ Token bucket vs. leaky
bucket

Review R-27