bgpsim 0.20.4

A network control-plane 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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
// BgpSim: BGP Network Simulator written in Rust
// Copyright 2022-2024 Tibor Schneider <sctibor@ethz.ch>
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

//! Testcase for forwarding state that appeared while Roland Schmid was using bgpsim.

use std::collections::HashSet;
use std::iter::repeat_n;

use crate::{
    builder::*,
    event::{EventQueue, ModelParams, SimpleTimingModel},
    interactive::InteractiveNetwork,
    network::Network,
    ospf::global::GlobalOspf,
    policies::{FwPolicy, Policy},
    record::{ConvergenceRecording, ConvergenceTrace, RecordNetwork},
    topology_zoo::TopologyZoo,
    types::{SinglePrefix as P, StepUpdate, ASN},
};

use pretty_assertions::assert_eq;

#[test]
fn roland_pacificwave() {
    // generate the network precisely as roland did:
    let queue = SimpleTimingModel::<P>::new(ModelParams::new(1.0, 1.0, 2.0, 5.0, 0.5));
    let mut net = TopologyZoo::Pacificwave.build(queue, ASN(65500), ASN(1));
    let prefix = P::from(1);

    // Make sure that at least 3 external routers exist
    let _external_routers = net
        .build_external_routers(ASN(65500), ASN(1), HighestDegreeRouters::new(3))
        .unwrap();
    // create a route reflection topology with the two route reflectors of the highest degree
    let route_reflectors = net
        .build_ibgp_route_reflection(HighestDegreeRouters::new(2))
        .unwrap();
    // setup all external bgp sessions
    net.build_ebgp_sessions().unwrap();
    // create random link weights between 10 and 100
    net.build_link_weights(UniformWeights::new(10.0, 100.0))
        .unwrap();
    // advertise 3 routes with unique preferences for a single prefix
    let advertisements = net
        .build_advertisements(
            prefix,
            UniquePreference::new().internal_asn(ASN(65500)),
            ASN(0),
        )
        .unwrap();

    // create the policies
    let policies = Vec::from_iter(
        route_reflectors
            .into_values()
            .flatten()
            .map(|r| FwPolicy::LoopFree(r, prefix)),
    );

    let most_preferred = advertisements.iter().min_by_key(|(_, x)| *x).unwrap().0;

    // record the event 1_000 times
    for _ in 0..1_000 {
        // clone the network
        let mut net = net.clone();

        // simulate the event
        let mut recording = net
            .record(|net| net.withdraw_route(most_preferred, prefix))
            .unwrap();

        // check the initial state
        let state = recording.state();
        policies.iter().for_each(|p| {
            let _ = p.check(state);
        });

        while let Some((_, _, state)) = recording.step() {
            policies.iter().for_each(|p| {
                let _ = p.check(state);
            });
        }
    }
}

