Patents by Inventor Dimitrios Dechouniotis

Dimitrios Dechouniotis 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).

  • Valley-free shortest path method
    Patent number: 7907596
    Abstract: A method of calculating a valley-free shortest path between two autonomous systems having a first graph representing an autonomous system topology and comprising a plurality of nodes and a plurality of links interconnecting the nodes, each link linking a first and a second node of the plurality of nodes. The method comprises generating a second graph using the first graph by: Mapping the nodes of the first graph into the second graph, by representing each node of the first graph by a respective uphill node and a downhill node; mapping each link of the first, second and third relationship type with a plurality of directed links between the uphill and downhill nodes according to the type of relationship. The method further comprises calculating the shortest-path route between two autonomous systems on the second graph, using the shortest-path routing algorithm.
    Type: Grant
    Filed: December 1, 2008
    Date of Patent: March 15, 2011
    Assignee: International Business Machines Corporation
    Inventors: Daniel Nikolaus Bauer, Dimitrios Dechouniotis, Christos-Xenofontas Dimitropoulos, Andreas Kind
  • VALLEY-FREE SHORTEST PATH METHOD
    Publication number: 20090141637
    Abstract: A method of calculating a valley-free shortest path between two autonomous systems having a first graph representing an autonomous system topology and comprising a plurality of nodes and a plurality of links interconnecting the nodes, each link linking a first and a second node of the plurality of nodes. The method comprises generating a second graph using the first graph by: Mapping the nodes of the first graph into the second graph, by representing each node of the first graph by a respective uphill node and a downhill node; mapping each link of the first, second and third relationship type with a plurality of directed links between the uphill and downhill nodes according to the type of relationship. The method further comprises calculating the shortest-path route between two autonomous systems on the second graph, using the shortest-path routing algorithm.
    Type: Application
    Filed: December 1, 2008
    Publication date: June 4, 2009
    Applicant: International Business Machines Corporation
    Inventors: Daniel Nikolaus Bauer, Dimitrios Dechouniotis, Christos-Xenofontas Dimitropoulos, Andreas Kind