TY - GEN
T1 - Aguri
T2 - 2nd COST 263 International Workshop on Quality of Future Internet Services, QofIS 2001
AU - Cho, Kenjiro
AU - Kaizaki, Ryo
AU - Kato, Akira
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2001
Y1 - 2001
N2 - Aguri is an aggregation-based traffic profiler targeted for near real-time, long-term, and wide-area traffic monitoring. Aguri adapts itself to spatial traffic distribution by aggregating small volume flows into aggregates, and achieves temporal aggregation by creating a summary of summaries applying the same algorithm to its outputs. A set of scripts are used for archiving and visualizing summaries in different time scales. Aguri does not need a predefined rule set and is capable of detecting an unexpected increase of unknown protocols or DoS attacks, which considerably simplifies the task of network monitoring. Once aggregates are identified and profiled, it becomes possible to make use of the profile records to control the aggregates in best-effort traffic. As a possible solution, we propose a technique to preferentially drop packets from aggregates whose volume is more than the fairshare. Our prototype implementation demonstrates its ability to protect the network from DoS attacks and to provide rough fairness among aggregates.
AB - Aguri is an aggregation-based traffic profiler targeted for near real-time, long-term, and wide-area traffic monitoring. Aguri adapts itself to spatial traffic distribution by aggregating small volume flows into aggregates, and achieves temporal aggregation by creating a summary of summaries applying the same algorithm to its outputs. A set of scripts are used for archiving and visualizing summaries in different time scales. Aguri does not need a predefined rule set and is capable of detecting an unexpected increase of unknown protocols or DoS attacks, which considerably simplifies the task of network monitoring. Once aggregates are identified and profiled, it becomes possible to make use of the profile records to control the aggregates in best-effort traffic. As a possible solution, we propose a technique to preferentially drop packets from aggregates whose volume is more than the fairshare. Our prototype implementation demonstrates its ability to protect the network from DoS attacks and to provide rough fairness among aggregates.
UR - http://www.scopus.com/inward/record.url?scp=84949963562&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84949963562&partnerID=8YFLogxK
U2 - 10.1007/3-540-45412-8_16
DO - 10.1007/3-540-45412-8_16
M3 - Conference contribution
AN - SCOPUS:84949963562
SN - 3540426027
SN - 9783540426028
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 222
EP - 242
BT - Quality of Future Internet Services - 2nd COST 263 International Workshop, QofIS 2001, Proceedings
A2 - Smirnov, Mikhail I.
A2 - Crowcroft, Jon
A2 - Roberts, James
A2 - Boavida, Fernando
PB - Springer Verlag
Y2 - 24 September 2001 through 26 September 2001
ER -