1. Networking CS 3470, Section 1 Sarah Diesburg
Exam Review
Networking
CS 3470, Section 1
Sarah Diesburg

2. Coverage Total: 50 points; 1 min / point
43-45 points based on lectures, assignments, and project 1a
5-7 points based on your ability to apply various principles learned in the class
Multiple choice, short answer, and problem solving questions

3. Switching and Bridging
Definitions
Circuit switching
Also connection-oriented approach
Packet switching
Also connectionless/datagram approach
Asymmetric routing
Hub
Bridge

4. Switching and Bridging
Definitions
Flooding (with switches)
Root bridge (spanning tree protocol)
VLAN

5. Switching and Bridging
Short answer
Bridge advantages over hubs
Bridge self-learning algorithm
Need for spanning tree algorithm
Be able to construct the spanning tree by looking at a network diagram
Don’t have to be able to write out all the configuration messages

6. Routers
Definitions
Router
Gateway
Queueing delay
Switching fabric

7. Routers Short answers Types of switching fabrics
Memory, bus, crossbar
Routers compared to switches
Four basic components to a router architecture
Input ports, output ports, switching fabric, routing processor

8. Forwarding Definitions Forwarding table
Virtual Circuit Identifier (VCI)
Permanent Virtual Circuit
Switched Virtual Circuit

9. Forwarding Short answers
Identifying full host-to-host virtual circuit connections
Homework 4, Question 5
Constructing datagram forwarding tables
Homework 4, Question 4

10. Internet Protocol (IP)
Definitions
Internetwork
IP packet delivery model
Connectionless, best-effort
Maximum Transmission Unit (MTU)

11. Internet Protocol (IP)
Short answer
Be able to explain certain IP packet format fields
Version, Ident, TTL, Checksum
Be able to compare and contrast the transport-level protocols that run on top of IP
TCP, UDP

12. Addressing Definitions Mulit-homed host Classful addressing scheme
Classless Inter-Domain Routing (CIDR)
Broadcast address
Loopback address
Network Address Translation (NAT)
Subnet mask, subnet ID
Longest-prefix match

13. Addressing Short answers
Be able to explain number of network/host bits that make up a class A, B, C network
Be able to explain the reason for the ARP and DHCP protocols
Be able to determine the destination subnet of a packet (Homework 5)

14. Routing Definitions Autonomous System (AS) Intra-AS Routing
Inter-AS Routing
Link-state routing
Distance-vector routing
RIP is example
Count-to-infinity problem
Split horizon with poison reverse

15. Routing
Short answers
What is the difference between routing and forwarding?
Dijkstra’s algorithm (Homework 6)

16. Inter-AS Routing and IPv6
Definitions
Open Shortest Path First (OSPF)
Type of link-state routing algorithm
Border Gateway Protocol (BGP)
Different types of ASs
Stub AS, Multihomed AS, Transit AS

17. Inter-AS Routing and IPv6
Short answers
What are some of the reasons we are trying to move to IPv6?
How large is an IPv6 address?
What does the :: mean in an IPv6 address?
How can we go from an IPv4 address to an IPv6 address?
How can we go from an Ethernet MAC address to an IPv6 address?

18. Network Programming Short answers Control flow of chat
Server side and client side
Creating your own protocols by sending specialized data across your packet
For example, our chat programs expected a certain struct chat_packet with specific members

19. Network Programming Short answers
Importance of network-to-host order and host-to-network order functions
htons() and ntohs()
What is the default network order?
Little-endian or big-endian?