Exam 2 Review Networking CS 3470 Sarah Diesburg

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

Switching and Bridging n Definitions ¡ ¡ ¡ Flooding (with switches) Root bridge (spanning tree protocol) VLAN

Switching and Bridging n 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 n Don’t have to be able to write out all the configuration messages

Routers n Definitions ¡ ¡ Router Gateway Queueing delay Switching fabrics

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

Forwarding n Definitions ¡ ¡ Forwarding table Virtual Circuit Identifier (VCI)

Forwarding n Short answers ¡ ¡ Identifying full host-to-host virtual circuit connections Constructing datagram forwarding tables

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

Internet Protocol (IP) n Short answer ¡ Be able to explain certain IP packet format fields n Version, Ident, TTL, Checksum

Addressing n 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

Addressing n 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) Be able to answer applied subnet questions (Homework 6)

Routing n Definitions ¡ ¡ Autonomous System (AS) Intra-AS Routing Inter-AS Routing Link-state routing n ¡ OSPF is example Distance-vector routing n RIP is example

Routing n Short answers ¡ ¡ Dijkstra’s algorithm (Homework 6) Bellman-Ford algorithm (Homework 6)

Inter-AS Routing and IPv 6 n Definitions ¡ Open Shortest Path First (OSPF) n ¡ Border Gateway Protocol (BGP) n ¡ Type of link-state routing algorithm Inter-AS routing protocol Different types of ASs n Stub AS, Multihomed AS, Transit AS

Inter-AS Routing and IPv 6 n Short answers ¡ ¡ ¡ What are some of the reasons we are trying to move to IPv 6? How large is an IPv 6 address? What does the : : mean in an IPv 6 address? How can we go from an IPv 4 address to an IPv 6 address? How can we go from an Ethernet MAC address to an IPv 6 address?

Network Programming n Short answers ¡ Be able to tell me what the select function is doing in a piece of pseudocode