Optimized hash for network path encoding with minimized false positives-Reference-Cited by-同舟云学术

Optimized hash for network path encoding with minimized false positives

Published:2014-01 Issue: Volume:58 Page:180-191
ISSN:1389-1286
Container-title:Computer Networks
language:en
Short-container-title:Computer Networks

Author:

Carrea Laura,Vernitski Alexei,Reed Martin

Publisher

Elsevier BV

Subject

Computer Networks and Communications

Reference23 articles.

1. Space/time trade-offs in hash coding with allowable errors;Bloom;Communications of the ACM,1970

2. Network applications of Bloom filters: a survey;Broder;Internet Mathematics,2004

3. Theory and practice of Bloom filters for distributed systems;Tarkoma;IEEE Communications Surveys and Tutorials,2012

4. P. Jokela, A. Zahemszky, C.E. Rothenberg, S. Arianfar, P. Nikander, LIPSIN: line speed publish/subscribe inter-networking, in: ACM SIGCOMM ’09, Barcelona, Spain.

5. In-packet Bloom filters: design and networking applications;Rothenberg;Elsevier Computer Networks,2010

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decision-aided evaluation of paths for routing on multi-attribute computer network consisting of encoded paths under uncertainty;Expert Systems with Applications;2023-08

2. Encoding the Shortest Paths in a King's Graph;Fundamental Journal of Mathematics and Applications;2022-10-14

3. Preventing DDoS Flooding Attacks With Cryptographic Path Identifiers in Future Internet;IEEE Transactions on Network and Service Management;2022-06

4. DH-SVRF: A Reconfigurable Unicast/Multicast Forwarding for High-Performance Packet Forwarding Engines;IEEE Transactions on Parallel and Distributed Systems;2022-05-01

5. Optimizing Bloom Filter: Challenges, Solutions, and Comparisons;IEEE Communications Surveys & Tutorials;2019