Finding widespread events in a distributed network is crucial when detecting cyber-attacks or network malfunctions. We propose a new detection scheme for widespread events based on bitmaps that can succinctly record and deliver event information between monitoring agents and a central coordinator. Our proposed scheme reduces communication overhead as well as total number of rounds, and achieves even higher accuracy, compared with the current state of the art.
Syed Moeen Ali NAQVI
Kookmin University
MyungKeun YOON
Kookmin University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Syed Moeen Ali NAQVI, MyungKeun YOON, "Finding Widespread Events with Simple Bitmaps" in IEICE TRANSACTIONS on Information,
vol. E101-D, no. 12, pp. 3246-3248, December 2018, doi: 10.1587/transinf.2018EDL8127.
Abstract: Finding widespread events in a distributed network is crucial when detecting cyber-attacks or network malfunctions. We propose a new detection scheme for widespread events based on bitmaps that can succinctly record and deliver event information between monitoring agents and a central coordinator. Our proposed scheme reduces communication overhead as well as total number of rounds, and achieves even higher accuracy, compared with the current state of the art.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2018EDL8127/_p
Copy
@ARTICLE{e101-d_12_3246,
author={Syed Moeen Ali NAQVI, MyungKeun YOON, },
journal={IEICE TRANSACTIONS on Information},
title={Finding Widespread Events with Simple Bitmaps},
year={2018},
volume={E101-D},
number={12},
pages={3246-3248},
abstract={Finding widespread events in a distributed network is crucial when detecting cyber-attacks or network malfunctions. We propose a new detection scheme for widespread events based on bitmaps that can succinctly record and deliver event information between monitoring agents and a central coordinator. Our proposed scheme reduces communication overhead as well as total number of rounds, and achieves even higher accuracy, compared with the current state of the art.},
keywords={},
doi={10.1587/transinf.2018EDL8127},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - Finding Widespread Events with Simple Bitmaps
T2 - IEICE TRANSACTIONS on Information
SP - 3246
EP - 3248
AU - Syed Moeen Ali NAQVI
AU - MyungKeun YOON
PY - 2018
DO - 10.1587/transinf.2018EDL8127
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E101-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2018
AB - Finding widespread events in a distributed network is crucial when detecting cyber-attacks or network malfunctions. We propose a new detection scheme for widespread events based on bitmaps that can succinctly record and deliver event information between monitoring agents and a central coordinator. Our proposed scheme reduces communication overhead as well as total number of rounds, and achieves even higher accuracy, compared with the current state of the art.
ER -