Patents by Inventor Richard G. Ogier
Richard G. Ogier has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20120002536Abstract: Described are an apparatus and method for routing packets through a multiple-hop wireless communications network. Interference with packet switched communications carried by radio frequency (RF) over the multiple-hop wireless communications network is detected. In response to information related to the detected interference, a route is adaptively determined for transmitting packets through the multiple-hop wireless communications network that mitigates the effect of the interference on the packets.Type: ApplicationFiled: September 12, 2011Publication date: January 5, 2012Inventors: Barghav R. Bellur, Richard G. Ogier, Ambatipudi R. Sastry, Karl Steadman, John Waterston
-
Patent number: 8018840Abstract: Described are an apparatus and method for routing packets through a multiple-hop wireless communications network. Interference with packet switched communications carried by radio frequency (RF) over the multiple-hop wireless communications network is detected. In response to information related to the detected interference, a route is adaptively determined for transmitting packets through the multiple-hop wireless communications network that mitigates the effect of the interference on the packets.Type: GrantFiled: August 3, 2007Date of Patent: September 13, 2011Assignee: SRI InternationalInventors: Barghav R. Bellur, Richard G. Ogier, Ambatipudi R. Sastry, Karl Steadman, John Waterston
-
Patent number: 7698463Abstract: 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.Type: GrantFiled: December 1, 2000Date of Patent: April 13, 2010Assignee: SRI InternationalInventors: Richard G. Ogier, Bhargav R. Bellur, Fred Lambert Templin
-
Patent number: 7342876Abstract: Described are an apparatus and method for routing packets through a multiple-hop wireless communications network. Interference with packet switched communications carried by radio frequency (RF) over the multiple-hop wireless communications network is detected. In response to information related to the detected interference, a route is adaptively determined for transmitting packets through the multiple-hop wireless communications network that mitigates the effect of the interference on the packets.Type: GrantFiled: December 20, 2001Date of Patent: March 11, 2008Assignee: SRI InternationalInventors: Barghav R. Bellur, Richard G. Ogier, Ambatipudi R. Sastry, Karl Steadman, John Waterston
-
Patent number: 7327683Abstract: A proactive link-state routing protocol designed for mobile ad-hoc networks is disclosed, which provides hop-by-hop routing along shortest paths to each destination. Each node running the present protocol will compute a source tree (providing paths to all reachable nodes) based on partial topology information stored in its topology table. To minimize overhead, each node reports only “part” of its source tree to neighbors. The present invention employs a combination of periodic and differential updates to keep all neighbors informed of the reportable part of its source tree. The present invention performs neighbor discovery using “differential” HELLO messages that report only “changes” in the status of neighbors. This results in HELLO messages that are much smaller than those of other link-state routing protocols.Type: GrantFiled: November 29, 2002Date of Patent: February 5, 2008Assignee: SRI InternationalInventors: Richard G. Ogier, Fred L. Templin, Mark G. Lewis
-
Patent number: 7263063Abstract: Described are a system and method of providing quality of service assurances for transmitting packets over a channel capable of transmission at a nominal bandwidth. A plurality of classes is defined. Each class represents an aggregate behavior of packets and is allocated a nominal departure rate at which the packets of that class are transmitted when an available bandwidth of the channel is substantially at the nominal bandwidth. Each class is assured a minimum allocation of the available bandwidth for transmitting packets of that class if the available bandwidth of the channel is operating at less than the nominal bandwidth. The minimum allocations to each of the classes can be proportionally different than the nominal departure rates allocated to these classes.Type: GrantFiled: July 6, 2001Date of Patent: August 28, 2007Assignee: SRI InternationalInventors: Ambatipudi R. Sastry, Richard G. Ogier
-
Patent number: 7031288Abstract: A protocol for discovering a new neighbor node and detecting the loss of an existing neighbor node in a network is described. A node receives a neighbor discovery message from a neighbor node. The node receiving the neighbor discovery message periodically transmits a predetermined number of neighbor discovery messages in response to the received neighbor discovery message. Each neighbor discovery message includes an identity of the neighbor node. After transmitting the predetermined number of neighbor discovery messages, the node transmits neighbor discovery messages that omit the identity of the neighbor node until another neighbor discovery message is received from the neighbor node that indicates a change in a communications state associated with the neighbor node.Type: GrantFiled: December 1, 2000Date of Patent: April 18, 2006Assignee: SRI InternationalInventor: Richard G. Ogier
-
Patent number: 7006437Abstract: Scheduling mechanisms for attaining a per-hop behavior for a plurality of classes of packet traffic in a multi-hop network are described. The per-hop behavior allocates to each class a nominal departure rate and a minimum percentage of available bandwidth. The scheduling mechanisms define a first condition that affects packet forwarding in accordance with the nominal departure rates allocated to the classes and a second condition that affects packet forwarding in accordance with the minimum percentages of the available bandwidth allocated to the classes. Packet forwarding rates for each of the classes are compared with the first and second conditions to select one of the classes for forwarding packets of that class over the network.Type: GrantFiled: July 6, 2001Date of Patent: February 28, 2006Assignee: SRI InternationalInventors: Richard G. Ogier, Ambatipudi R. Sastry
-
Patent number: 6845091Abstract: 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.Type: GrantFiled: December 1, 2000Date of Patent: January 18, 2005Assignee: SRI InternationalInventors: Richard G. Ogier, Carla Peccolo Woodworth, Fred Lambert Templin, Bhargav R. Bellur, James A. Arnold, D. Scott Seaton, Michael W. Frandsen, Nathan W. Williams, Christian A Gellrich
-
Patent number: 6804199Abstract: 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.Type: GrantFiled: February 4, 2003Date of Patent: October 12, 2004Assignee: Sprint Communications Company, L.P.Inventors: Timothy Gene Kelly, Nina Anne Taft, William Lee Edwards, Richard G. Ogier, Bhargav Bellur
-
Publication number: 20030179742Abstract: A proactive link-state routing protocol designed for mobile ad-hoc networks is disclosed, which provides hop-by-hop routing along shortest paths to each destination. Each node running the present protocol will compute a source tree (providing paths to all reachable nodes) based on partial topology information stored in its topology table. To minimize overhead, each node reports only “part” of its source tree to neighbors. The present invention employs a combination of periodic and differential updates to keep all neighbors informed of the reportable part of its source tree. The present invention performs neighbor discovery using “differential” HELLO messages that report only “changes” in the status of neighbors. This results in HELLO messages that are much smaller than those of other link-state routing protocols.Type: ApplicationFiled: November 29, 2002Publication date: September 25, 2003Inventors: Richard G. Ogier, Fred L. Templin, Mark G. Lewis
-
Publication number: 20030120809Abstract: Described are an apparatus and method for routing packets through a multiple-hop wireless communications network. Interference with packet switched communications carried by radio frequency (RF) over the multiple-hop wireless communications network is detected. In response to information related to the detected interference, a route is adaptively determined for transmitting packets through the multiple-hop wireless communications network that mitigates the effect of the interference on the packets.Type: ApplicationFiled: December 20, 2001Publication date: June 26, 2003Inventors: Barghav R. Bellur, Richard G. Ogier, Ambatipudi R. Sastry, Karl Steadman, John Waterston
-
Publication number: 20030095504Abstract: A protocol for discovering a new neighbor node and detecting the loss of an existing neighbor node in a network is described. A node receives a neighbor discovery message from a neighbor node. The node receiving the neighbor discovery message periodically transmits a predetermined number of neighbor discovery messages in response to the received neighbor discovery message. Each neighbor discovery message includes an identity of the neighbor node. After transmitting the predetermined number of neighbor discovery messages, the node transmits neighbor discovery messages that omit the identity of the neighbor node until another neighbor discovery message is received from the neighbor node that indicates a change in a communications state associated with the neighbor node.Type: ApplicationFiled: December 1, 2000Publication date: May 22, 2003Inventor: Richard G. Ogier
-
Patent number: 6542469Abstract: 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.Type: GrantFiled: December 10, 1998Date of Patent: April 1, 2003Assignee: Sprint Communications Company, L.P.Inventors: Timothy Gene Kelley, Nina Anne Taft, William Lee Edwards, Richard G. Ogier, Bhargav Bellur
-
Publication number: 20030058871Abstract: Described are a system and method of providing quality of service assurances for transmitting packets over a channel capable of transmission at a nominal bandwidth. A plurality of classes is defined. Each class represents an aggregate behavior of packets and is allocated a nominal departure rate at which the packets of that class are transmitted when an available bandwidth of the channel is substantially at the nominal bandwidth. Each class is assured a minimum allocation of the available bandwidth for transmitting packets of that class if the available bandwidth of the channel is operating at less than the nominal bandwidth. The minimum allocations to each of the classes can be proportionally different than the nominal departure rates allocated to these classes.Type: ApplicationFiled: July 6, 2001Publication date: March 27, 2003Inventors: Ambatipudi R. Sastry, Richard G. Ogier
-
Publication number: 20030007453Abstract: Scheduling mechanisms for attaining a per-hop behavior for a plurality of classes of packet traffic in a multi-hop network are described. The per-hop behavior allocates to each class a nominal departure rate and a minimum percentage of available bandwidth. The scheduling mechanisms define a first condition that affects packet forwarding in accordance with the nominal departure rates allocated to the classes and a second condition that affects packet forwarding in accordance with the minimum percentages of the available bandwidth allocated to the classes. Packet forwarding rates for each of the classes are compared with the first and second conditions to select one of the classes for forwarding packets of that class over the network.Type: ApplicationFiled: July 6, 2001Publication date: January 9, 2003Inventors: Richard G. Ogier, Ambatipudi R. Sastry
-
Publication number: 20020062388Abstract: 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.Type: ApplicationFiled: December 1, 2000Publication date: May 23, 2002Inventors: Richard G. Ogier, Bhargav R. Bellur, Fred Lambert Templin
-
Publication number: 20020012320Abstract: 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.Type: ApplicationFiled: December 1, 2000Publication date: January 31, 2002Inventors: Richard G. Ogier, Carla Peccolo Woodworth, Fred Lambert Templin, Bhargav R. Bellur, James A. Arnold, D. Scott Seaton, Michael Frandsen, Nathan W. Williams, Christian A. Gellrich