Davide Cherubini - PhD Thesis - UniCA Eprints

More documents

Recommendations

Info

5.2 Traffic monitoring• flow-merge - Merge flow files in chronoligical order.• flow-xlate - Perform translations on some flow fields.• flow-expire - Expire flows using the same policy of flow-capture.• flow-header - Display meta information in flow file.• flow-split - Split flow files into smaller files based on size, time, or tags.• flow-print - Display on screen information requested using, for example,flow-cat.Figure 5.4 shows an example of the using flow-print/flow-cat. It is possible to retrieveinformation about the source/destination IP address, the type of protocol,the source/destination port, the dimension and the number of packets constitutingthe flow.Figure 5.4: flow-print example5.2.2.3 FlowScanNetFlow data reports, generated with Flow-Tools, can be managed and displayedalso using different open source instruments that are freely downloadable from33
5.2 Traffic monitoringthe Internet.FlowScan is a set of PERL scripts and modules that binds together:1. the flow collector (Flow-Tools);2. a high performance Round Robin Database [18];3. a visualization tool.From the files created by Flow-Tools, FlowScan maintains counters reflectingwhat was found. These counter values are stored using the Round Robin Databaseand visualized in a friendly graphical fashion. FlowScan only permits a roughanalysis of the data and, in the last few years, several modules with differentlevels of granularity have been developed, such as CampusIO [3], SubnetIO [19],Autofocus [2], CarrierIn [4], CUFlow [8] and, mainly, JKFlow [13].5.2.2.4 JKFlowThe FlowScan modules enlisted in the previous subsection, have multiple distinctfunctionalities (e.g. CampusIO can report flows per services, while CUFlow providesexcellent reporting on services for different routers) but do not have thecapability to report site-to-site flows. JKFlow [13] is able to solve that problemis an easy and flexible to configure XML-FlowScan module, with the followingbasic concepts:• Sites / Subnets - define source/destination subnets (e.g. a Country andits subnets)• Directions - selects flows matching specific source/destination, sites/subnetswith the possibility to define traffic pattern to be monitored, such as applications,services, protocols, and the total traffic.• Outbound traffic - matches source address matching “from” sites/subnetsand destination address with “to” sites/subnets. Inbound traffic - matchesotherwise.• Multiple Directions - it is possible to monitor multiple directions and,within each of them, it is possible to specify different traffic patterns.34
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 and 42: 5.2 Traffic monitoringExporting the
Page 43: 5.2 Traffic monitoringare included
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?