{"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}
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.