A Way of Eliminating Errors When Using Bloom Filters for Routing in Computer Networks

A Bloom filter is a data type for storing sets. It can be considered as a data compression technique, but its more important feature is an extremely fast access to stored data. This is why it can be useful when calculation needs to be performed very quickly, for example, in an application to routing messages in a computer network. A well-known shortcoming of a Bloom filter are errors in the stored data. We present a way of labeling links in a computer network which prevents errors in Bloom filters in some routing scenarios and, therefore, results in a more efficient use of network resources