BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Source-sensitive routing - Matthieu Boutier (Université Paris Did
 erot - Paris 7) 
DTSTART:20140204T160000Z
DTEND:20140204T170000Z
UID:TALK50411@talks.cam.ac.uk
CONTACT:Eiko Yoneki
DESCRIPTION:In the current Internet\, packets are routed according to thei
 r destination\naddress only.  Source sensitive routing consist in routing 
 packets also\nconsidering their source address.  This is requiered in some
  cases in order\nto\nroute packets correctly.  It can also be used to prov
 ide alternate paths\,\nleading to better performance.  Internal multihomed
  networks are a good\nexample\nof both these applications.\n\nSource sensi
 tive routing requires a forwarding table able to match on\ndestination and
  source address to make its routing decision.  This makes it\npossible for
  an address to be matched by two different entries such that no\none\nis m
 ore specific than the other.  In that case\, the choice of which entry to\
 nuse\nis left to the FIB implementation of the routers\, which can lead to
 \ninconsistent\nresults on each router\, and even to persistent routing lo
 ops.\n\nThe solution I will present consists in installing additional rout
 ing\nentries in\nthe FIB such that for every address\, the set of routing 
 entries matching\nthat\naddress has a most specific one.  I will also disc
 uss changes in the routing\nprotocol\, especially interoperability problem
 s\, and show some results\nobtained\nwith our implementation in the Babel 
 routing protocol.\n\nBio:  see http://www.pps.univ-paris-diderot.fr/~bouti
 er/
LOCATION:FW26\, Computer Laboratory\, William Gates Builiding
END:VEVENT
END:VCALENDAR