routing tables...
use bitmasking to yank out the network address from the IP using the subnet mask
128.96.171.92/23 -> 128.96.170.0, subnet 255.255.254.0

routing protocols
	routing metrics - hop count, bandwidth/throughput, 
forwarding tables
	after routing lookup is complete, next hop determined, packet is forwarded according to:
		local delivery model: dst and host on same local net, packet is inserted into a MAC frame and forwarded directly to dst
		remote delivery model: dst and host on different nets, packet is inserted into a layer2 frame and forwarded to next hop router, mac of dst is unknown, so next hop's mac address is used

initial distances - arrange table full of link costs, infinity for links that do not exist
	routers pass their route costs to neighbors
		router receives a cost table
		adds the cost of the link it came over
		for each entry
			if the cost in the received table is lower
				record that cost and the link that the cost table came from
		this process happens simultaneously and in parallel across the entire network

dynamic routing protocols
	distance vector protocols
		based on bellman ford algorithm
		each route ron net compiles list of nets it can reach in the form of a dist vec
		exchange list with neighbors only
		upon receiving vecs from each neighbor, router computs its own dist to each neighbor
		for every net X, router finds that neighbor who is closer to X than to any other neighbor, updates its cost to X
	link state protocols
		based on algorithm by dijkstra
		each router on net is assumed to know the state of links to all neighbors
		each router will disseminate, via reliable flooding of link state packets, the info about its link states to all routers in the network
		closest node will be absorbed until all nodes are in the spanning tree, tree is unique for each node in the net