Davide Cherubini - PhD Thesis - UniCA Eprints

More documents

Recommendations

Info

5.2 Traffic monitoringcollector, the analyzer, and the Web Server are condensed in a single hardwaredevice.Figure 5.3: NetFlow collector architecture5.2.2.1 CFlowdCAIDA’s CFlowd is a flow analysis tool released to enable ISPs to collect datafrom NetFlow routers. This analysis package is composed by three programs:cflowdmux, cflowd, and cfdcollect.cflowdmux accepts Cisco flow-export packets arriving from the NetFlow routersas UDP packets and saves them in shared memory buffers.Directly from these buffers, cflowd creates tabular data to be inputted to cfdcollect,which will store these data in different files.Currently, CFlowd is no longer supported by the CAIDA team, and this isthe reason that pushed this work to consider a different tool, that is Flow-Tools.5.2.2.2 Flow-ToolsFlow-Tools is a set of programs for processing and generating reports from Net-Flow data. The tools can run in a single server as well as in multiple servers forlarge collecting networks and it is compatible with several versions of NetFlow.NetFlow data is collected, by default, every 30 seconds and stored in portablefiles every 5 minutes. These files may be analyzed by the following programs that31
5.2 Traffic monitoringare included in the Flow-Tools distribution (the list is directly reported from theFlow-Tools documentation).• flow-capture - Collect, compress, store, and manage disk space for exportedflows from a router.• flow-cat - Concatenate flow files. Typically flow files will contain a smallwindow of 5 or 15 minutes of exports. Flow-cat can be used to append filesfor generating reports that span longer time periods.• flow-fanout - Replicate NetFlow datagrams to unicast or multicast destinations.Flow-fanout is used to facilitate multiple collectors attached to asingle router.• flow-report - Generate reports for NetFlow data sets. Reports includesource/destination IP pairs, source/destination AS, and top talkers. Over50 reports are currently supported.• flow-tag - Tag flows based on IP address or AScnumber. Flow-tag is usedto group flows by customer network. The tags can later be used with flowfanoutor flow-report to generate customer based traffic reports.• flow-filter - Filter flows based on any of the export fields. Flow-filter is usedin-line with other programs to generate reports based on flows matchingfilter expressions.• flow-import - Import data from ASCII or cflowd format.• flow-export - Export data to ASCII or cflowd format.• flow-send - Send data over the network using the NetFlow protocol.• flow-receive - Receive exports using the NetFlow protocol without storingto disk like flow-capture.• flow-gen - Generate test data.• flow-dscan - Simple tool for detecting some types of network scanning andDenial of Service attacks.32
Page 4 and 5: AcknowledgementsThis dissertation w
Page 6 and 7: AbstractThis dissertation investiga
Page 9 and 10: CONTENTS7.4 The Real ISP’s Italia
Page 11 and 12: LIST OF FIGURES7.3 Default metrics
Page 13 and 14: 1.2 Objectives of the dissertation2
Page 15 and 16: Chapter 2Basic knowledgeThis chapte
Page 17 and 18: 2.1 Understanding IS-IS• A = sour
Page 19 and 20: 2.2 Understanding MPLS Technology2.
Page 21 and 22: 2.2 Understanding MPLS TechnologyTh
Page 23 and 24: 2.4 Restoration SchemesHowever, fai
Page 26 and 27: 3.1 Optimization of IS-IS/OSPF rout
Page 28: 3.3 Survivability problemhas been d
Page 31 and 32: 4.1 Heuristic Algorithmsmeta-heuris
Page 33 and 34: 4.1 Heuristic Algorithmsto keep a c
Page 35 and 36: 4.1 Heuristic Algorithmsprobability
Page 37 and 38: 4.3 Linear Programming ApproachExam
Page 39 and 40: 5.2 Traffic monitoring• 60% of th
Page 41: 5.2 Traffic monitoringExporting the
Page 45 and 46: 5.2 Traffic monitoringthe Internet.
Page 47 and 48: 5.2 Traffic monitoring5.2.3 The net
Page 49 and 50: 5.2 Traffic monitoring5.2.4 Monitor
Page 51 and 52: 5.2 Traffic monitoringFigure 5.9: S
Page 53 and 54: Chapter 6LP Optimization ModelsThis
Page 55 and 56: 6.2 Graphs and Network Flowswith a
Page 57 and 58: 6.2 Graphs and Network FlowsWhere B
Page 59 and 60: 6.2 Graphs and Network Flows6.2.3 T
Page 61 and 62: 6.3 Multicommodity Flow Problemscom
Page 63 and 64: 6.4 LP modelsThe second layer intro
Page 65 and 66: 6.4 LP modelsEquation 6.32 is the o
Page 67 and 68: 6.4 LP modelsmalized as follows:z =
Page 69 and 70: 6.4 LP models(a) Rerouting flow p
Page 71 and 72: 6.4 LP models(a) 1 st solution(b) 2
Page 73 and 74: 6.4 LP models∑f∈Fx f,lij⎛⎝i
Page 75 and 76: 6.4 LP modelsterm is the MPLS part
Page 77 and 78: 7.2 The highly meshed network7.2 Th
Page 79 and 80: 7.3 The IBCN European network7.3 Th
Page 81 and 82: 7.3 The IBCN European networkmaximu
Page 83 and 84: 7.3 The IBCN European networkSurviv
Page 85 and 86: 7.3 The IBCN European networkFigure
Page 87 and 88: 7.4 The Real ISP’s Italian Backbo
Page 93 and 94:
7.5 Conclusion and validation of re
Page 95 and 96:
optimal configuration of network pa
Page 97 and 98:
REFERENCES[14] Jones Lustig Format
Page 99 and 100:
REFERENCES[40] A. V. Fiacco and G.
Page 101:
REFERENCES[61] A. Nucci, B. Schroed
show all

Davide Cherubini - PhD Thesis - UniCA Eprints

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?