Patents by Inventor Cat Okita

Cat Okita 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).

  • Patent number: 9253038
    Abstract: Instances of router models and filter models respectively are populated with configuration data from routers and filters in a network. A route advertising graph is derived from the router model instances. The route advertising graph indicates propagation of routes between the ones of the real-world devices serving as routers according to routing protocols implemented by the ones of the real-world devices serving as routers. Consolidated routing data is determined for the ones of the real-world devices serving as routers. In this process, the propagation of routes indicated by the route advertising graph is iterated to stability. For a destination node in the network, a respective route graph indicating available paths to the destination node from each source node in the network is constructed from the consolidated routing data. Services between each source node and the destination node are classified based on a full traversal of the route advertising graph.
    Type: Grant
    Filed: August 4, 2009
    Date of Patent: February 2, 2016
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Sandeep N Bhatt, Prasad V Rao, Cat Okita
  • Publication number: 20110142051
    Abstract: Instances of router models and filter models respectively are populated with configuration data from routers and filters in a network (20). A route advertising graph is derived from the router model instances (21). The route advertising graph indicates propagation of routes between the ones of the real-world devices serving as routers according to routing protocols implemented by the ones of the real-world devices serving as routers. Consolidated routing data is determined for the ones of the real-world devices serving as routers (21). In this process, the propagation of routes indicated by the route advertising graph is iterated to stability. For a destination node in the network, a respective route graph indicating available paths to the destination node from each source node in the network is constructed from the consolidated routing data (22). Services between each source node and the destination node are classified based on a full traversal of the route advertising graph (23).
    Type: Application
    Filed: August 4, 2009
    Publication date: June 16, 2011
    Inventors: Sandeep N. Bhatt, Prasad V. Rao, Cat Okita