Kayaturan, Gokce Caylak and Vernitski, Alexei (2016) Routing in hexagonal computer networks: How to present paths by Bloom filters without false positives. In: 2016 8th Computer Science and Electronic Engineering (CEEC), 2016-09-28 - 2016-09-30.
Kayaturan, Gokce Caylak and Vernitski, Alexei (2016) Routing in hexagonal computer networks: How to present paths by Bloom filters without false positives. In: 2016 8th Computer Science and Electronic Engineering (CEEC), 2016-09-28 - 2016-09-30.
Kayaturan, Gokce Caylak and Vernitski, Alexei (2016) Routing in hexagonal computer networks: How to present paths by Bloom filters without false positives. In: 2016 8th Computer Science and Electronic Engineering (CEEC), 2016-09-28 - 2016-09-30.
Abstract
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 of network resources.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | Published proceedings: 2016 8th Computer Science and Electronic Engineering Conference, CEEC 2016 - Conference Proceedings |
| Uncontrolled Keywords: | Bloom filter; computer network; routing |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Science and Health Faculty of Science and Health > Mathematics, Statistics and Actuarial Science, School of |
| SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
| Depositing User: | Unnamed user with email elements@essex.ac.uk |
| Date Deposited: | 01 Mar 2017 16:50 |
| Last Modified: | 30 Oct 2024 20:29 |
| URI: | http://repository.essex.ac.uk/id/eprint/19185 |