Patents by Inventor Andrew W. Stone

Andrew W. Stone 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).

  • Bidirectional constrained path search
    Patent number: 10560367
    Abstract: This disclosure generally discloses a bidirectional constrained path search mechanism. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, such that the bidirectional paths share a common set of resources. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, by determining a forward path that satisfies a set of forward path constraints associated with the forward path and determining a reverse path that satisfies a set of reverse path constraints associated with the reverse path. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes in a single path search iteration, such as via a traversal of a weighted directed graph, thereby improving performance.
    Type: Grant
    Filed: January 18, 2016
    Date of Patent: February 11, 2020
    Assignee: Nokia of America Corporation
    Inventors: Andrew W. Stone, Felix Katz, Ehsan Rezaaifar, Attaullah Zabihi-Seissan
  • BIDIRECTIONAL CONSTRAINED PATH SEARCH
    Publication number: 20170207993
    Abstract: This disclosure generally discloses a bidirectional constrained path search mechanism. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, such that the bidirectional paths share a common set of resources. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, by determining a forward path that satisfies a set of forward path constraints associated with the forward path and determining a reverse path that satisfies a set of reverse path constraints associated with the reverse path. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes in a single path search iteration, such as via a traversal of a weighted directed graph, thereby improving performance.
    Type: Application
    Filed: January 18, 2016
    Publication date: July 20, 2017
    Applicant: Alcatel-Lucent Canada Inc.
    Inventors: Andrew W. Stone, Felix Katz, Ehsan Rezaaifar, Attaullah Zabihi-Seissan