#[test]
fn roland_pacificwave_manual() {
    // generate the network precisely as roland did:
    let queue = SimpleTimingModel::<P>::new(ModelParams::new(1.0, 1.0, 2.0, 5.0, 0.5));
    let mut net: Network<_, _, GlobalOspf> =
        TopologyZoo::Pacificwave.build(queue, ASN(65500), ASN(1));
    let prefix = P::from(1);

    // Make sure that at least 3 external routers exist
    let _external_routers = net
        .build_external_routers(ASN(65500), ASN(1), HighestDegreeRouters::new(3))
        .unwrap();
    // create a route reflection topology with the two route reflectors of the highest degree
    let route_reflectors = net
        .build_ibgp_route_reflection(HighestDegreeRouters::new(2))
        .unwrap();
    // setup all external bgp sessions
    net.build_ebgp_sessions().unwrap();
    // create random link weights between 10 and 100
    net.build_link_weights(UniformWeights::new(10.0, 100.0))
        .unwrap();
    // advertise 3 routes with unique preferences for a single prefix
    let advertisements = net
        .build_advertisements(
            prefix,
            UniquePreference::new().internal_asn(ASN(65500)),
            ASN(0),
        )
        .unwrap();

    // create the policies
    let policies = Vec::from_iter(
        route_reflectors
            .into_values()
            .flatten()
            .map(|r| FwPolicy::LoopFree(r, prefix)),
    );

    // create a copy of the net
    let mut t = net.clone();

    // get the forwarding state before
    let fw_state_before = t.get_forwarding_state();

    let most_preferred = advertisements.iter().min_by_key(|(_, x)| *x).unwrap().0;

    // execute the event
    t.manual_simulation();
    t.withdraw_route(most_preferred, prefix).unwrap();

    // compute the fw state diff
    let fw_state_after = t.get_forwarding_state();
    let diff = fw_state_before.diff(&fw_state_after);

    // construct the trace
    let trace = vec![(diff, Some(0.0).into())];

    let mut fw_state = net.get_forwarding_state();
    let fw_state_ref = net.get_forwarding_state();

    let t0 = net.queue().get_time().unwrap_or_default();

    // record the event 1_000 times
    for i in 0..1_000 {
        println!("iteration {i}");
        assert_eq!(fw_state, fw_state_ref);
        // clone the network
        let mut t = t.clone();
        let mut trace = trace.clone();

        // simulate the event
        while let Some((step, event)) = t.simulate_step().unwrap() {
            match step {
                StepUpdate::Unchanged => {}
                StepUpdate::Multiple => unreachable!("OSPF events should be disabled"),
                StepUpdate::Single(delta) => {
                    trace.push((
                        vec![(event.router(), delta.old, delta.new)],
                        net.queue().get_time().map(|x| x - t0).into(),
                    ));
                }
            }
        }

        let mut recording = ConvergenceRecording::new(fw_state, trace);

        // check the initial state
        let state = recording.state();
        policies.iter().for_each(|p| {
            let _ = p.check(state);
        });

        while let Some((_, _, state)) = recording.step() {
            policies.iter().for_each(|p| {
                let _ = p.check(state);
            });
        }

        // undo the recording
        fw_state = recording.into_initial_fw_state();
    }
}

#[test]
fn roland_arpanet() {
    // generate the network precisely as roland did:
    let queue = SimpleTimingModel::<P>::new(ModelParams::new(1.0, 1.0, 2.0, 5.0, 0.5));
    let mut net = TopologyZoo::Arpanet196912.build(queue, ASN(65500), ASN(1));
    let prefix = P::from(1);

    // Make sure that at least 3 external routers exist
    let _external_routers = net
        .build_external_routers(ASN(65500), ASN(1), HighestDegreeRouters::new(3))
        .unwrap();
    // create a route reflection topology with the two route reflectors of the highest degree
    let route_reflectors = net
        .build_ibgp_route_reflection(HighestDegreeRouters::new(2))
        .unwrap();
    // setup all external bgp sessions
    net.build_ebgp_sessions().unwrap();
    // create random link weights between 10 and 100
    net.build_link_weights(UniformWeights::new(10.0, 100.0))
        .unwrap();
    // advertise 3 routes with unique preferences for a single prefix
    let advertisements = net
        .build_advertisements(
            prefix,
            UniquePreference::new().internal_asn(ASN(65500)),
            ASN(0),
        )
        .unwrap();

    // create the policies
    let policies = Vec::from_iter(
        route_reflectors
            .into_values()
            .flatten()
            .map(|r| FwPolicy::LoopFree(r, prefix)),
    );

    let most_preferred = advertisements.iter().min_by_key(|(_, x)| *x).unwrap().0;

    // record the event 1_000 times
    for _ in 0..1_000 {
        // clone the network
        let mut net = net.clone();

        // simulate the event
        let mut recording = net
            .record(|net| net.withdraw_route(most_preferred, prefix))
            .unwrap();

        // check the initial state
        let state = recording.state();
        policies.iter().for_each(|p| {
            let _ = p.check(state);
        });

        while let Some((_, _, state)) = recording.step() {
            policies.iter().for_each(|p| {
                let _ = p.check(state);
            });
        }
    }
}

