Directed acyclic graph computation by orienting shortest...

Details Directed acyclic graph computation by orienting shortest... Directed acyclic graph computation by orienting shortest...

2005-10-18

2010-02-02

Ryman, Daniel J (Department: 2419)

Multiplex communications

Pathfinding or routing

C370S238000, C370S254000, C370S400000

Reexamination Certificate

active

07656857

ABSTRACT:
Each network node in a network is configured for calculating a directed acyclic graph that provides at least one path from all the other network nodes toward the one network node. The network node performs a modified shortest path first calculation by identifying next-hop nodes adjacent to the network node, and orienting the link of each next-hop node toward itself (i.e., the origin). The network node also identifies secondary adjacent nodes, adjacent to each of the next hop nodes, and extends paths from next-hop nodes to the associated secondary adjacent nodes while orienting each of the links of the path between adjacent nodes and next-hop nodes toward the next hop nodes. The paths of the nodes form a directed acyclic graph from any other network node toward the origin, enabling distribution of the directed acyclic graph to the other network nodes for optimized reachability to the network node.

REFERENCES:
patent: 6667957 (2003-12-01), Corson et al.
patent: 2004/0081152 (2004-04-01), Thubert et al, Thubert et al.
patent: 2005/0041591 (2005-02-01), Duggi et al.
patent: 2006/0140123 (2006-06-01), Conner et al.
U.S. Appl. No. 11/167,240, filed Jun. 28, 2005.
Johnson et al., “Mobility Support in IPv6”, Network Working Group, Request for Comments: 3775, Jun. 2004.
Devarapalli et al., “Network Mobility (NEMO) Basic Support Protocol”, Network Working Group, Request for Comments: 3963, Jan. 2005.
Baker, “An outsider's view of Manet” <draft-baker-manet-review-01> Network Working Group Internet Draft, Mar. 17, 2002.
Ernst et al., “Network Mobility Support Terminology” <draft-ernst-monet-terminology-00.txt> IETF Internet Draft. Feb. 2002.
Ernst et al.,“Network Mobility Support Terminology” <draft-ernst-monet-terminology-01.txt> IETF Internet Draft. Jul. 2002.
Thubert et al. “Nested Nemo Tree Discovery” <draft-thubert-tree-discovery-01.txt> NEMO Working group Internet Draft, Oct. 11, 2004.
Moy, “OSPF Version 2”, Network Working Group Request for Comments: 2328, Apr. 1998.
Park et al., “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks”, Proceedings of IEEE Infocom '97, (1997).
Park et al., “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks”, Proceedings of IEEE INFOCOM '97, (1997) (Powerpoint Presentation by Xin Zhang).

Affiliated with

Also associated with

Rating

Directed acyclic graph computation by orienting shortest... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Directed acyclic graph computation by orienting shortest..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Directed acyclic graph computation by orienting shortest... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4179026