| US 7,463,638 B2 | ||
| Up-tree topology trace for network route tracing | ||
| David M. Durham, Hillsboro, Oreg. (US); and Russell J. Fenger, Beaverton, Oreg. (US) | ||
| Assigned to Intel Corporation, Santa Clara, Calif. (US) | ||
| Filed on Mar. 08, 2004, as Appl. No. 10/795,791. | ||
| Application 10/795791 is a continuation of application No. 09/217761, filed on Dec. 21, 1998, granted, now 6,704,319. | ||
| Prior Publication US 2004/0240396 A1, Dec. 02, 2004 | ||
| This patent is subject to a terminal disclaimer. | ||
| Int. Cl. H04L 12/28 (2006.01); G06F 15/16 (2006.01) | ||
| U.S. Cl. 370—408 [370/256; 709/252] | 6 Claims |
| 1. A method comprising:
representing a network as a logical tree having a plurality of nodes, each one of the nodes corresponding to a component in
the network and each non-root node having a parent node;
identifying two nodes in the logical tree, a first node corresponding to a first host in the network and a second node corresponding
to a second host in the network;
detecting if one of the two nodes exists at a lower level of the logical tree;
tracing a first path from the first node at the lower level to the parent node at a higher level until the parent node is
at a same level of the logical tree as the second node; and
continuing to trace the first path up the logical tree from the parent node and tracing a second path up the logical tree
from the second node until the first path and the second path meet at a same node.
|