Boots – shoes – and leggings
Patent
1988-05-12
1991-01-22
Lee, Thomas C.
Boots, shoes, and leggings
36424294, 3642612, 3642601, 370 60, G06F 1338
Patent
active
049875361
ABSTRACT:
The communications network includes a plurality of interconnected nodes and communication links between nodes. Computing apparatus in provided for determining a shortest path from a starting node to a destination node. The computing apparatus is adapted so that each node forms a routing tree having nodes with indentities, branches with weights, and a distinguished node called a root. The routing tree is the estimated shortest path to all of the nodes and each node communicates its routing tree to each adjacent node. Upon receipt of a routing tree by a reference node from an adjacent node, the reference node stores the routing tree and produces a large tree having roots and branches by placing the reference node as the root of the large tree and creating branches from the reference node to the roots of the routing trees of the adjacent nodes. The lengths of the branches are equal to the lengths of the links from the reference node to the adjacent nodes. A breadth first search of the large tree is performed to determine a connected subset of the large tree where each node identity appears only once. The connected subset forms the new routing tree for the reference node. If the new routing tree differs from the previous routing tree, the new routing tree is broadcast to all adjacent nodes and the procedure is repeated until no new tree differs from a previous tree, thereby defining a final routing tree. The final routing tree includes the shortest path from the reference node to all connected nodes.
REFERENCES:
patent: 4466060 (1984-08-01), Riddle
patent: 4656658 (1987-04-01), King
patent: 4736363 (1988-04-01), Aubin et al.
patent: 4748660 (1988-05-01), Deveze
patent: 4771424 (1988-09-01), Suzuki et al.
Awerbuch et al. "A New Distributed Algorithm to Find Breadth First Search Trees", IEEE Trans. of Information Theory, vol. IT-33, No. 3, May, 1987, pp. 315-322
"Routing Data Networks", Data Networks, Bertsekas et al., Chapter 5, pp. 318-333, 1987.
"Shortest-Path Routing", Telecommunication Networks: Protocols, Modeling and Analysis, Schwartz, pp. 267-281, 1987.
Jacob Hagouel, "Issues in Routing For Large and Dynamic Networks", 1983, pp. 30-92.
Codex Corporation
Lee Thomas C.
LandOfFree
Communication system for sending an identical routing tree to al does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Communication system for sending an identical routing tree to al, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communication system for sending an identical routing tree to al will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1558905