aqt_sim 0.1.0

Adverserial Queueing Theory (AQT) simulator
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28

//! This module contains stochastic adversaries which work on a path network.

use rand::Rng;
use crate::packet::{ Packet, PacketFactory };
use crate::network::{ Network, NodeID };
use super::Adversary;


/// A single-destination path random adversary, which injects one packet per round into a random 
/// buffer on the path.
pub struct SDPathRandomAdversary {
    factory: PacketFactory,
}

impl Adversary for SDPathRandomAdversary {
    fn new() -> Self {
        SDPathRandomAdversary { factory: PacketFactory::new() }
    }

    fn get_next_packets(&mut self, network: &Network, rd: usize) -> Vec<Packet> {
        let dest_id: NodeID = network.get_num_nodes()-1;
        let mut rng = rand::thread_rng();
        let src_id: NodeID = rng.gen_range(0..dest_id-1);
        println!("Injecting into {}", src_id);
        let p = self.factory.create_packet((0..dest_id+1).collect(), rd, src_id);
        vec![p]
    }
}