Invention Grant
- Patent Title: Routing packets on a network using directed graphs
- Patent Title (中): 使用有向图在网络上路由数据包
-
Application No.: US13106464Application Date: 2011-05-12
-
Publication No.: US08892769B2Publication Date: 2014-11-18
- Inventor: Wallace A. Pratt, Jr. , Mark J. Nixon , Eric D. Rotvold , Robin S. Pramanik , Tomas P. Lennvall , Yuri Zats , Terrence Lynn Blevins
- Applicant: Wallace A. Pratt, Jr. , Mark J. Nixon , Eric D. Rotvold , Robin S. Pramanik , Tomas P. Lennvall , Yuri Zats , Terrence Lynn Blevins
- Applicant Address: US TX Austin
- Assignee: Hart Communication Foundation
- Current Assignee: Hart Communication Foundation
- Current Assignee Address: US TX Austin
- Agency: Marshall, Gerstein & Borun LLP
- Main IPC: G06F15/173
- IPC: G06F15/173 ; H04L12/721 ; H04L12/707 ; H04L12/66 ; H04L12/717 ; H04W40/22 ; G06F15/16

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.
Public/Granted literature
- US20110216656A1 Routing Packets on a Network Using Directed Graphs Public/Granted day:2011-09-08
Information query