Routing in hexagonal computer networks: How to present paths by Bloom filters without false positives

  title={Routing in hexagonal computer networks: How to present paths by Bloom filters without false positives},
  author={Gx00F6kx00E7e x00C7aylak Kayaturan and Alexei Vernitski},
  journal={2016 8th Computer Science and Electronic Engineering (CEEC)},
In this study it is introduced that the structure behind a random data structure called Bloom filter is applied to a routing scheme in a hexagonal grid in two dimensional case. The Bloom filter is a method to store the data in a very space efficiency and processing simplicity. We construct the Bloom filters for a complicated routing structure in a hexagonal mesh. It is aimed to obtain a fastest scheme without errors. A coding structure for the edges is developed to increase the efficiency use… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 27 references

A way of eliminating errors when using bloom filters for routing in computer networks

G. C. Kayaturan, A. Vernitski
Networks, ICN 2016. The Fifteenth International Conference on. IARIA, 2016, pp. 52– 57. • 2016
View 5 Excerpts
Highly Influenced

Space/Time Trade-offs in Hash Coding with Allowable Errors

Commun. ACM • 1970
View 4 Excerpts
Highly Influenced

Biff (Bloom filter) codes: Fast error correction for large data sets

2012 IEEE International Symposium on Information Theory Proceedings • 2012
View 1 Excerpt

Efficient Communication Algorithms in Hexagonal Mesh Interconnection Networks

IEEE Transactions on Parallel and Distributed Systems • 2012
View 1 Excerpt

Application of Bloom Filter in Grid Information Service

2010 International Conference on Multimedia Information Networking and Security • 2010
View 1 Excerpt

A Credential-Based Data Path Architecture for Assurable Global Networking

MILCOM 2007 - IEEE Military Communications Conference • 2007
View 1 Excerpt

A Performance Study of Deployment Factors in Wireless Mesh Networks

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications • 2007
View 1 Excerpt

Similar Papers

Loading similar papers…