BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A Heuristic and Hybrid Hash-based Approach to Fast Lookup - Gianni
  Antichi (University of Pisa)
DTSTART:20100513T150000Z
DTEND:20100513T160000Z
UID:TALK24758@talks.cam.ac.uk
CONTACT:Eiko Yoneki
DESCRIPTION:IP address lookup is a fundamental task for Internet routers. 
 Because of the rapid growth of both traffic and links capacity\, the time 
 budget to process a packet continues to decrease and lookup tables unceasi
 ngly grow\; therefore\, new algorithms are required to improve lookup perf
 ormance. However\, the large density disparity on the prefix range within 
 real lookup tables suggests a hybrid adaptive technique as effective and s
 imple solution. Therefore\, this talk presents a novel approach in which v
 arious prefix length ranges are represented with distinct data structures 
 and stored in different memories. In this way\, the different frequencies 
 of forwarding rules can be taken in account and the memory hierarchy of re
 al platforms can be exploited. This leads to small structures to be put in
  fast memory for the most dense ranges and larger structures (with a lower
  number of accesses) in the slower memories for the other ranges. The resu
 lts remark the low number of off-chip memory accesses of our scheme and a 
 valuable speedup.\n\nBio: Gianni Antichi received his Laurea degree in Tel
 ecommunication Engineering on September 2007 from University of Pisa\, by 
 discussing a thesis on "BRUNO: A High Performance Traffic Generator on Net
 work Processor".\nIn January 2008 he entered\, as PhD student\, the Depart
 ment of Information Engineering at the University of Pisa\, where he is cu
 rrently doing research in the area of Next Generation Networks using FPGA 
 and Network Processors.  \n
LOCATION:FW26\, Computer Laboratory\, William Gates Builiding
END:VEVENT
END:VCALENDAR