Multiplex communications – Pathfinding or routing
Reexamination Certificate
2006-08-30
2009-08-11
Yao, Kwang B (Department: 2416)
Multiplex communications
Pathfinding or routing
C370S229000
Reexamination Certificate
active
07573866
ABSTRACT:
A method finds an optimal path from a source to a destination. The possible paths from the source to the destination are represented as a stochastic graph of nodes connected by edges. Each edge has an independent probability distribution over a cost of the edge. A constraint for reaching the destination is defined. The graph is reduced to a relatively small set of deterministic minimum cost problems, which can be solved to determine an optimal path that maximizes a probability of reaching the destination within the constraint.
REFERENCES:
patent: 6067572 (2000-05-01), Jensen et al.
patent: 7391732 (2008-06-01), Cortez et al.
Nielsen, “Route Choice in Stochastic Time-Dependent Networks”, Ph.D. Thesis, Dec. 2003, ISSN 1600-8987, University of Aarhus, Department of Mathematical Science, as accessed via Internet on Feb. 19, 2009.
Nielsen: “Route choice in stochastic time-dependent networks,” Dec. 2003.
Mirchandani et. al.: “Routing with nonlinear multiattribute cost function,” Mar. 1993.
Mirchandani et. al.: “Locations of medians on stochastic networks,” Oct. 1977.
Brand Matthew E.
Mitzenmacher Michael
Nikolova Evdokia V.
Brinkman Dirk
Lai Andrew
Mitsubishi Electric Research Laboratories Inc.
Vinokur Gene
Yao Kwang B
LandOfFree
Method for finding optimal paths using a stochastic network... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for finding optimal paths using a stochastic network..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for finding optimal paths using a stochastic network... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4083833