-
-
Notifications
You must be signed in to change notification settings - Fork 58
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
First update of the 'recently finished flows' mechanism for tracking …
…the last 5 minutes of data.
- Loading branch information
1 parent
79fa1d4
commit 4a8be30
Showing
8 changed files
with
188 additions
and
30 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
152 changes: 152 additions & 0 deletions
152
src/rust/lqosd/src/throughput_tracker/flow_data/flow_analysis/finished_flows.rs
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,152 @@ | ||
| use super::{get_asn_name_and_country, FlowAnalysis}; | ||
| use crate::throughput_tracker::flow_data::FlowbeeRecipient; | ||
| use dashmap::DashMap; | ||
| use lqos_sys::flowbee_data::{FlowbeeData, FlowbeeKey}; | ||
| use once_cell::sync::Lazy; | ||
| use std::{ | ||
| collections::HashMap, | ||
| fmt::Debug, | ||
| sync::{Arc, Mutex}, | ||
| }; | ||
|
|
||
| struct TimeBuffer { | ||
| buffer: Mutex<Vec<TimeEntry>>, | ||
| } | ||
|
|
||
| struct TimeEntry { | ||
| time: u64, | ||
| data: (FlowbeeKey, FlowbeeData, FlowAnalysis), | ||
| } | ||
|
|
||
| impl TimeBuffer { | ||
| fn new() -> Self { | ||
| Self { | ||
| buffer: Mutex::new(Vec::new()), | ||
| } | ||
| } | ||
|
|
||
| fn expire_over_five_minutes(&self) { | ||
| let now = std::time::SystemTime::now() | ||
| .duration_since(std::time::UNIX_EPOCH) | ||
| .unwrap() | ||
| .as_secs(); | ||
| let mut buffer = self.buffer.lock().unwrap(); | ||
| buffer.retain(|v| now - v.time < 300); | ||
| } | ||
|
|
||
| fn push(&self, entry: TimeEntry) { | ||
| let mut buffer = self.buffer.lock().unwrap(); | ||
| buffer.push(entry); | ||
| } | ||
|
|
||
| fn country_summary(&self) -> Vec<(String, [u64; 2], [f32; 2])> { | ||
| let buffer = self.buffer.lock().unwrap(); | ||
| let mut my_buffer = buffer | ||
| .iter() | ||
| .map(|v| { | ||
| let (_key, data, analysis) = &v.data; | ||
| let (_name, country) = get_asn_name_and_country(analysis.asn_id.0); | ||
| let rtt = [ | ||
| (data.last_rtt[0] / 1000000) as f32, | ||
| (data.last_rtt[1] / 1000000) as f32, | ||
| ]; | ||
| (country, data.bytes_sent, rtt) | ||
| }) | ||
| .collect::<Vec<(String, [u64; 2], [f32; 2])>>(); | ||
|
|
||
| // Sort by country | ||
| my_buffer.sort_by(|a, b| a.0.cmp(&b.0)); | ||
|
|
||
| // Summarize by country | ||
| let mut country_summary = Vec::new(); | ||
| let mut last_country = String::new(); | ||
| let mut total_bytes = [0, 0]; | ||
| let mut total_rtt = [0.0f64, 0.0f64]; | ||
| let mut rtt_count = [0, 0]; | ||
| for (country, bytes, rtt) in my_buffer { | ||
| if last_country != country { | ||
| if !last_country.is_empty() { | ||
| // Store the country | ||
| let rtt = [ | ||
| if total_rtt[0] > 0.0 { | ||
| (total_rtt[0] / rtt_count[0] as f64) as f32 | ||
| } else { | ||
| 0.0 | ||
| }, | ||
| if total_rtt[1] > 0.0 { | ||
| (total_rtt[1] / rtt_count[1] as f64) as f32 | ||
| } else { | ||
| 0.0 | ||
| }, | ||
| ]; | ||
|
|
||
| country_summary.push((last_country, total_bytes, rtt)); | ||
| } | ||
|
|
||
| last_country = country.to_string(); | ||
| total_bytes = [0, 0]; | ||
| total_rtt = [0.0, 0.0]; | ||
| rtt_count = [0, 0]; | ||
| } | ||
| total_bytes[0] += bytes[0]; | ||
| total_bytes[1] += bytes[1]; | ||
| total_rtt[0] += rtt[0] as f64; | ||
| total_rtt[1] += rtt[1] as f64; | ||
| rtt_count[0] += 1; | ||
| rtt_count[1] += 1; | ||
| } | ||
|
|
||
| // Store the last country | ||
| let rtt = [ | ||
| if total_rtt[0] > 0.0 { | ||
| (total_rtt[0] / rtt_count[0] as f64) as f32 | ||
| } else { | ||
| 0.0 | ||
| }, | ||
| if total_rtt[1] > 0.0 { | ||
| (total_rtt[1] / rtt_count[1] as f64) as f32 | ||
| } else { | ||
| 0.0 | ||
| }, | ||
| ]; | ||
|
|
||
| country_summary.push((last_country, total_bytes, rtt)); | ||
|
|
||
| // Sort by bytes descending | ||
| country_summary.sort_by(|a, b| b.1[0].cmp(&a.1[0])); | ||
|
|
||
| country_summary | ||
| } | ||
| } | ||
|
|
||
| static RECENT_FLOWS: Lazy<TimeBuffer> = Lazy::new(|| TimeBuffer::new()); | ||
|
|
||
| pub struct FinishedFlowAnalysis {} | ||
|
|
||
| impl FinishedFlowAnalysis { | ||
| pub fn new() -> Arc<Self> { | ||
| log::debug!("Created Flow Analysis Endpoint"); | ||
|
|
||
| std::thread::spawn(|| loop { | ||
| RECENT_FLOWS.expire_over_five_minutes(); | ||
| std::thread::sleep(std::time::Duration::from_secs(60 * 5)); | ||
| }); | ||
|
|
||
| Arc::new(Self {}) | ||
| } | ||
| } | ||
|
|
||
| impl FlowbeeRecipient for FinishedFlowAnalysis { | ||
| fn enqueue(&self, key: FlowbeeKey, data: FlowbeeData, analysis: FlowAnalysis) { | ||
| log::info!("Finished flow analysis"); | ||
| RECENT_FLOWS.push(TimeEntry { | ||
| time: std::time::SystemTime::now() | ||
| .duration_since(std::time::UNIX_EPOCH) | ||
| .unwrap() | ||
| .as_secs(), | ||
| data: (key, data, analysis), | ||
| }); | ||
|
|
||
| println!("{:?}", RECENT_FLOWS.country_summary()); | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters