Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing
Reexamination Certificate
2007-11-06
2007-11-06
Dalencourt, Yves (Department: 2157)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
C709S221000, C709S239000, C709S240000, C709S242000, C709S249000, C370S254000, C370S255000
Reexamination Certificate
active
10154912
ABSTRACT:
The present invention is directed to finding a path between two nodes, including the routing and non-routing nodes of the path. Exemplary embodiments of the present invention are directed to a computer implemented method of finding a path between two nodes in a network. Exemplary steps of the method include obtaining information from a routing table of a first node in the path to determine a second node in the path; determining whether any non-routing nodes are in the path between the first and second nodes; and producing a representation of nodes in the path.
REFERENCES:
patent: 5835720 (1998-11-01), Nelson et al.
patent: 6578087 (2003-06-01), Garakani et al.
patent: 6697338 (2004-02-01), Breitbart et al.
patent: 2002/0143787 (2002-10-01), Knee et al.
patent: 2003/0115345 (2003-06-01), Chien et al.
Stevens W.R., “TCP/IP Illustrated, vol. 1,” 1994, Addison Wesley, pp. 137-138.
“TCP/IP Network Administration,” 2002, O'Reilly, “2.4 The Routing Table,” at http://www.hn.edu.cn/book/Network/NetworkingBookshelf—2ndEd/tcp/ch02—04.htm.
Natarajan Srikanth
Smith Darren D.
Dalencourt Yves
Hewlett--Packard Development Company, L.P.
LandOfFree
Method of finding a path between two nodes in a network does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of finding a path between two nodes in a network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of finding a path between two nodes in a network will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3841962