In Vaccine every node uses an infinite data structure to keep track of the delivered packets and inform other network nodes. This approach is rather unrealistic. We have to implement a new version of Vaccine that will use a data structure of finite size. In this case, new update methods should be implemented, e.g., how to discard packet entries when the data structure is full. A good idea is to use one or more bloom filter(s) (take advantage of the low cost read/write operations) to store this information.
In Vaccine every node uses an infinite data structure to keep track of the delivered packets and inform other network nodes. This approach is rather unrealistic. We have to implement a new version of Vaccine that will use a data structure of finite size. In this case, new update methods should be implemented, e.g., how to discard packet entries when the data structure is full. A good idea is to use one or more bloom filter(s) (take advantage of the low cost read/write operations) to store this information.