Data
Communications
M&IS 64081
Section 001
Spring 2007
Office Hours: Tues & Thurs 1:30pm-2:00pm, 3:30pm-5:15pm & 6:45pm-7:00pm

 


 

 

Algorhyme
"I think that I shall never see a graph more lovely than a tree.
A tree whose crucial property is loop-free connectivity.
A tree that must be sure to span, so packets can reach every LAN.
First the root must be selected, by ID it is selected
Least-cost paths from root are traced
In the tree these paths are placed
A mesh is made for folks by me, then bridges find a spanning tree."
--Radia Perlman

 

Dr. Catherine M. Bakes
Associate Professor
Office A405
College of Business Administration
Kent State University
Phone: 330.672.1162

 

Valid XHTML 1.0 Transitional