![]() | |||||||||||||
Messages in this thread |
Hi, I needed a hash function (in my TCP related work) for a project and happened to look at the function used by TCP implementation in Linux. I searched for some information about this function but couldn't find much info. I would appreciate it if someone can provide details or some pointers in this regard. Specifically, 1) Are there some design considerations/assumptions behind the algorithm? In general, how was the algorithm arrived at? 2) What happens if there are collisions? I am assuming that each entry in the array will point to a linked list of structures. Is there any limit on the length of this list? I hope it is ok to post questions like these on this list. Please also CC me as I am not subscribed (at this point). Thanks, Raghu. __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/ | ||||||||||||
| Last update: 2006-05-31 06:32 [W:7.467 / U:0.080 seconds] ©2003-2008 Jasper Spaans | |||||||||||||