杜鹃哈希中的入侵检测与防御实现(IDDI)

D. Seethalakshmi, Dr.G.M. Nasira
{"title":"杜鹃哈希中的入侵检测与防御实现(IDDI)","authors":"D. Seethalakshmi, Dr.G.M. Nasira","doi":"10.9790/0661-1903064952","DOIUrl":null,"url":null,"abstract":"The cuckoo hashing methodology completely avoids hash collisions. An insertion of a new item causes a failure and an endless loop when there are collisions in all probed positions till achieving the timeout status. To interrupt the countless loops, an intuitive manner is to carry out a complete rehash if this uncommon incident takes place. In practice, the high priced overhead of acting a rehashing operation can be dramatically decreased by using taking benefit of a very small extra regular-size space. In our proposed paper hashing involve collisions in which the stored buckets with one item will be reduced to probe the hash collision and query about the buckets. The enumerator that allocates each hash bucket will reduce the endless loops. As an accession we include intrusion detection and defense implementation (IDDI) that scrutinizes the hash and cache memory utilization efficiently. Cuckoo hashing is more prone to intrusion attack for which we alleviate such attacks by avoiding loops in buckets. Through detection and avoidance mechanism of intrusion we enhance the transmission in cuckoo hashing simultaneously by providing strong security towards its data.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Intrusion Detection and Defense Implementation (IDDI) in Cuckoo Hashing\",\"authors\":\"D. Seethalakshmi, Dr.G.M. Nasira\",\"doi\":\"10.9790/0661-1903064952\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The cuckoo hashing methodology completely avoids hash collisions. An insertion of a new item causes a failure and an endless loop when there are collisions in all probed positions till achieving the timeout status. To interrupt the countless loops, an intuitive manner is to carry out a complete rehash if this uncommon incident takes place. In practice, the high priced overhead of acting a rehashing operation can be dramatically decreased by using taking benefit of a very small extra regular-size space. In our proposed paper hashing involve collisions in which the stored buckets with one item will be reduced to probe the hash collision and query about the buckets. The enumerator that allocates each hash bucket will reduce the endless loops. As an accession we include intrusion detection and defense implementation (IDDI) that scrutinizes the hash and cache memory utilization efficiently. Cuckoo hashing is more prone to intrusion attack for which we alleviate such attacks by avoiding loops in buckets. Through detection and avoidance mechanism of intrusion we enhance the transmission in cuckoo hashing simultaneously by providing strong security towards its data.\",\"PeriodicalId\":91890,\"journal\":{\"name\":\"IOSR journal of computer engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IOSR journal of computer engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9790/0661-1903064952\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IOSR journal of computer engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9790/0661-1903064952","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

布谷鸟哈希方法完全避免了哈希冲突。当所有探测位置都存在冲突时,插入新项会导致失败和无限循环,直到达到超时状态。为了中断无数的循环,一种直观的方式是,如果发生这种不寻常的事件,就进行一次完全的重列。在实践中,通过利用非常小的额外规则大小的空间,可以显著降低执行散列操作的高昂开销。在我们提出的论文中,哈希涉及到碰撞,其中存储的具有一个项目的桶将被减少以探测哈希碰撞并查询桶。分配每个哈希桶的枚举器将减少无限循环。作为附加,我们包括入侵检测和防御实现(IDDI),它可以有效地检查哈希和缓存内存的使用情况。布谷鸟哈希法更容易受到入侵攻击,我们通过避免桶内循环来减轻这种攻击。通过检测和避免入侵的机制,同时增强了布谷鸟哈希算法的传输能力,为其数据提供了强大的安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Intrusion Detection and Defense Implementation (IDDI) in Cuckoo Hashing
The cuckoo hashing methodology completely avoids hash collisions. An insertion of a new item causes a failure and an endless loop when there are collisions in all probed positions till achieving the timeout status. To interrupt the countless loops, an intuitive manner is to carry out a complete rehash if this uncommon incident takes place. In practice, the high priced overhead of acting a rehashing operation can be dramatically decreased by using taking benefit of a very small extra regular-size space. In our proposed paper hashing involve collisions in which the stored buckets with one item will be reduced to probe the hash collision and query about the buckets. The enumerator that allocates each hash bucket will reduce the endless loops. As an accession we include intrusion detection and defense implementation (IDDI) that scrutinizes the hash and cache memory utilization efficiently. Cuckoo hashing is more prone to intrusion attack for which we alleviate such attacks by avoiding loops in buckets. Through detection and avoidance mechanism of intrusion we enhance the transmission in cuckoo hashing simultaneously by providing strong security towards its data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信