Davide Cherubini - PhD Thesis - UniCA Eprints

More documents

Recommendations

Info

References[1] A ∗ algorithm. URL: theory.stanford.edu/~amitp/GameProgramming/. 49[2] Autofocus. URL: www.caida.org/tools/measurement/autofocus/. 34[3] CampusIO. URL: net.doit.wisc.edu/~plonka/FlowScan/CampusIO.html. 34[4] CarrierIN. URL: carrierin.sourceforge.net/. 34[5] CFlowd. URL: www.caida.org/tools/measurement/cflowd/. 30[6] Cisco Netflow. URL: www.cisco.com. 28[7] CPLEX. URL: www.ilog.com/products/cplex/. 15[8] CUFlow. URL: www.columbia.edu/acis/networks/advanced/CUFlow/CUFlow.html. 34[9] Flow-Tools. URL: www.splintered.net/sw/flow-tools/. 30[10] FlowScan. URL: www.caida.org/tools/utilities/flowscan. 30[11] Graph. URL: sorsa.unica.it/crifor/it/software.php. 65[12] INTEC Broadband Communication Networks research group (IBCN). URL:www.ibcn.intec.ugent.be. 68[13] JKFlow. URL: users.telenet.be/jurgen.kobierczynski/jkflow/JKFlow.html. 30, 3485
REFERENCES[14] Jones Lustig Format for Multicommodity Flow Problems. URL: www.di.unipi.it/di/groups/optimize/Data/MMCF.html. 65[15] OPNET. URL: www.opnet.com. 82[16] OsiSolver. URL: www.coin-or.org. 65[17] RFC 2702: Requirements for Traffic Engineering Over MPLS. URL: ftp://ftp.rfc-editor.org/in-notes/rfc2702.txt. 10[18] RRDtool. URL: oss.oetiker.ch/rrdtool/. 34[19] SubnetIO. URL: net.doit.wisc.edu/~plonka/FlowScan/SubNetIO.html.34[20] Tiscali. URL: www.tiscali.com. 27[21] Tiscali International Network. URL: www.tiscali.net. 75[22] ZIB - SNDlib. URL: sndlib.zib.de/home.action. 68[23] S. Low A. Elwalid, C. Jin and I. Widjaja. Multi-path adaptive trafficengineering. Computer Networks, 40:695–709, 2002. 16[24] R. Sarkissian A. Lisser and J.-P. Vial. Solving LP relaxation for survivabilityproblems in telecommunication networks. Investigacion Operativa,9:21–48, 2002. 17[25] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory,algorithms, and applications. Prentice-Hall, Inc., Upper Saddle River, NJ,USA, 1993. 18, 44, 49[26] S. Beker, N. Puech, and V. Friderikos. A Tabu Search heuristic forthe offline MPLS reduced complexity layout design problem. In Networking,pages 514–525, 2004. 16[27] Richard Bellman. On a routing problem. Quarterly of Applied Mathematics,16(1). 4986
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 and 44:
5.2 Traffic monitoringare included
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: optimal configuration of network pa
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

Create successful ePaper yourself

Delete template?

Save as template?