#[test]
fn roland_arpanet_manual() {
    // generate the network precisely as roland did:
    let queue = SimpleTimingModel::<P>::new(ModelParams::new(1.0, 1.0, 2.0, 5.0, 0.5));
    let mut net: Network<_, _, GlobalOspf> =
        TopologyZoo::Arpanet196912.build(queue, ASN(65500), ASN(1));
    let prefix = P::from(0);

    // Make sure that at least 3 external routers exist
    let _external_routers = net
        .build_external_routers(ASN(65500), ASN(1), HighestDegreeRouters::new(3))
        .unwrap();
    // create a route reflection topology with the two route reflectors of the highest degree
    let route_reflectors = net
        .build_ibgp_route_reflection(HighestDegreeRouters::new(2))
        .unwrap();
    // setup all external bgp sessions
    net.build_ebgp_sessions().unwrap();
    // create random link weights between 10 and 100
    net.build_link_weights(UniformWeights::new(10.0, 100.0))
        .unwrap();
    // advertise 3 routes with unique preferences for a single prefix
    let advertisements = net
        .build_advertisements(
            prefix,
            UniquePreference::new().internal_asn(ASN(65500)),
            ASN(0),
        )
        .unwrap();

    // create the policies
    let policies = Vec::from_iter(
        route_reflectors
            .into_values()
            .flatten()
            .map(|r| FwPolicy::LoopFree(r, prefix)),
    );

    // create a copy of the net
    let mut t = net.clone();

    // enable manual simulation
    t.manual_simulation();

    // get the forwarding state before
    let fw_state_before = t.get_forwarding_state();

    let most_preferred = advertisements.iter().min_by_key(|(_, x)| *x).unwrap().0;

    // execute the event
    t.withdraw_route(most_preferred, prefix).unwrap();

    // compute the fw state diff
    let fw_state_after = t.get_forwarding_state();
    let diff = fw_state_before.diff(&fw_state_after);

    let t0 = t.queue().get_time().unwrap_or_default();

    // construct the trace
    let trace = vec![(diff, Some(0.0).into())];

    let mut fw_state = net.get_forwarding_state();
    let fw_state_ref = net.get_forwarding_state();

    // record the event 1_000 times
    for i in 0..1_000 {
        println!("iteration {i}");
        assert_eq!(fw_state, fw_state_ref);
        // clone the network
        let mut t = t.clone();
        let mut trace = trace.clone();

        // simulate the event
        while let Some((step, event)) = t.simulate_step().unwrap() {
            match step {
                StepUpdate::Unchanged => {}
                StepUpdate::Multiple => unreachable!("OSPF events should be disabled"),
                StepUpdate::Single(delta) => {
                    trace.push((
                        vec![(event.router(), delta.old, delta.new)],
                        net.queue().get_time().map(|x| x - t0).into(),
                    ));
                }
            }
        }

        let mut recording = ConvergenceRecording::new(fw_state, trace);

        // check the initial state
        let state = recording.state();
        policies.iter().for_each(|p| {
            let _ = p.check(state);
        });

        while recording.step().is_some() {
            policies.iter().for_each(|p| {
                let _ = p.check(recording.state());
            });
        }

        // go back
        while recording.back().is_some() {}

        // undo the recording
        fw_state = recording.into_initial_fw_state();
    }
}

