optimal xor hashing for a linearly distributed address lookup.pptVIP

下载本文档

0
0
约3.61千字
约 22页
2016-03-05 发布于广东
举报
版权申诉

optimal xor hashing for a linearly distributed address lookup.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

optimal xor hashing for a linearly distributed address lookup

Optimal XOR Hashing for a Linearly Distributed Address Lookup in Computer Networks Christopher Martinez, Wei-Ming Lin, Parimal Patel The University of Texas at San Antonio October 28, 2005 Outline Motivation Hashing Background Linear Distribution Optimal Hashing Simulation Conclusion Motivation All network applications require some searching Switches, routers and intrusion detection systems require the searching of IP address or subnet IDs Searching should be based on distribution of the records in the database For computer networks, searching needs to be real-time Motivation (cont.) A capture of network traffic shows the non-uniform distribution of IP type C addresses Since IP address entering the network are non-uniform then searching should take this into account Hashing Background Straightforward sequential searching impractical for large databases Hashing reduces the database into small subsets Searching subsets reduces search time Predictable time needed for real-time applications Hashing Background Hashing algorithms are well research, we look to provide new insight base on the probability distribution This work is not concern about collision, each hashing key will have the same number of collision in a link list Hashing using probability background should limit the average number of searches in the link list Hashing: Non-uniform Distribution Linear Distribution From our capture network traffic we can approximate the non-uniform distribution by a linear probability distribution function XOR Hashing For Linear Distribution We wanted a straightforward hashing scheme that can be used for any size database and hashing space Define the hashing function as P=(gm-1,gm-2,…,g0) Measure hashing functions against each other by the value δ δ measure how close to uniform the hashing creates XOR Hashing for Linear Distribution4-bit to 2-bit Example XOR Hashing for Linear Distribution4-bit to 2-bit Example XOR Hashing for Linear Distribution4-bit to 2-bit Example XOR Has