Bhargav R Bellur

6845091, Jan 18, 2005

Dec 1, 2000

09/728211

Richard G. Ogier - Half Moon Bay CA, US
Carla Peccolo Woodworth - San Mateo CA, US
Fred Lambert Templin - Portola Valley CA, US
Bhargav R. Bellur - Fremont CA, US
James A. Arnold - Helena MT, US
D. Scott Seaton - Fremont CA, US
Michael W. Frandsen - Helena MT, US
Nathan W. Williams - Helena MT, US
Christian A Gellrich - Redwood City CA, US

SRI International - Menlo Park CA

H04Q 724

370338, 370349, 370466, 709239, 709242

Described is an internetworking system having various mobile ad hoc extensions to the Internet that are particularly suited to the dynamic environment of mobile ad hoc networks. The internetworking system includes any combination of a link-state routing protocol for disseminating topology and link-state information over a multi-hop network comprised of nodes, a neighbor discovery protocol that can detect the appearance and disappearance of new neighbor nodes, an address format that facilitates deployment of IPv6 nodes in a predominantly IPv4 network infrastructure, a queuing mechanism that can update information upon resuming interrupted communications between nodes, and dynamic network measurement techniques for adaptively using wireless bandwidth when establishing and maintaining connections between nodes and a server.

7698463, Apr 13, 2010

Dec 1, 2000

09/728020

Richard G. Ogier - Half Moon Bay CA, US
Bhargav R. Bellur - Fremont CA, US
Fred Lambert Templin - Portola Valley CA, US

SRI International - Menlo Park CA

G06F 15/173

709242, 709244

Described is a link-state routing protocol used in a mobile ad hoc network or in an Internet for disseminating topology and link-state information throughout the network. Reverse-path forwarding is used to broadcast each update along the minimum-hop-path tree rooted at the source of the update. Each path tree has the source node as a root node, a parent node, and zero or more children nodes. Updates are received from the parent node in the path tree for the source node that originates the update. Each update includes information related to a link in the network. A determination is made whether to forward the update message to children nodes, if any, in the path tree maintained for the source node originating the update in response to information in the received update. This information itself can indicate whether the update is to be forwarded to other nodes.

6542469, Apr 1, 2003

Dec 10, 1998

09/209121

Timothy Gene Kelley - Shawnee KS
Nina Anne Taft - San Francisco CA
William Lee Edwards - Carbondale CO
Richard G. Ogier - Sunnyvale CA
Bhargav Bellur - Fremont CA

Sprint Communications Company, L.P. - Overland Park KS

H04J 322

370238, 370252, 370468

Methods for determining at least two pre-computed paths to a destination in a communications network are provided. The two paths are maximally disjoint. Maximally disjoint paths are paths where the number of links or nodes common to the two paths is minimized. This minimization is given a priority over other path considerations, such as bandwidth or cost metrics. By pre-computing a maximally disjoint pair of paths, the probability that an inoperable link or node is in both paths is minimized. The probability that the inoperable link or node blocks a transfer of data is minimized. Additionally, a pair of maximally disjoint paths is determined even if absolutely disjoint paths are not possible. The communications network may include at least four nodes, and maximally disjoint pairs of paths are pre-computed from each node to each other node. A third path from each node to each other node may also be computed as a function of bandwidth or a cost metric.