#[test]
fn roland_arpanet_complete() {
    // setup basic timing model
    let queue = SimpleTimingModel::<P>::new(ModelParams::new(
        1.0, // offset: 1.0,
        1.0, // scale: 1.0,
        2.0, // alpha: 2.0,
        5.0, // beta: 5.0,
        0.5, // collision: 0.5,
    ));

    let prefix = P::from(0);

    let topology = TopologyZoo::Arpanet196912;

    let mut net = topology.build(queue, ASN(65500), ASN(1));

    // Make sure that at least 3 external routers exist
    let _external_routers = net
        .build_external_routers(ASN(65500), ASN(1), HighestDegreeRouters::new(3))
        .unwrap();
    // create a route reflection topology with the two route reflectors of the highest degree
    let route_reflectors = net
        .build_ibgp_route_reflection(HighestDegreeRouters::new(2))
        .unwrap();
    // setup all external bgp sessions
    net.build_ebgp_sessions().unwrap();
    // create random link weights between 10 and 100
    net.build_link_weights(UniformWeights::new(10.0, 100.0))
        .unwrap();
    // advertise 3 routes with unique preferences for a single prefix
    let advertisements = net
        .build_advertisements(
            prefix,
            UniquePreference::new().internal_asn(ASN(65500)),
            ASN(0),
        )
        .unwrap();

    // start simulation of withdrawal of the preferred route

    let iters = 1_000;
    let workers = 1;

    // Sample message orderings without copying the forwarding state
    let mut t = net.clone();
    t.manual_simulation();

    let t0 = t.queue().get_time().unwrap_or_default();

    // get the forwarding state before
    let fw_state_before = t.get_forwarding_state();

    let most_preferred = advertisements.iter().min_by_key(|(_, x)| *x).unwrap().0;

    // execute the function
    t.withdraw_route(most_preferred, prefix).unwrap();

    // get the forwarding state difference and start generating the trace
    let fw_state_after = t.get_forwarding_state();
    let diff = fw_state_before.diff(&fw_state_after);

    let trace = vec![(diff, Some(0.0).into())];

    let sample_func = |(mut t, mut trace): (Network<P, SimpleTimingModel<P>>, ConvergenceTrace)| {
        while let Some((step, event)) = t.simulate_step().unwrap() {
            match step {
                StepUpdate::Unchanged => {}
                StepUpdate::Multiple => unreachable!("OSPF events should be disabled"),
                StepUpdate::Single(delta) => {
                    trace.push((
                        vec![(event.router(), delta.old, delta.new)],
                        net.queue().get_time().map(|x| x - t0).into(),
                    ));
                }
            }
        }

        trace
    };

    // record update for the event
    let mut traces: HashSet<ConvergenceTrace> = HashSet::new();
    // extend traces using parallel combinations of the collections of ConvergenceTraces
    traces.extend(
        // execute simulations on `num_cpus` workers in parallel
        repeat_n(&(t.clone(), trace.clone()), workers)
            .cloned()
            .map(|(t, trace)| {
                // execute local chunk sequentially, each cloning the network and the initial trace
                repeat_n(&(t, trace), iters / workers)
                    .cloned()
                    .map(sample_func)
                    .collect::<HashSet<_>>()
            })
            .collect::<Vec<_>>()
            .into_iter()
            .flatten(),
    );
    // gather the last fraction of traces to reach `iters` iterations
    traces.extend(
        repeat_n(&(t.clone(), trace), iters - iters / workers * workers)
            .cloned()
            .map(sample_func),
    );

    // policy: route reflectors strictly loopfree
    let transient_policies: Vec<_> = route_reflectors
        .values()
        .flatten()
        .map(|&x| FwPolicy::LoopFree(x, prefix))
        .collect();

    let mut fw_state = net.get_forwarding_state();

    for trace in traces.into_iter() {
        // generate convergence recording
        let mut recording = ConvergenceRecording::new(fw_state, trace);
        // check transient policies

        // check atomic policies on initial state
        transient_policies.iter().for_each(|x| {
            _ = x.check(recording.state());
        });

        // step through to the last state while checking atomic properties on all other states
        while recording.step().is_some() {
            transient_policies.iter().for_each(|x| {
                _ = x.check(recording.state());
            });
        }

        // step backwards through to the initial state while keeping data structures for all transient properties
        while recording.back().is_some() {}

        // recover forwarding state
        fw_state = recording.into_initial_fw_state();
    }
}