| http://www.w3.org/ns/prov#value | - A method of providing loop free routing of data packets in a network as set forth in claim 9 further comprising the steps of:storing in said database of at least some of said switches a shadow imaginary link state packet corresponding to each of said switches including a list of adjacencies, an undefined flag associated with each adjacency and a ready bit for each of said adjacent switches reach
|
