BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Finding best paths in difficult conditions - Alex Gurney
DTSTART:20101101T124500Z
DTEND:20101101T140000Z
UID:TALK27802@talks.cam.ac.uk
CONTACT:Peter Sewell
DESCRIPTION:We know and love shortest-path algorithms. But these only\nrep
 resent the most well-behaved corner of a wide class of methods\nfor findin
 g "good" paths. The current and future Internet gives\nexamples of the rem
 ainder of this class\, but at the same time\,\nshows that correct solution
 s can sometimes be obtained even in \nthese adverse conditions.\n\nThis ta
 lk will present work on the correctness of a best-path\nalgorithm that has
  the following characteristics: \n\n* Asynchronously safe\; tolerant of fa
 ir message loss and\n  reordering\, but always converging to a unique fixe
 d point.\n* Can find multiple best paths for each source-destination pair.
 \n* Allows arbitrary filtering of disallowed paths.\n* Allows neighbours t
 o have incompatible preferences (so the fixed   point is a Nash equilibriu
 m rather than a global optimum).\n* Allows per-adjacency refinements to pa
 th preferences.\n\nOn the down side\, there is no a priori upper bound on 
 execution time without making additional restrictions.\n
LOCATION:Room FW26\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR