final review cs1652 jack lange university of pittsburgh
TRANSCRIPT
![Page 1: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/1.jpg)
Final ReviewCS1652
Jack LangeUniversity of Pittsburgh
![Page 2: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/2.jpg)
Final
Friday 14th: 12-2PM This room
Not Cumulative One page of notes
2
![Page 3: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/3.jpg)
3
Chapter 4: Network Layer
Network layer service model Forwarding vs. Routing IP addressing, NAT & DHCP Router architecture Routing algorithms Handling scale - CIDR and BGP ICMP, traceroute
![Page 4: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/4.jpg)
4
Network layer service model
Unreliable, connectionless data delivery Q: is UDP more reliable than IP? Q: do TCP packets receive more special
treatment than UDP packets? Host-to-host packet delivery
Q: Difference from transport layer? All systems implement network layer
End systems + routers Q: Why not routers implement transport
layer?
![Page 5: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/5.jpg)
5
Forwarding vs. Routing
Definition? Switch vs. router? How routing affects forwarding? Routing algorithms
Intradomain routing algorithms• Distance vector, Link state
Interdomain routing algorithms• BGP
Longest prefix match
![Page 6: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/6.jpg)
6
IP addressing, DHCP and NAT 32-bit IPv4 address
Subnet part + host part Subnet part is used for forwarding decision
CIDR Subnet portion can be an arbitrary size Why CIDR?
• IP allocation efficiency & supernetting
DHCP How it works? Where is it useful?
NAT Pros. and Cons.
![Page 7: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/7.jpg)
IP datagram format
ver length
32 bits
data (variable length,typically a TCP
or UDP segment)
16-bit identifier
header checksum
time tolive
32 bit source IP address
IP protocol versionnumber
header length (bytes)
max numberremaining hops
(decremented at each router)
forfragmentation/reassembly
total datagramlength (bytes)
upper layer protocolto deliver payload to
head.len
type ofservice
“type” of data flgsfragment
offsetupper layer
32 bit destination IP address
Options (if any) E.g. timestamp,record routetaken, specifylist of routers to visit.
how much overhead with TCP?
20 bytes of TCP 20 bytes of IP = 40 bytes +
app layer overhead
7
![Page 8: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/8.jpg)
4-8
Router Architecture
Two key router functions: Run routing algorithms/protocol (RIP, OSPF, BGP) Forwarding datagrams from incoming to outgoing link
![Page 9: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/9.jpg)
9
Routers
Input ports (line cards) Forwarding table lookup – line speed Queuing packets if switching fabric is busy
• Head-of-line blocking?
Switching fabric Via memory, bus, special interconnection
Output ports Buffering & scheduling
![Page 10: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/10.jpg)
10
Link state algorithm
Broadcast local link info to all routers Dijkstra’s algorithm
Greedy algorithm Compute the least cost path to every node Each loop finds at least one node whose
least cost path is found Algorithm complexity? O(nlogn) Oscillation problem
![Page 11: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/11.jpg)
11
Distance vector algorithm
Distribute one’s view of network to neighbors
Bellman-ford algorithm Dynamic programming Asynchronous update
Problem? Count-to-infinity & routing loops Possible solution?
![Page 12: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/12.jpg)
12
Border Gateway Protocol (BGP)
Autonomous System (AS) AS number – 16 bit id
BGP contains full path from src to dest AS AS PATH – list of AS numbers
How to prevent routing loops? Hot potato routing?
One reason for routing path asymmetry How to deliver a packet from one AS to
another? Intradomain (Intra-AS) routing Interdomain routing Forwarding table (FIB)
![Page 13: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/13.jpg)
13
Chapter 5: Link Layer
Delivering frames to a direct neighbor Error detection and correction Sharing a broadcast channel Reliable data transfer & flow control
Hop-by-hop vs. end-to-end
![Page 14: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/14.jpg)
14
Error detection & correction
Parity checking Single bit vs. two-dimentional bit parity Odd/even parity
Internet checksum – IP/TCP layer Why is error checking needed in the upper
layer? Cyclic Redunancy Check (CRC)
CRC32 is widely used (e.g., Ethernet)
![Page 15: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/15.jpg)
15
Multiple Access Protocol
How to share a broadcasting media Medium Acccess Control (MAC) protocol
Channel Partitioning Random Access Taking turns
![Page 16: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/16.jpg)
16
Random Access Protocol
Slotted ALOHA Fixed time slot – synchronized If collision, retransmit with a probability of p for
each slot ALOHA
No slot synchronization CSMA, CSMA/CD, CSMA/CA
CSMA – sense carrier before sending CD – detect collision while sending and cancel it CA – avoid collision by getting the permission
first Ethernet and Wi-Fi?
![Page 17: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/17.jpg)
17
MAC addresses
Ethernet: 48-bit MAC addresses Burned into hardware Globally uniquely assigned Why not use MAC address instead of IP?
Address Resolution Protocol (ARP) Determining MAC address with IP address ARP table = <IP address, MAC address, TTL> Broadcasting mechanism (make sure to
know!)
![Page 18: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/18.jpg)
18
Ethernet & Switch
Access protocol: CSMA/CD Old Ethernet hub used to share the access Understand the exponential back-off algorithm Most current devices are switches Connectionless, unreliable
Frame format Preamble, 2 MAC address, type, data, CRC32
Switch Make sure you understand self-learning
algorithm
![Page 19: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/19.jpg)
19
Chapter 6: Wireless
Difference from wired environment Signal attenuation Hidden terminal problem Interference from other sources (phone,
microwave) SNR (Signal-to-Noise ratio)
The larger, the better BER (Bit error rate)
CDMA
![Page 20: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/20.jpg)
20
Wi-Fi
Access protocol : CSMA/CA Reserve the channel first before sending No collision detection – why? Understand the sending protocol
Access Point(AP) Link layer device (may run DHCP) Passive/Active scanning for association
802.11 frame format Why we need three MAC addresses?
![Page 21: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/21.jpg)
21
Chapter 7: Multimedia
Quality of service guarantee Providing performance guarantee required by
app Current Internet does not directly support it
Delay sensitive, loss tolerant application Video streaming vs. Email? What is jitter?
Multimedia application Stored streaming Live streaming Real-time interactive
![Page 22: Final Review CS1652 Jack Lange University of Pittsburgh](https://reader035.vdocuments.us/reader035/viewer/2022062321/56649ef05503460f94c0081f/html5/thumbnails/22.jpg)
22
Internet Phone, CDN
Internet phone Network loss vs. delay loss
Content distribution networks (CDNs) Definition? DNS redirection for finding the near server?