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
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
|
Internet Engineering Task Force (IETF) S. D'Antonio
Request for Comments: 7014 Univ. of Napoli "Parthenope"
Category: Standards Track T. Zseby
ISSN: 2070-1721 CAIDA/FhG FOKUS
C. Henke
Tektronix Communications Berlin
L. Peluso
University of Napoli
September 2013
Flow Selection Techniques
Abstract
The Intermediate Flow Selection Process is the process of selecting a
subset of Flows from all observed Flows. The Intermediate Flow
Selection Process may be located at an IP Flow Information Export
(IPFIX) Exporter or Collector, or within an IPFIX Mediator. It
reduces the effort of post-processing Flow data and transferring Flow
Records. This document describes motivations for using the
Intermediate Flow Selection process and presents Intermediate Flow
Selection techniques. It provides an information model for
configuring Intermediate Flow Selection Process techniques and
discusses what information about an Intermediate Flow Selection
Process should be exported.
Status of This Memo
This is an Internet Standards Track document.
This document is a product of the Internet Engineering Task Force
(IETF). It represents the consensus of the IETF community. It has
received public review and has been approved for publication by the
Internet Engineering Steering Group (IESG). Further information on
Internet Standards is available in Section 2 of RFC 5741.
Information about the current status of this document, any errata,
and how to provide feedback on it may be obtained at
http://www.rfc-editor.org/info/rfc7014.
D'Antonio, et al. Standards Track [Page 1]
^L
RFC 7014 Flow Selection Techniques September 2013
Copyright Notice
Copyright (c) 2013 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
This document may contain material from IETF Documents or IETF
Contributions published or made publicly available before November
10, 2008. The person(s) controlling the copyright in some of this
material may not have granted the IETF Trust the right to allow
modifications of such material outside the IETF Standards Process.
Without obtaining an adequate license from the person(s) controlling
the copyright in such materials, this document may not be modified
outside the IETF Standards Process, and derivative works of it may
not be created outside the IETF Standards Process, except to format
it for publication as an RFC or to translate it into languages other
than English.
D'Antonio, et al. Standards Track [Page 2]
^L
RFC 7014 Flow Selection Techniques September 2013
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.1. Requirements Language . . . . . . . . . . . . . . . . . . 4
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 4
3. Difference between Intermediate Flow Selection Process and
Packet Selection . . . . . . . . . . . . . . . . . . . . . . . 7
4. Difference between Intermediate Flow Selection Process and
Intermediate Selection Process . . . . . . . . . . . . . . . . 9
5. Intermediate Flow Selection Process within the IPFIX
Architecture . . . . . . . . . . . . . . . . . . . . . . . . . 9
5.1. Intermediate Flow Selection Process in the Metering
Process . . . . . . . . . . . . . . . . . . . . . . . . . 11
5.2. Intermediate Flow Selection Process in the Exporting
Process . . . . . . . . . . . . . . . . . . . . . . . . . 11
5.3. Intermediate Flow Selection Process as a Function of
the IPFIX Mediator . . . . . . . . . . . . . . . . . . . . 11
6. Intermediate Flow Selection Process Techniques . . . . . . . . 12
6.1. Flow Filtering . . . . . . . . . . . . . . . . . . . . . . 12
6.1.1. Property Match Filtering . . . . . . . . . . . . . . . 12
6.1.2. Hash-Based Flow Filtering . . . . . . . . . . . . . . 13
6.2. Flow Sampling . . . . . . . . . . . . . . . . . . . . . . 13
6.2.1. Systematic Sampling . . . . . . . . . . . . . . . . . 13
6.2.2. Random Sampling . . . . . . . . . . . . . . . . . . . 14
6.3. Flow-State Dependent Intermediate Flow Selection
Process . . . . . . . . . . . . . . . . . . . . . . . . . 14
6.4. Flow-State Dependent Packet Selection . . . . . . . . . . 15
7. Configuration of Intermediate Flow Selection Process
Techniques . . . . . . . . . . . . . . . . . . . . . . . . . . 16
7.1. Intermediate Flow Selection Process Parameters . . . . . . 17
7.2. Description of Flow-State Dependent Packet Selection . . . 19
8. Information Model for Intermediate Flow Selection Process
Configuration and Reporting . . . . . . . . . . . . . . . . . 20
9. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 22
9.1. Registration of Information Elements . . . . . . . . . . . 22
9.1.1. flowSelectorAlgorithm . . . . . . . . . . . . . . . . 22
9.1.2. flowSelectedOctetDeltaCount . . . . . . . . . . . . . 24
9.1.3. flowSelectedPacketDeltaCount . . . . . . . . . . . . . 24
9.1.4. flowSelectedFlowDeltaCount . . . . . . . . . . . . . . 24
9.1.5. selectorIDTotalFlowsObserved . . . . . . . . . . . . . 25
9.1.6. selectorIDTotalFlowsSelected . . . . . . . . . . . . . 25
9.1.7. samplingFlowInterval . . . . . . . . . . . . . . . . . 26
9.1.8. samplingFlowSpacing . . . . . . . . . . . . . . . . . 26
9.1.9. flowSamplingTimeInterval . . . . . . . . . . . . . . . 27
9.1.10. flowSamplingTimeSpacing . . . . . . . . . . . . . . . 27
9.1.11. hashFlowDomain . . . . . . . . . . . . . . . . . . . . 28
9.2. Registration of Object Identifier . . . . . . . . . . . . 28
10. Security and Privacy Considerations . . . . . . . . . . . . . 28
D'Antonio, et al. Standards Track [Page 3]
^L
RFC 7014 Flow Selection Techniques September 2013
11. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 30
12. References . . . . . . . . . . . . . . . . . . . . . . . . . . 30
12.1. Normative References . . . . . . . . . . . . . . . . . . . 30
12.2. Informative References . . . . . . . . . . . . . . . . . . 31
1. Introduction
This document describes Intermediate Flow Selection Process
techniques for network traffic measurements. A Flow is defined as a
set of packets with common properties, as described in [RFC7011]. An
Intermediate Flow Selection Process can be executed to limit the
resource demands for capturing, storing, exporting, and post-
processing Flow Records. It also can be used to select a particular
set of Flows that are of interest to a specific application. This
document provides a categorization of Intermediate Flow Selection
Process techniques and describes configuration and reporting
parameters for them.
This document also addresses configuration and reporting parameters
for Flow-state dependent packet selection as described in [RFC5475],
although this technique is categorized as packet selection. The
reason is that Flow-state dependent packet selection techniques often
aim at the reduction of resources for Flow capturing and Flow
processing. Furthermore, these techniques were only briefly
discussed in [RFC5475]. Therefore, configuration and reporting
considerations for Flow-state dependent packet selection techniques
have been included in this document.
1.1. Requirements Language
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in RFC 2119 [RFC2119].
2. Terminology
This document is consistent with the terminology introduced in
[RFC7011], [RFC5470], [RFC5475], and [RFC3917]. As in [RFC7011] and
[RFC5476], the first letter of each IPFIX specific and Packet
Sampling (PSAMP) specific term is capitalized, along with the
Intermediate Flow Selection Process specific terms defined here.
D'Antonio, et al. Standards Track [Page 4]
^L
RFC 7014 Flow Selection Techniques September 2013
* Packet Classification
Packet Classification is a process by which packets are mapped to
specific Flow Records, based on packet properties or external
properties (e.g., interface). The properties (e.g., header
information, packet content, Autonomous System (AS) number) make
up the Flow Key. If a Flow Record for a specific Flow Key value
already exists, the Flow Record is updated; otherwise, a new Flow
Record is created.
* Intermediate Flow Selection Process
An Intermediate Flow Selection Process is an Intermediate Process,
as defined in [RFC6183] that takes Flow Records as its input and
selects a subset of this set as its output. The Intermediate Flow
Selection Process is a more general concept than the Intermediate
Selection Process as defined in [RFC6183]. While an Intermediate
Selection Process selects Flow Records from a sequence based upon
criteria-evaluated Flow Record values and only passes on those
Flow Records that match the criteria, an Intermediate Flow
Selection Process selects Flow Records using selection criteria
applicable to a larger set of Flow characteristics and
information.
* Flow Cache
A Flow Cache is the set of Flow Records.
* Flow Selection State
An Intermediate Flow Selection Process maintains state information
for use by the Flow Selector. At a given time, the Flow Selection
State may depend on Flows and packets observed at and before that
time, as well as other variables. Examples include:
(i) sequence number of packets and Flow Records;
(ii) number of selected Flows;
(iii) number of observed Flows;
(iv) current Flow Cache occupancy;
(v) Flow specific counters, lower and upper bounds;
(vi) Intermediate Flow Selection Process timeout intervals.
D'Antonio, et al. Standards Track [Page 5]
^L
RFC 7014 Flow Selection Techniques September 2013
* Flow Selector
A Flow Selector defines the action of an Intermediate Flow
Selection Process on a single Flow of its input. The Flow
Selector can make use of the following information in order to
establish whether or not a Flow has to be selected:
(i) the content of the Flow Record;
(ii) any state information related to the Metering Process or
Exporting Process;
(iii) any Flow Selection State that may be maintained by the
Intermediate Flow Selection Process.
* Complete Flow
A Complete Flow consists of all the packets that enter the
Intermediate Flow Selection Process within the Flow timeout
interval and that belong to the same Flow, per the definition of
"Flow" in [RFC5470]. For this definition, only packets that
arrive at the Intermediate Flow Selection Process are considered.
* Flow Position
Flow Position is the position of a Flow Record within the Flow
Cache.
* Flow Filtering
Flow Filtering selects flows based on a deterministic function on
the Flow Record content, Flow Selection State, external properties
(e.g., ingress interface), or external events (e.g., violated
Access Control List). If the relevant parts of the Flow Record
content can already be observed at the packet level (e.g., Flow
Keys from packet header fields), Flow Filtering can be performed
at the packet level by Property Match Filtering, as described in
[RFC5475].
* Hash-based Flow Filtering
Hash-based Flow Filtering is a deterministic Flow filter function
that selects flows based on a hash function. The hash function is
calculated over parts of the Flow Record content or external
properties that are called the Hash Domain. If the hash value
falls into a predefined Hash Selection Range, the Flow is
selected.
D'Antonio, et al. Standards Track [Page 6]
^L
RFC 7014 Flow Selection Techniques September 2013
* Flow-state Dependent Intermediate Flow Selection Process
The Flow-state dependent Intermediate Flow Selection Process is a
selection function that selects or drops Flows based on the
current Flow Selection State. The selection can be either
deterministic, random, or non-uniform random.
* Flow-state Dependent Packet Selection
Flow-state dependent packet selection is a selection function that
selects or drops packets based on the current Flow Selection
State. The selection can be either deterministic, random, or non-
uniform random. Flow-state dependent packet selection can be used
to implement a preference for the selection of packets belonging
to specific Flows. For example, the selection probability of
packets belonging to Flows that are already within the Flow Cache
may be higher than for packets that have not been recorded yet.
* Flow Sampling
Flow Sampling selects flows based on Flow Record sequence or
arrival times (e.g., entry in Flow Cache, arrival time at Exporter
or Mediator). The selection can be systematic (e.g., every n-th
Flow) or based on a random function (e.g., select each Flow Record
with probability p, or randomly select n out of N Flow Records).
3. Difference between Intermediate Flow Selection Process and Packet
Selection
The Intermediate Flow Selection Process differs from packet selection
as described in [RFC5475]. Packet selection techniques consider
packets as the basic element, and the parent population consists of
all packets observed at an Observation Point. In contrast to this,
the basic elements in Flow selection are the Flows. The parent
population consists of all observed Flows, and the Intermediate Flow
Selection Process operates on the Flows. The major characteristics
of the Intermediate Flow Selection Process are the following:
- The Intermediate Flow Selection Process takes Flows as basic
elements. For packet selection, packets are considered as basic
elements.
- The Intermediate Flow Selection Process typically takes place
after Packet Classification, because the classification rules
determine to which Flow a packet belongs. The Intermediate Flow
Selection Process can be performed before Packet Classification.
In that case, the Intermediate Flow Selection Process is based on
the Flow Key (and also on a hash value over the Flow Key) but not
D'Antonio, et al. Standards Track [Page 7]
^L
RFC 7014 Flow Selection Techniques September 2013
on characteristics that are only available after Packet
Classification (e.g., Flow size, Flow duration). Packet selection
can be applied before and after Packet Classification. As an
example, packet selection before Packet Classification can be
random packet selection, whereas packet selection after Packet
Classification can be Flow-state dependent packet selection (as
described in [RFC5475]).
- The Intermediate Flow Selection Process operates on Complete
Flows. That means that after the Intermediate Flow Selection
Process, either all packets of the Flow are kept or all packets of
the Flow are discarded. That means that if the Intermediate Flow
Selection Process is preceded by a packet selection process, the
Complete Flow consists only of the packets that were not discarded
during the packet selection.
There are some techniques that are difficult to unambiguously
categorize into one of the categories. Here, some guidance is given
on how to categorize such techniques:
- Techniques that can be considered as both packet selection and an
Intermediate Flow Selection Process: some packet selection
techniques result in the selection of Complete Flows and therefore
can be considered as packet selection or as an Intermediate Flow
Selection Process at the same time. An example is Property Match
Filtering of all packets to a specific destination address. If
Flows are defined based on destination addresses, such a packet
selection also results in an Intermediate Flow Selection Process
and can be considered as packet selection or as an Intermediate
Flow Selection Process.
- Flow-state Dependent Packet Selection: there exist techniques that
select packets based on the Flow state, e.g., based on the number
of already observed packets belonging to the Flow. Examples of
these techniques from the literature include "Sample and Hold"
[EsVa01], "Fast Filtered Sampling" [MSZC10], and the "Sticky
Sampling" algorithm presented in [MaMo02]. Such techniques can be
used to influence which Flows are captured (e.g., increase the
selection of packets belonging to large Flows) and reduce the
number of Flows that need to be stored in the Flow Cache.
Nevertheless, such techniques do not necessarily select Complete
Flows, because they do not ensure that all packets of a selected
Flow are captured. Therefore, Flow-state dependent packet
selection techniques that do not ensure that either all or no
packets of a Flow are selected, strictly speaking, have to be
considered as packet selection techniques and not as Intermediate
Flow Selection Process techniques.
D'Antonio, et al. Standards Track [Page 8]
^L
RFC 7014 Flow Selection Techniques September 2013
4. Difference between Intermediate Flow Selection Process and
Intermediate Selection Process
The Intermediate Flow Selection Process differs from the Intermediate
Selection Process, since the Intermediate Flow Selection Process uses
selection criteria that apply to a larger set of Flow information and
properties than those used by the Intermediate Selection Process.
The typical function of an Intermediate Selection Process is Property
Match Filtering, which selects a Flow Record if the value of a
specific field in the Flow Record matches a configured value or falls
within a configured range. This means that the selection criteria
used by an Intermediate Selection Process are evaluated only on Flow
Record values. An Intermediate Flow Selection Process makes its
decision on whether a Flow has to be selected or not by taking into
account not only information related to the content of the Flow
Record but also any Flow Selection State information or variable that
can be used to select Flows in order to meet application requirements
or resource constraints (e.g., Flow Cache occupancy, export link
capacity). Examples include flow counters, Intermediate Flow
Selection Process timeout intervals, and Flow Record time
information.
5. Intermediate Flow Selection Process within the IPFIX Architecture
An Intermediate Flow Selection Process can be deployed at any of
three places within the IPFIX architecture. As shown in Figure 1,
the Intermediate Flow Selection Process can occur
1. in the Metering Process at the IPFIX Exporter
2. in the Exporting Process at the Collector
3. within a Mediator
D'Antonio, et al. Standards Track [Page 9]
^L
RFC 7014 Flow Selection Techniques September 2013
+===========================================+
| IPFIX Exporter +----------------+ |
| | Metering Proc. | |
| +-----------------+ +----------------+ |
| | Metering | | Intermediate | |
| | Process | or | Flow Selection | |
| | | | Process | |
| +-----------------+----+----------------+ |
| | Exporting Process | |
| +----|-------------------------------|--+ |
+======|===============================|====+
| |
| |
+======|========================+ |
| | Mediator | |
| +-V-------------------+ | |
| | Collecting Process | | |
| +---------------------+ | |
| | Intermediate Flow | | |
| | Selection Process | | |
| +---------------------+ | |
| | Exporting Process | | |
| +-|-------------------+ | |
+======|========================+ |
| |
| |
+======|===============================|=====+
| | Collector | |
| +----V-------------------------------V-+ |
| | Collecting Process | |
| +--------------------------------------+ |
| | Intermediate Flow Selection Process | |
| +--------------------------------------+ |
| | Exporting Process | |
| +------------------------------|-------+ |
+================================|===========+
|
|
V
+------------------+
| IPFIX |
+------------------+
Figure 1: Potential Intermediate Flow Selection Process Locations
In contrast to packet selection, the Intermediate Flow Selection
Process is always applied after the packets are classified into
Flows.
D'Antonio, et al. Standards Track [Page 10]
^L
RFC 7014 Flow Selection Techniques September 2013
5.1. Intermediate Flow Selection Process in the Metering Process
An Intermediate Flow Selection Process in the Metering Process uses
packet information to update the Flow Records in the Flow Cache. The
Intermediate Flow Selection Process, before Packet Classification,
can be based on the Flow Key (and also on a hash value over the Flow
Key) but not on characteristics that are only available after Packet
Classification (e.g., Flow size, Flow duration). Here, an
Intermediate Flow Selection Process is applied to reduce resources
for all subsequent processes or to select specific Flows of interest
in cases where such Flow characteristics are already observable at
the packet level (e.g., Flows to specific IP addresses). In
contrast, Flow-state dependent packet selection is a packet selection
technique, because it does not necessarily select Complete Flows.
5.2. Intermediate Flow Selection Process in the Exporting Process
An Intermediate Flow Selection Process in the Exporting Process works
on Flow Records and can therefore depend on Flow characteristics that
are only visible after the classification of packets, such as Flow
size and Flow duration. The Exporting Process may implement policies
for exporting only a subset of the Flow Records that have been stored
in the system's memory, in order to offload Flow export and Flow
post-processing. An Intermediate Flow Selection Process in the
Exporting Process may select only the subset of Flow Records that are
of interest to the user's application or select only as many Flow
Records as can be handled by the available resources (e.g., limited
export link capacity).
5.3. Intermediate Flow Selection Process as a Function of the IPFIX
Mediator
As shown in Figure 1, the Intermediate Flow Selection Process can be
performed within an IPFIX Mediator [RFC6183]. The Intermediate Flow
Selection Process takes a Flow Record stream as its input and selects
Flow Records from a sequence based upon criteria-evaluated record
values. The Intermediate Flow Selection Process can again apply an
Intermediate Flow Selection Process technique to obtain Flows of
interest to the application. Further, the Intermediate Flow
Selection Process can base its selection decision on the correlation
of data from different IPFIX Exporters, e.g., by only selecting Flows
that were recorded on two or more IPFIX Exporters.
D'Antonio, et al. Standards Track [Page 11]
^L
RFC 7014 Flow Selection Techniques September 2013
6. Intermediate Flow Selection Process Techniques
An Intermediate Flow Selection Process technique selects either all
or none of the packets of a Flow; otherwise, the technique has to be
considered as packet selection. A difference between Flow Filtering
and Flow sampling is recognized.
6.1. Flow Filtering
Flow Filtering is a deterministic function on the IPFIX Flow Record
content. If the relevant Flow characteristics are already observable
at the packet level (e.g., Flow Keys), Flow Filtering can be applied
before aggregation at the packet level. In order to be compliant
with IPFIX, at least one of this document's Flow Filtering schemes
MUST be implemented.
6.1.1. Property Match Filtering
Property Match Filtering is performed similarly to Property Match
Filtering for packet selection as described in [RFC5475]. The
difference is that Flow Record fields are used here, instead of
packet fields, to derive the selection decision. Property Match
Filtering is used to select a specific subset of the Flows that are
of interest to a particular application (e.g., all Flows to a
specific destination, all large Flows, etc.). Properties on which
the filtering is based can be Flow Keys, Flow Timestamps, or Per-Flow
Counters as described in [RFC7012]. Examples include the Flow size
in bytes, the number of packets in the Flow, the observation time of
the first or last packet, and the maximum packet length. An example
of Property Match Filtering is to select Flows with more than a
threshold number of observed octets. The selection criteria can be a
specific value, a set of specific values, or an interval. For
example, a Flow is selected if destinationIPv4Address and the total
number of packets of the Flow equal two predefined values. An
Intermediate Flow Selection Process using Property Match Filtering in
the Metering Process relies on properties that are observable at the
packet level (e.g., Flow Key). For example, a Flow is selected if
sourceIPv4Address and sourceIPv4PrefixLength equal, respectively, two
specific values.
An Intermediate Flow Selection Process using Property Match Filtering
in the Exporting Process is based on properties that are only visible
after Packet Classification, such as Flow size and Flow duration. An
example is the selection of the largest Flows or a percentage of
Flows with the longest lifetime. Another example is to select and
remove from the Flow Cache the Flow Record with the lowest Flow
volume per current Flow lifetime if the Flow Cache is full.
D'Antonio, et al. Standards Track [Page 12]
^L
RFC 7014 Flow Selection Techniques September 2013
An Intermediate Flow Selection Process using Property Match Filtering
within an IPFIX Mediator selects a Flow Record if the value of a
specific field in the Flow Record equals a configured value or falls
within a configured range [RFC6183].
6.1.2. Hash-Based Flow Filtering
Hash-based Flow Filtering uses a hash function h to map the Flow Key
c onto a Hash Range R. A Flow is selected if the hash value h(c) is
within the Hash Selection Range S, which is a subset of R. Hash-
based Flow Filtering can be used to emulate a random sampling process
but still enable the correlation between selected Flow subsets at
different Observation Points. Hash-based Flow Filtering is similar
to Hash-based packet selection and is in fact identical when Hash-
based packet selection uses the Flow Key that defines the Flow as the
hash input. Nevertheless, there may be the incentive to apply Hash-
based Flow Filtering, but not at the packet level, in the Metering
Process, for example, when the size of the selection range, and
therefore the sampling probability, are dependent on the number of
observed Flows. If Hash-based Flow Filtering is used to select the
same subset of flows at different Observation Points, the Hash Domain
MUST only include parts of the Flow Record content that are invariant
on the Flow path. Refer also to the Trajectory Sampling application
example of coordinated packet selection [RFC5475], which explains the
hash-based filtering approach at the packet level.
6.2. Flow Sampling
Flow sampling operates on Flow Record sequence or arrival times. It
can use either a systematic or a random function for the Intermediate
Flow Selection Process. Flow sampling usually aims at the selection
of a representative subset of all Flows in order to estimate
characteristics of the whole set (e.g., mean Flow size in the
network).
6.2.1. Systematic Sampling
Systematic sampling is a deterministic selection function. It may be
a periodic selection of the N-th Flow Record that arrives at the
Intermediate Flow Selection Process. Systematic sampling MAY be
applied in the Metering Process. An example would be to create,
besides the Flow Cache of selected Flows, an additional data
structure that saves the Flow Key values of the Flows that are not
selected. The selection of a Flow would then be based on the first
packet of a Flow. Every time a packet belonging to a new Flow (which
is not in the data structure of either the selected or non-selected
Flows) arrives at the Observation Point, a counter is increased. If
D'Antonio, et al. Standards Track [Page 13]
^L
RFC 7014 Flow Selection Techniques September 2013
the counter is increased to a multiple of N, a new Flow Cache entry
is created; if the counter is not a multiple of N, the Flow Key value
is added to the data structure for non-selected Flows.
Systematic sampling can also be time-based. Time-based systematic
sampling is applied by only creating Flows that are observed between
time-based start and stop triggers. The time interval may be applied
at the packet level in the Metering Process or after aggregation at
the Flow level, e.g., by selecting a Flow arriving at the Exporting
Process every n seconds.
6.2.2. Random Sampling
Random Flow sampling is based on a random process that requires the
calculation of random numbers. One can differentiate between n-out-
of-N and probabilistic Flow sampling.
6.2.2.1. n-out-of-N Flow Sampling
In n-out-of-N Sampling, n elements are selected out of the parent
population, which consists of N elements. One example would be to
generate n different random numbers in the range [1,N] and select all
Flows that have a Flow Position equal to one of the random numbers.
6.2.2.2. Probabilistic Flow Sampling
In probabilistic Sampling, the decision of whether or not a Flow is
selected is made in accordance with a predefined selection
probability. For probabilistic Sampling, the Sample Size can vary
for different trials. The selection probability does not necessarily
have to be the same for each Flow. Therefore, a difference between
uniform probabilistic sampling (with the same selection probability
for all Flows) and non-uniform probabilistic sampling (where the
selection probability can vary for different Flows) is recognized.
For non-uniform probabilistic Flow sampling, the sampling probability
may be adjusted according to the Flow Record content. An example
would be to increase the selection probability of large-volume Flows
over small-volume Flows, as described in [DuLT01].
6.3. Flow-State Dependent Intermediate Flow Selection Process
The Flow-state dependent Intermediate Flow Selection Process can be a
deterministic or random Intermediate Flow Selection Process, based on
the Flow Record content and the Flow state that may be kept
additionally for each of the Flows. External processes may update
counters, bounds, and timers for each of the Flow Records, and the
Intermediate Flow Selection Process utilizes this information for the
selection decision. A review of Flow-state dependent Intermediate
D'Antonio, et al. Standards Track [Page 14]
^L
RFC 7014 Flow Selection Techniques September 2013
Flow Selection Process techniques that aim at the selection of the
most frequent items by keeping additional Flow state information can
be found in [CoHa08]. The Flow-state dependent Intermediate Flow
Selection Process can only be applied after packet aggregation, when
a packet has been assigned to a Flow. The Intermediate Flow
Selection Process then decides, based on the Flow state for each
Flow, whether it is kept in the Flow Cache or not. Two Flow-state
dependent Intermediate Flow Selection Process Algorithms are
described here:
The Frequent algorithm [KaPS03] is a technique that aims at the
selection of all flows that at least exceed a 1/k fraction of the
Observed Packet Stream. The algorithm has only a Flow Cache of size
k-1, and each Flow in the Flow Cache has an additional counter. The
counter is incremented each time a packet belonging to the Flow in
the Flow Cache is observed. If the observed packet does not belong
to any Flow, all counters are decremented; if any of the Flow
counters has a value of zero, the Flow is replaced with a Flow formed
from the new packet.
Lossy counting is a selection technique that identifies all Flows
whose packet count exceeds a certain percentage of the whole observed
packet stream (e.g., 5% of all packets) with a certain estimation
error e. Lossy counting separates the observed packet stream in
windows of size N=1/e, where N is an amount of consecutive packets.
For each observed Flow, an additional counter will be held in the
Flow state. The counter is incremented each time a packet belonging
to the Flow is observed, and all counters are decremented at the end
of each window. Also, all Flows with a counter of zero are removed
from the Flow Cache.
6.4. Flow-State Dependent Packet Selection
Flow-state dependent packet selection is not an Intermediate Flow
Selection Process technique but a packet selection technique.
Nevertheless, configuration and reporting parameters for this
technique will be described in this document. An example is the
"Sample and Hold" algorithm [EsVa01], which tries to implement a
preference for large-volume Flows in the selection. When a packet
arrives, it is selected when a Flow Record for this packet already
exists. If there is no Flow Record, the packet is selected according
to a certain probability that is dependent on the packet size.
D'Antonio, et al. Standards Track [Page 15]
^L
RFC 7014 Flow Selection Techniques September 2013
7. Configuration of Intermediate Flow Selection Process Techniques
This section describes the configuration parameters of the Flow
selection techniques presented above. It provides the basis for an
information model to be adopted in order to configure the
Intermediate Flow Selection Process within an IPFIX Device. The
information model with the Information Elements (IEs) for
Intermediate Flow Selection Process configuration is described
together with the reporting IEs in Section 8. Table 1 gives an
overview of the defined Intermediate Flow Selection Process
techniques, where they can be applied, and what their input
parameters are. Depending on where the Flow selection techniques are
applied, different input parameters can be configured.
+-------------------+--------------------+--------------------------+
| Location | Selection | Selection Input |
| | Technique | |
+-------------------+--------------------+--------------------------+
| In the Metering | Flow-state | packet sampling |
| Process | Dependent Packet | probabilities, Flow |
| | Selection | Selection State, packet |
| | | properties |
| | | |
| In the Metering | Property Match | Flow Record IEs, |
| Process | Flow Filtering | Selection Interval |
| | | |
| In the Metering | Hash-based Flow | selection range, hash |
| Process | Filtering | function, Flow Key, seed |
| | | (optional) |
| | | |
| In the Metering | Time-based | Flow Position (derived |
| Process | Systematic Flow | from arrival time of |
| | sampling | packets), Flow Selection |
| | | State |
| | | |
| In the Metering | Sequence-based | Flow Position (derived |
| Process | Systematic Flow | from packet position), |
| | sampling | Flow Selection State |
| | | |
| In the Metering | Random Flow | random number generator |
| Process | sampling | or list and packet |
| | | position, Flow state |
| | | |
| In the Exporting | Property Match | Flow Record content, |
| Process/ within | Flow Filtering | filter function |
| the IPFIX | | |
| Mediator | | |
| | | |
D'Antonio, et al. Standards Track [Page 16]
^L
RFC 7014 Flow Selection Techniques September 2013
| In the Exporting | Hash-based Flow | selection range, hash |
| Process/ within | Filtering | function, hash input |
| the IPFIX | | (Flow Keys and other |
| Mediator | | Flow properties) |
| | | |
| In the Exporting | Flow-state | Flow state parameters, |
| Process/ within | Dependent | random number generator |
| the IPFIX | Intermediate Flow | or list |
| Mediator | Selection Process | |
| | | |
| In the Exporting | Time-based | Flow arrival time, Flow |
| Process/ within | Systematic Flow | state |
| the IPFIX | sampling | |
| Mediator | | |
| | | |
| In the Exporting | Sequence-based | Flow Position, Flow |
| Process/ within | Systematic Flow | state |
| the IPFIX | sampling | |
| Mediator | | |
| | | |
| In the Exporting | Random Flow | random number generator |
| Process/ within | sampling | or list and Flow |
| the IPFIX | | Position, Flow state |
| Mediator | | |
+-------------------+--------------------+--------------------------+
Table 1: Overview of Intermediate Flow Selection Process Techniques
7.1. Intermediate Flow Selection Process Parameters
This section defines what parameters are required to describe the
most common Intermediate Flow Selection Process techniques.
Intermediate Flow Selection Process Parameters:
For Property Match Filtering:
- Information Element as specified in [IANA-IPFIX]):
Specifies the Information Element that is used as the property in
the filter expression. Section 8 specifies the Information
Elements that MUST be exported by an Intermediate Flow Selection
Process using Property Match Filtering.
- Selection Value or Value Interval:
Specifies the value or interval of the filter expression. Packets
and Flow Records that have a value equal to the Selection Value or
within the Interval will be selected.
D'Antonio, et al. Standards Track [Page 17]
^L
RFC 7014 Flow Selection Techniques September 2013
For Hash-based Flow Filtering:
- Hash Domain:
Specifies the bits from the packet or Flow that are taken as the
hash input to the hash function.
- Hash Function:
Specifies the name of the hash function that is used to calculate
the hash value. Possible hash functions are BOB [RFC5475], IP
Shift-XOR (IPSX) [RFC5475], and CRC-32 [Bra75].
- Hash Selection Range:
Flows that have a hash value within the Hash Selection Range are
selected. The Hash Selection Range can be a value interval or
arbitrary hash values within the Hash Range of the hash function.
- Random Seed or Initializer Value:
Some hash functions require an initializing value. In order to
make the selection decision more secure, one can choose a random
seed that configures the hash function.
For Flow-state Dependent Intermediate Flow Selection Process:
- Frequency threshold:
Specifies the frequency threshold s for Flow-state dependent Flow
Selection techniques that try to find the most frequent items
within a dataset. All Flows that exceed the defined threshold
will be selected.
- Accuracy parameter:
Specifies the accuracy parameter e for techniques that deal with
the issue of mining frequent items in a dataset. The accuracy
parameter defines the maximum error, i.e., no Flows that have a
true frequency less than (s - e) N are selected, where s is the
frequency threshold and N is the total number of packets.
The above list of parameters for Flow-state dependent Flow Selection
techniques is suitable for the presented frequent item and lossy
counting algorithms. Nevertheless, a variety of techniques exist
with very specific parameters not defined here.
For Systematic time-based Flow sampling:
- Interval length (in usec):
Defines the length of the sampling interval during which Flows are
selected.
D'Antonio, et al. Standards Track [Page 18]
^L
RFC 7014 Flow Selection Techniques September 2013
- Spacing (in usec):
Defines the spacing in usec between the end of one sampling
interval and the start of the next interval.
For Systematic count-based Flow sampling:
- Interval length:
Defines the number of Flows that are selected within the sampling
interval.
- Spacing:
Defines the spacing, in number of observed Flows, between the end
of one sampling interval and the start of the next interval.
For random n-out-of-N Flow sampling:
- Population Size N:
The number of all Flows in the Population from which the sample is
drawn.
- Sampling Size n:
The number of Flows that are randomly drawn from the population N.
For probabilistic Flow sampling:
- Sampling probability p:
Defines the probability by which each of the observed Flows is
selected.
7.2. Description of Flow-State Dependent Packet Selection
The configuration of Flow-state dependent packet selection has not
been described in [RFC5475]; therefore, the parameters are defined
here:
For Flow-state Dependent Packet Selection:
- Packet selection probability per possible Flow state interval:
Defines multiple {Flow interval, packet selection probability}
value pairs that configure the sampling probability, depending on
the current Flow state.
- Additional parameters:
For the configuration of Flow-state dependent packet selection,
additional parameters or packet properties may be required, e.g.,
the packet size [EsVa01].
D'Antonio, et al. Standards Track [Page 19]
^L
RFC 7014 Flow Selection Techniques September 2013
8. Information Model for Intermediate Flow Selection Process
Configuration and Reporting
This section specifies the Information Elements that MUST be exported
by an Intermediate Flow Selection Process in order to support the
interpretation of measurement results from Flow measurements. The
information is mainly used to report how many packets and Flows have
been observed in total and how many of them were selected. This
helps, for instance, to calculate the Attained Selection Fraction
(see also [RFC5476]), which is an important parameter for providing
an accuracy statement. The IEs can provide reporting information
about Flow Records, packets, or bytes. The reported metrics are the
total number of elements and the number of selected elements. The
number of dropped elements can be derived from this information.
D'Antonio, et al. Standards Track [Page 20]
^L
RFC 7014 Flow Selection Techniques September 2013
Table 2 shows a list of Intermediate Flow Selection Process
Information Elements:
ID Name | ID Name
----------------------------------+----------------------------------
301 selectionSequenceID | 302 selectorID
|
390 flowSelectorAlgorithm | 1 octetDeltaCount
|
391 flowSelectedOctetDeltaCount | 2 packetDeltaCount
|
392 flowSelectedPacketDeltaCount | 3 originalFlowsPresent
|
393 flowSelectedFlowDeltaCount | 394 selectorIDTotalFlowsObserved
|
395 selectorIDTotalFlowsSelected | 396 samplingFlowInterval
|
397 samplingFlowSpacing | 309 samplingSize
|
310 samplingPopulation | 311 samplingProbability
|
398 flowSamplingTimeInterval | 399 flowSamplingTimeSpacing
|
326 digestHashValue | 400 hashFlowDomain
|
329 hashOutputRangeMin | 330 hashOutputRangeMax
|
331 hashSelectedRangeMin | 332 hashSelectedRangeMax
|
333 hashDigestOutput | 334 hashInitialiserValue
|
320 absoluteError | 321 relativeError
|
336 upperCILimit | 337 lowerCILimit
|
338 confidenceLevel |
Table 2: Intermediate Flow Selection Process Information Elements
D'Antonio, et al. Standards Track [Page 21]
^L
RFC 7014 Flow Selection Techniques September 2013
9. IANA Considerations
9.1. Registration of Information Elements
IANA has registered the following IEs in the "IPFIX Information
Elements" registry at http://www.iana.org/assignments/ipfix/.
9.1.1. flowSelectorAlgorithm
Description:
This Information Element identifies the Intermediate Flow
Selection Process technique (e.g., Filtering, Sampling) that is
applied by the Intermediate Flow Selection Process. Most of these
techniques have parameters; configuration parameter(s) MUST be
clearly specified. Further Information Elements are needed to
fully specify packet selection with these methods and all their
parameters. Further method identifiers may be added to the list
below. It might be necessary to define new Information Elements
to specify their parameters. The flowSelectorAlgorithm registry
is maintained by IANA. New assignments for the registry will be
administered by IANA, on a First Come First Served basis
[RFC5226], subject to Expert Review [RFC5226]. Please note that
the purpose of the flow selection techniques described in this
document is the improvement of measurement functions as defined in
the Introduction (Section 1). Before adding new flow selector
algorithms, their intended purposes should be determined,
especially if those purposes contradict any policies defined in
[RFC2804]. The designated expert(s) should consult with the
community if a request that runs counter to [RFC2804] is received.
The registry can be updated when specifications of the new
method(s) and any new Information Elements are provided. The
group of experts must double-check the flowSelectorAlgorithm
definitions and Information Elements with already-defined
flowSelectorAlgorithm definitions and Information Elements for
completeness, accuracy, and redundancy. Those experts will
initially be drawn from the Working Group Chairs and document
editors of the IPFIX and PSAMP Working Groups. The following
identifiers for Intermediate Flow Selection Process Techniques are
defined here:
D'Antonio, et al. Standards Track [Page 22]
^L
RFC 7014 Flow Selection Techniques September 2013
+----+------------------------+--------------------------+
| ID | Technique | Parameters |
+----+------------------------+--------------------------+
| 1 | Systematic count-based | flowSamplingInterval |
| | Sampling | flowSamplingSpacing |
+----+------------------------+--------------------------+
| 2 | Systematic time-based | flowSamplingTimeInterval |
| | Sampling | flowSamplingTimeSpacing |
+----+------------------------+--------------------------+
| 3 | Random n-out-of-N | samplingSize |
| | Sampling | samplingPopulation |
+----+------------------------+--------------------------+
| 4 | Uniform probabilistic | samplingProbability |
| | Sampling | |
+----+------------------------+--------------------------+
| 5 | Property Match | Information Element |
| | Filtering | Value Range |
+----+------------------------+--------------------------+
| Hash-based Filtering | hashInitialiserValue |
+----+------------------------+ hashFlowDomain |
| 6 | using BOB | hashSelectedRangeMin |
+----+------------------------+ hashSelectedRangeMax |
| 7 | using IPSX | hashOutputRangeMin |
+----+------------------------+ hashOutputRangeMax |
| 8 | using CRC | |
+----+------------------------+--------------------------+
| 9 | Flow-state Dependent |No agreed Parameters |
| | Intermediate Flow | |
| | Selection Process | |
+----+------------------------+--------------------------+
Table 3: Intermediate Flow Selection Process Techniques
Abstract Data Type: unsigned16
ElementId: 390
Data Type Semantics: identifier
Status: current
D'Antonio, et al. Standards Track [Page 23]
^L
RFC 7014 Flow Selection Techniques September 2013
9.1.2. flowSelectedOctetDeltaCount
Description:
This Information Element specifies the volume in octets of all
Flows that are selected in the Intermediate Flow Selection Process
since the previous report.
Abstract Data Type: unsigned64
ElementId: 391
Units: octets
Status: current
9.1.3. flowSelectedPacketDeltaCount
Description:
This Information Element specifies the volume in packets of all
Flows that were selected in the Intermediate Flow Selection
Process since the previous report.
Abstract Data Type: unsigned64
ElementId: 392
Units: packets
Status: current
9.1.4. flowSelectedFlowDeltaCount
Description:
This Information Element specifies the number of Flows that were
selected in the Intermediate Flow Selection Process since the last
report.
Abstract Data Type: unsigned64
ElementId: 393
Units: flows
Status: current
D'Antonio, et al. Standards Track [Page 24]
^L
RFC 7014 Flow Selection Techniques September 2013
9.1.5. selectorIDTotalFlowsObserved
Description:
This Information Element specifies the total number of Flows
observed by a Selector, for a specific value of SelectorID. This
Information Element should be used in an Options Template scoped
to the observation to which it refers. See Section 3.4.2.1 of the
IPFIX protocol document [RFC7011].
Abstract Data Type: unsigned64
ElementId: 394
Units: flows
Status: current
9.1.6. selectorIDTotalFlowsSelected
Description:
This Information Element specifies the total number of Flows
selected by a Selector, for a specific value of SelectorID. This
Information Element should be used in an Options Template scoped
to the observation to which it refers. See Section 3.4.2.1 of the
IPFIX protocol document [RFC7011].
Abstract Data Type: unsigned64
ElementId: 395
Units: flows
Status: current
D'Antonio, et al. Standards Track [Page 25]
^L
RFC 7014 Flow Selection Techniques September 2013
9.1.7. samplingFlowInterval
Description:
This Information Element specifies the number of Flows that are
consecutively sampled. A value of 100 means that 100 consecutive
Flows are sampled. For example, this Information Element may be
used to describe the configuration of a systematic count-based
Sampling Selector.
Abstract Data Type: unsigned64
ElementId: 396
Units: flows
Status: current
9.1.8. samplingFlowSpacing
Description:
This Information Element specifies the number of Flows between two
"samplingFlowInterval"s. A value of 100 means that the next
interval starts 100 Flows (which are not sampled) after the
current "samplingFlowInterval" is over. For example, this
Information Element may be used to describe the configuration of a
systematic count-based Sampling Selector.
Abstract Data Type: unsigned64
ElementId: 397
Units: flows
Status: current
D'Antonio, et al. Standards Track [Page 26]
^L
RFC 7014 Flow Selection Techniques September 2013
9.1.9. flowSamplingTimeInterval
Description:
This Information Element specifies the time interval in
microseconds during which all arriving Flows are sampled. For
example, this Information Element may be used to describe the
configuration of a systematic time-based Sampling Selector.
Abstract Data Type: unsigned64
ElementId: 398
Units: microseconds
Status: current
9.1.10. flowSamplingTimeSpacing
Description:
This Information Element specifies the time interval in
microseconds between two "flowSamplingTimeInterval"s. A value of
100 means that the next interval starts 100 microseconds (during
which no Flows are sampled) after the current
"flowsamplingTimeInterval" is over. For example, this Information
Element may be used to describe the configuration of a systematic
time-based Sampling Selector.
Abstract Data Type: unsigned64
ElementId: 399
Units: microseconds
Status: current
D'Antonio, et al. Standards Track [Page 27]
^L
RFC 7014 Flow Selection Techniques September 2013
9.1.11. hashFlowDomain
Description:
This Information Element specifies the Information Elements that
are used by the Hash-based Flow Selector as the Hash Domain.
Abstract Data Type: unsigned16
ElementId: 400
Data Type Semantics: identifier
Status: Current
9.2. Registration of Object Identifier
IANA has registered the following OID in the IPFIX-SELECTOR-MIB
Functions subregistry at http://www.iana.org/assignments/smi-numbers
according to the procedures set forth in [RFC6615].
+---------+-----------------------+---------------------+-----------+
| Decimal | Name | Description | Reference |
+---------+-----------------------+---------------------+-----------+
| 8 | flowSelectorAlgorithm | This Object | [RFC7014] |
| | | Identifier | |
| | | identifies the | |
| | | Intermediate Flow | |
| | | Selection Process | |
| | | technique (e.g., | |
| | | Filtering, | |
| | | Sampling) that is | |
| | | applied by the | |
| | | Intermediate Flow | |
| | | Selection Process | |
+---------+-----------------------+---------------------+-----------+
Table 4: Object Identifiers to Be Registered
10. Security and Privacy Considerations
Flow data exported by Exporting Processes, and collected by
Collecting Processes, can be sensitive for privacy reasons and need
to be protected. Privacy considerations for collected data are
provided in [RFC7011].
Some of the described Intermediate Flow Selection Process techniques
(e.g., Flow sampling, hash-based Flow Filtering) aim at the selection
D'Antonio, et al. Standards Track [Page 28]
^L
RFC 7014 Flow Selection Techniques September 2013
of a representative subset of flows in order to estimate parameters
of the population. An adversary may have incentives to influence the
selection of flows, for example, to circumvent accounting or to avoid
the detection of packets that are part of an attack.
Security considerations concerning the choice of a hash function for
Hash-based packet selection have been discussed in Section 6.2.3 of
[RFC5475] and are also appropriate for Hash-based Flow Selection.
[RFC5475] discusses the possibility of crafting Packet Streams that
are disproportionately selected or can be used to discover hash
function parameters. It also describes vulnerabilities of different
hash functions to these attacks and discusses practices to minimize
these vulnerabilities.
For other sampling approaches, an adversary can gain knowledge about
the start and stop triggers in time-based systematic Sampling, e.g.,
by sending test packets. This knowledge might allow adversaries to
modify their send schedule in such a way that their packets are
disproportionately selected or not selected. For random Sampling, an
input to the encryption process, like the Initialization Vector of
the CBC (Cipher Block Chaining) mode, should be used to prevent an
adversary from predicting the selection decision [Dw01].
Further security threats can occur when Intermediate Flow Selection
Process parameters are configured or communicated to other entities.
The protocol(s) for the configuration and reporting of Intermediate
Flow Selection Process parameters are out of scope for this document.
Nevertheless, a set of initial requirements for future configuration
and reporting protocols are stated below:
1. Protection against disclosure of configuration information:
Intermediate Flow Selection Process configuration information
describes the Intermediate Flow Selection Process and its
parameters. This information can be useful to attackers.
Attackers may craft packets that never fit the selection criteria
in order to prevent Flows from being seen by the Intermediate
Flow Selection Process. They can also craft a lot of packets
that fit the selection criteria and overload or bias subsequent
processes. Therefore, any transmission of configuration data
(e.g., to configure a process or to report its actual status)
should be protected by encryption.
2. Protection against modification of configuration information:
Sending incorrect configuration information to the Intermediate
Flow Selection Process can lead to a malfunction of the
Intermediate Flow Selection Process. Additionally, reporting
incorrect configuration information from the Intermediate Flow
Selection Process to other processes can lead to incorrect
D'Antonio, et al. Standards Track [Page 29]
^L
RFC 7014 Flow Selection Techniques September 2013
estimations at subsequent processes. Therefore, any protocol
that transmits configuration information should prevent an
attacker from modifying configuration information. Data
integrity can be achieved by authenticating the data.
3. Protection against malicious nodes sending configuration
information:
The remote configuration of Intermediate Flow Selection Process
techniques should be protected against access by unauthorized
nodes. This can be achieved by access control lists at the
device that hosts the Intermediate Flow Selection Process (e.g.,
IPFIX Exporter, IPFIX Mediator, or IPFIX Collector) and by source
authentication. The reporting of configuration data from an
Intermediate Flow Selection Process has to be protected in the
same way. That means that protocols that report configuration
data from the Intermediate Flow Selection Process to other
processes also need to protect against unauthorized nodes
reporting configuration information.
The security threats that originate from communicating configuration
information to and from Intermediate Flow Selection Processes cannot
be assessed solely with the information given in this document. A
further and more detailed assessment of security threats is necessary
when a specific protocol for the configuration or reporting
configuration data is proposed.
11. Acknowledgments
We would like to thank the IPFIX group, especially Brian Trammell,
Paul Aitken, and Benoit Claise, for fruitful discussions and for
proofreading the document.
12. References
12.1. Normative References
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119, March 1997.
[RFC5475] Zseby, T., Molina, M., Duffield, N., Niccolini, S., and
F. Raspall, "Sampling and Filtering Techniques for IP
Packet Selection", RFC 5475, March 2009.
[RFC5476] Claise, B., Johnson, A., and J. Quittek, "Packet
Sampling (PSAMP) Protocol Specifications", RFC 5476,
March 2009.
D'Antonio, et al. Standards Track [Page 30]
^L
RFC 7014 Flow Selection Techniques September 2013
[RFC6615] Dietz, T., Kobayashi, A., Claise, B., and G. Muenz,
"Definitions of Managed Objects for IP Flow Information
Export", RFC 6615, June 2012.
[RFC7011] Claise, B., Ed., Trammell, B., Ed., and P. Aitken,
"Specification of the IP Flow Information Export
(IPFIX) Protocol for the Exchange of Flow Information",
STD 77, RFC 7011, September 2013.
[RFC7012] Claise, B., Ed. and B. Trammell, Ed., "Information
Model for IP Flow Information Export (IPFIX)",
RFC 7012, September 2013.
12.2. Informative References
[Bra75] Brayer, K., "Evaluation of 32 Degree Polynomials in
Error Detection on the SATIN IV Autovon Error
Patterns", National Technical Information Service,
August 1975.
[CoHa08] Cormode, G. and M. Hadjieleftheriou, "Finding Frequent
Items in Data Streams", Proceedings of the 34th
International Conference on Very Large DataBases
(VLDB), Auckland, New Zealand, Volume 1, Issue 2, pages
1530-1541, August 2008.
[DuLT01] Duffield, N., Lund, C., and M. Thorup, "Charging from
Sampled Network Usage", ACM SIGCOMM Internet
Measurement Workshop (IMW) 2001, pages 245-256, San
Francisco, CA, USA, November 2001.
[Dw01] Dworkin, M., "Recommendation for Block Cipher Modes of
Operation - Methods and Techniques", NIST Special
Publication 800-38A, December 2001.
[EsVa01] Estan, C. and G,. Varghese, "New Directions in Traffic
Measurement and Accounting: Focusing on the Elephants,
Ignoring the Mice", ACM SIGCOMM Internet Measurement
Workshop (IMW) 2001, San Francisco, CA, USA,
November 2001.
[IANA-IPFIX] IANA, "IP Flow Information Export (IPFIX) Entities
Registry", <http://www.iana.org/assignments/ipfix/>.
[KaPS03] Karp, R., Papadimitriou, C., and S. Shenker, "A simple
algorithm for finding frequent elements in sets and
bags", ACM Transactions on Database Systems, Volume 28,
pages 51-55, March 2003.
D'Antonio, et al. Standards Track [Page 31]
^L
RFC 7014 Flow Selection Techniques September 2013
[MSZC10] Mai, J., Sridharan, A., Zang, H., and C. Chuah, "Fast
Filtered Sampling", Computer Networks Volume 54, Issue
11, pages 1885-1898, ISSN 1389-1286, August 2010.
[MaMo02] Manku, G. and R. Motwani, "Approximate Frequency Counts
over Data Streams", Proceedings of the 28th
International Conference on Very Large DataBases
(VLDB), Hong Kong, China, pages 346-357, August 2002.
[RFC2804] IAB and IESG, "IETF Policy on Wiretapping", RFC 2804,
May 2000.
[RFC3917] Quittek, J., Zseby, T., Claise, B., and S. Zander,
"Requirements for IP Flow Information Export (IPFIX)",
RFC 3917, October 2004.
[RFC5226] Narten, T. and H. Alvestrand, "Guidelines for Writing
an IANA Considerations Section in RFCs", BCP 26,
RFC 5226, May 2008.
[RFC5470] Sadasivan, G., Brownlee, N., Claise, B., and J.
Quittek, "Architecture for IP Flow Information Export",
RFC 5470, March 2009.
[RFC6183] Kobayashi, A., Claise, B., Muenz, G., and K. Ishibashi,
"IP Flow Information Export (IPFIX) Mediation:
Framework", RFC 6183, April 2011.
D'Antonio, et al. Standards Track [Page 32]
^L
RFC 7014 Flow Selection Techniques September 2013
Authors' Addresses
Salvatore D'Antonio
University of Napoli "Parthenope"
Centro Direzionale di Napoli Is. C4
Naples 80143
Italy
Phone: +39 081 5476766
EMail: salvatore.dantonio@uniparthenope.it
Tanja Zseby
CAIDA/FhG FOKUS
San Diego Supercomputer Center (SDSC)
University of California, San Diego (UCSD)
9500 Gilman Drive
La Jolla, CA 92093-0505
USA
EMail: tanja.zseby@tuwien.ac.at
Christian Henke
Tektronix Communications Berlin
Wohlrabedamm 32
Berlin 13629
Germany
Phone: +49 17 2323 8717
EMail: christian.henke@tektronix.com
Lorenzo Peluso
University of Napoli
Via Claudio 21
Napoli 80125
Italy
Phone: +39 081 7683821
EMail: lorenzo.peluso@unina.it
D'Antonio, et al. Standards Track [Page 33]
^L
|