Patents by Inventor Lee-Wei Liu

Lee-Wei Liu 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: 10103974
    Abstract: A software-defined network (SDN) controller and a multipath routing method thereof are provided. In the method, a maximum bottleneck bandwidth (MBB) and a minimum hop count (MHC) of each of the nodes in the SDN are initiated. Next, a source node is visited, and neighboring nodes thereof are discovered to relax paths between the source node and each neighboring node. Then, a forwarding node having a maximum MBB among other nodes is visited, and its neighboring nodes which are connected therewith and unvisited are discovered to relax the paths between the forwarding node and each neighboring node. Afterwards, the rest of the nodes are consecutively visited until all nodes are visited. Finally, a disjoint path lookup table is established according to relation between the paths recorded for each node, and accordingly k disjoint paths having the maximum bottleneck bandwidth are found for transmitting k sub-flows divided from a data flow.
    Type: Grant
    Filed: July 28, 2016
    Date of Patent: October 16, 2018
    Assignee: National Tsing Hua University
    Inventors: Jang-Ping Sheu, Lee-Wei Liu
  • Publication number: 20180019940
    Abstract: A software-defined network (SDN) controller and a multipath routing method thereof are provided. In the method, a maximum bottleneck bandwidth (MBB) and a minimum hop count (MHC) of each of the nodes in the SDN are initiated. Next, a source node is visited, and neighboring nodes thereof are discovered to relax paths between the source node and each neighboring node. Then, a forwarding node having a maximum MBB among other nodes is visited, and its neighboring nodes which are connected therewith and unvisited are discovered to relax the paths between the forwarding node and each neighboring node. Afterwards, the rest of the nodes are consecutively visited until all nodes are visited. Finally, a disjoint path lookup table is established according to relation between the paths recorded for each node, and accordingly k disjoint paths having the maximum bottleneck bandwidth are found for transmitting k sub-flows divided from a data flow.
    Type: Application
    Filed: July 28, 2016
    Publication date: January 18, 2018
    Applicant: National Tsing Hua University
    Inventors: Jang-Ping Sheu, Lee-Wei Liu