Routing in hexagonal computer networks: How to present paths by Bloom filters without false positives.
Gokce Caylak KayaturanAlexei VernitskiPublished in: CEEC (2016)
Keyphrases
- computer networks
- false positives
- bloom filter
- shortest path
- false negative
- network nodes
- data structure
- record linkage
- false positive rate
- network security
- detection rate
- routing algorithm
- network management
- computer systems
- number of false positives
- ip addresses
- network traffic
- routing protocol
- true positive
- intrusion detection system
- communication networks
- link failure
- index structure
- false alarms
- ad hoc networks
- anomaly detection
- low false positive rate
- databases
- database
- machine learning
- tcp ip
- learning algorithm
- information systems
- training data
- knn