Patents by Inventor Borgert Jan van der Kluit

Borgert Jan van der Kluit 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).

  • Search for disjoint paths through a network
    Patent number: 10938708
    Abstract: A path discovery process is provided for discovering a lowest cost combination of a plurality of paths from the source node to the destination node via links between pairs of nodes along the paths. A path discovery messages from a source node is forwarded through the network. Prior to forwarding the path discovery message a node tests one or more conditions for disabling the forwarding. Upon receiving an instance of the path discovery message, this may include testing whether no other instance of the path discovery message has both smaller cost and a previous path that contains only nodes that occur also in the path of the received instance. Furthermore, this may include testing whether a destination of the path discovery message was also a node to which a preceding node along the path has a further link, and a cost of the path from the preceding node to the next node via said further link is not larger than the cost of the path from the preceding node to the next node.
    Type: Grant
    Filed: September 7, 2015
    Date of Patent: March 2, 2021
    Assignee: K.Mizra LLC
    Inventors: Borgert Jan van der Kluit, Adrianus Cornelis Gerardus Holtzer, Bart Michel Magdalena Gijsen, Hendrik Bernard Meeuwissen
  • SEARCH FOR DISJOINT PATHS THROUGH A NETWORK
    Publication number: 20170295088
    Abstract: A path discovery process is provided for discovering a lowest cost combination of a plurality of paths from the source node to the destination node via links between pairs of nodes along the paths. A path discovery messages from a source node is forwarded through the network. Prior to forwarding the path discovery message a node tests one or more conditions for disabling the forwarding. Upon receiving an instance of the path discovery message, this may include testing whether no other instance of the path discovery message has both smaller cost and a previous path that contains only nodes that occur also in the path of the received instance. Furthermore, this may include testing whether a destination of the path discovery message was also a node to which a preceding node along the path has a further link, and a cost of the path from the preceding node to the next node via said further link is not larger than the cost of the path from the preceding node to the next node.
    Type: Application
    Filed: September 7, 2015
    Publication date: October 12, 2017
    Applicant: Nederlandse Organisatie voor Toegepast-natuurwetenschappelijk onderzoek TNO
    Inventors: Borgert Jan van der Kluit, Adrianus Cornelis Gerardus Holtzer, Bart Michel Magdalena Gijsen, Hendrik Bernard Meeuwissen