Accelerating the shortest path problem

Multiplex communications – Pathfinding or routing – Through a circuit switch

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S382000

Reexamination Certificate

active

07457286

ABSTRACT:
The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

REFERENCES:
patent: 6011795 (2000-01-01), Varghese et al.
patent: 6289096 (2001-09-01), Suzuki
patent: 6356911 (2002-03-01), Shibuya
patent: 6370119 (2002-04-01), Basso et al.
patent: 6529498 (2003-03-01), Cheng
patent: 6633880 (2003-10-01), Modelski et al.
patent: 7047317 (2006-05-01), Huie et al.
“Single Source Shortest Path (SSSP) Problem”, http://www.cs.rochester.edu/users/faculty
elson/courses/csc—173/graphs/sssp.html, downloaded Mar. 16, 2003, 3 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Accelerating the shortest path problem does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Accelerating the shortest path problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Accelerating the shortest path problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4020867

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.