Patents by Inventor Raphael Amorim Dantas Leite

Raphael Amorim Dantas Leite 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: 10567384
    Abstract: Example method includes: receiving, by a network device, a plurality of input policy graphs and a composed policy graph associated with the input policy graphs; dividing the composed policy graph into a plurality of sub-graphs, each sub-graph comprising a plurality of edges and a plurality of source nodes and destination nodes that the edges are connected to; selecting a first subset of sub-graphs that include, as a source node, a disjoint part of an original source EPG for each input policy graph; identifying a second subset within the first subset of sub-graphs that include, as a destination node, a disjoint part of an original destination EPG for the each input policy graph; and verifying whether connectivity in the composed policy graph reflects a corresponding policy in the plurality of input policy graphs for each sub-graph in the second subset.
    Type: Grant
    Filed: August 25, 2017
    Date of Patent: February 18, 2020
    Assignee: Hewlett Packard Enterprise Development LP
    Inventors: Joon-Myung Kang, Mario Antonio Sanchez, Ying Zhang, Anu Mercian, Raphael Amorim Dantas Leite, Sujata Banerjee
  • Publication number: 20190068598
    Abstract: Example method includes: receiving, by a network device, a plurality of input policy graphs and a composed policy graph associated with the input policy graphs; dividing the composed policy graph into a plurality of sub-graphs, each sub-graph comprising a plurality of edges and a plurality of source nodes and destination nodes that the edges are connected to; selecting a first subset of sub-graphs that include, as a source node, a disjoint part of an original source EPG for each input policy graph; identifying a second subset within the first subset of sub-graphs that include, as a destination node, a disjoint part of an original destination EPG for the each input policy graph; and verifying whether connectivity in the composed policy graph reflects a corresponding policy in the plurality of input policy graphs for each sub-graph in the second subset.
    Type: Application
    Filed: August 25, 2017
    Publication date: February 28, 2019
    Inventors: Joon-Myung Kang, Mario Antonio Sanchez, Ying Zhang, Anu Mercian, Raphael Amorim Dantas Leite, Sujata Banerjee
  • Publication number: 20180205790
    Abstract: Distributed data structures in a software defined networking (SDN) environment is disclosed. One example is a system including at least one processor and a memory storing instructions executable by the at least one processor to access a tree data structure located at a central node in the SDN environment, retrieve, at a local node of the network, a sub-tree of the data structure, the sub-tree determined based on a management policy associated with the local node or the central node, and cache sub-trees of the data structure at respective local nodes to generate a distributed data structure in the environment.
    Type: Application
    Filed: January 13, 2017
    Publication date: July 19, 2018
    Inventors: Anu Mercian, Raphael Amorim Dantas Leite, Mario Antonio Sanchez, Joon-Myung Kang, Sujata Banerjee