The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jul. 24, 2012
Filed:
Apr. 10, 2008
Wallace A. Pratt, Jr., Pflugerville, TX (US);
Mark J. Nixon, Round Rock, TX (US);
Eric D. Rotvold, West St. Paul, MN (US);
Robin S. Pramanik, Karlsruhe, DE;
Tomas P. Lennvall, Vasteras, SE;
Yuri Zats, Menlo Park, CA (US);
Terrence L. Blevins, Round Rock, TX (US);
Wallace A. Pratt, Jr., Pflugerville, TX (US);
Mark J. Nixon, Round Rock, TX (US);
Eric D. Rotvold, West St. Paul, MN (US);
Robin S. Pramanik, Karlsruhe, DE;
Tomas P. Lennvall, Vasteras, SE;
Yuri Zats, Menlo Park, CA (US);
Terrence L. Blevins, Round Rock, TX (US);
Hart Communication Foundation, Austin, TX (US);
Abstract
A method of routing a data packet between a first node and a second node on a communication network includes defining a first graph through the first node and the second node and zero or more intermediate nodes, associating several nodes which belong to the communication network with the first graph, associating a first unique graph identifier with the first graph and providing at least partial definitions of the first graph and the first unique identifier to at least some of the nodes associated with the first graph. The method then sends data packet with the graph identifier from the first node, and directs the data packet to the second node via the zero or more intermediate nodes using the graph identifier. This method may include forwarding the packet to a neighbor node of an intermediate node if the intermediate node and the neighbor node are nodes associated with the first graph and if the intermediate node and the neighbor node are connected by at least one direct communication connection.