Kayaturan, GÇ and Vernitski, A (2017) Routing in hexagonal computer networks: How to present paths by bloom filters without false positives. In: UNSPECIFIED, ? - ?.

Full text not available from this repository.

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
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	Faculty of Science and Health > Mathematical Sciences, Department of
Depositing User:	Jim Jamieson
Date Deposited:	01 Mar 2017 16:50
Last Modified:	30 Mar 2021 19:15
URI:	http://repository.essex.ac.uk/id/eprint/19185

Actions (login required)

View Item