Mistake on the calendar:
	rstp is for switching, not routing
	Let's look at the calendar a minute:
		We're actually in danger of getting ahead of schedule!
		If we get to Python too early, we have options:
			Start on volume 2
			Do some more examples or experiment with strange configurations
			Learn how to set up a Linux or FreeBSD machine as a router
			See if there's a Juniper router simulator out there

Spanning-Tree Protocol and RSTP:
	Redundant links might be useful!
		But they're also a problem
		Ok if they're a bonded channel, but failing that, they're a problem
	So, we need to make a tree

CS Interlude that I really can't resist adding:
	Graphs are a fairly specialized data structure
	Sometimes a little hard to work with
	Example:  Graph isomorphism
		NP-hard problem
		What's NP-hard?  Algorithm scaling overview
	Some big data ends up being in graph form
		Social media network, etc
		A use I made:  Movement patterns in a smart environment
	Don't confuse it with a relational database
		Relational database has similarities, but is conceived and managed differently
	Trees are a restricted form of graphs:
		It's a graph with no cycles
		We could pick any node as the root depending on our needs
	Example uses for trees:
		Data structures:  Fast retrieval (example:  red-black tree)
		Parse trees for linguistic analysis, in compilers and such
		Decision trees for classic artificial intelligence (and pruning)
		J48 decision trees for machine learning
		A use of mine:  Finding important parts of an MRI
	Note:  trees are always drawn upside-down

That was a tangent!  Back to switches
	
Let's assemble a bunch of switches with some loops and such
	They'll automatically disable some ports
	We can observe that looking at them
	What if we remove some of the links that remain?

Can we observe a broadcast storm?
	no rstp or something like that?
	Hopefully I'll try this before class, but if not, we'll see what goes wrong

Basic process:
	elect a root switch, all root interfaces go into forwarding state
	Other switches keep only the least cost path to the root enabled

An obvious question:  Shouldn't the most central switch be the root?
	Or perhaps the closest to the router that leads out?
	There's a priority part of the Bridge ID (BID)
		BID is 6 bytes unique to each switch + 2 byte priority
		Lowest BID wins
		Priority is in the highest 2 bytes, so it rules

PortFast:
	Is this maybe why switches take so long to come online?
	Can be turned off for links to end devices
	Let's try it!
	Turning this off and then plugging in a switch could be a problem...
		Let's try that too!

Inexpensive switch problem:
	Does packet tracer have one?
	This is what happened at WSU when I was there
	If we have time, let's try this in the 310 lab

For lab, configure a network with:
	At least 4 switches and 8 PCs
	Must have two non-overlapping IP ranges on two vlans
	All switches must have at least one PC on each vlan/IP range
	Use trunking to connect the switches
	Put the trunks in a loop, and see if RSTP can handle it
	Use a router to enable communication between the two different vlans