发明授权
- 专利标题: Routing packets on a network using directed graphs
- 专利标题(中): 使用有向图在网络上路由数据包
-
申请号: US12101071申请日: 2008-04-10
-
公开(公告)号: US08230108B2公开(公告)日: 2012-07-24
- 发明人: Wallace A. Pratt, Jr. , Mark J. Nixon , Eric D. Rotvold , Robin S. Pramanik , Tomas P. Lennvall , Yuri Zats , Terrence L. Blevins
- 申请人: Wallace A. Pratt, Jr. , Mark J. Nixon , Eric D. Rotvold , Robin S. Pramanik , Tomas P. Lennvall , Yuri Zats , Terrence L. Blevins
- 申请人地址: US TX Austin
- 专利权人: Hart Communication Foundation,Dust Networks, Inc.
- 当前专利权人: Hart Communication Foundation,Dust Networks, Inc.
- 当前专利权人地址: US TX Austin
- 代理机构: Marshall, Gerstein & Borun LLP
- 主分类号: G06F15/16
- IPC分类号: G06F15/16 ; G06F12/00
摘要:
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.
公开/授权文献
- US20090046732A1 Routing Packets on a Network Using Directed Graphs 公开/授权日:2009-02-19
信息查询