Davide Cherubini - PhD Thesis - UniCA Eprints

More documents

Recommendations

Info

REFERENCES[51] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization bysimulated annealing. Science, 220, 4598:671–680, 1983. 22[52] C. C. Ribeiro L. S. Buriol, M. G. C. Resende and M. Thorup. Amemetic algorithm for OSPF routing. In Proc. of the 6 th INFORMS Telecom,pages 187–188, 2002. 15[53] Yu Liu. Spare Capacity Allocation: Model, Analysis, and Algorithm. <strong>PhD</strong>thesis, University of Pittsburgh, School of Information Sciences, 2001. 2, 18[54] Yu Liu and D. Tipper. Spare capacity allocation for non-linear cost andfailure-dependent path restoration. In Proceeding of the 3 rd InternationalWorkshop on Design of Reliable Communication Networks, DRCN, 2001. 18[55] Yu Liu and D. Tipper. Successive survivable routing for node failures. InProceeding of IEEE Global Communications Conference, 2001. 18[56] G. F. Luger. Artificial Intelligence: Structures and Strategies for ComplexProblem Solving. Addison-Wesley Longman Publishing Co. Inc., Boston,MA, USA, 1997. 21[57] M. Resende M. Ericsson and P. Pardalos. A genetic algorithm forthe weight setting problem in OSPF routing. Combinatorial Optimization,6:299–333, 2002. 15[58] H. H. Aly M. F. El-Hawary, M. N. El-Derini. Heuristics for Reroutingof Label Switched Paths in MPLS Based IP Networks. In ISCC ’03:Proceedings of the Eighth IEEE International Symposium on Computers andCommunications, 2003. 16[59] A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C. Chuah,and C. Diot. Characterization of failures in an IP backbone. In IEEEInfocom 2004, IRC-TR-04-015, Hong Kong, China, March 2004, 2004. 12[60] Cristian Murgia. Optimal Telecommunication Network planning withTopological and Quality constraint. <strong>PhD</strong> thesis, Dipartimento di IngegneriaElettrica ed Elettronica, Università di Cagliari, 2007. 17, 6789
REFERENCES[61] A. Nucci, B. Schroeder, S.k Bhattacharrya, N. Taft, andC. Diot. IGP link weight assignment for transient link failures. In 18 thInternational Teletraffic Congress, Berlin, Germany, 2003. 17[62] D. Rajan and A. Atamtürk. A directed cycle based column-and-cutgeneration method for capacitated survivable network design. Networks,43:201–211, 2004. 63[63] Anton Riedl. Optimized routing adaptation in IP networks utilizing OSPFand MPLS. In IEEE 2003 International Conference on Communications(ICC), Anchorage, USA, May 2003, May 2003. 16, 52[64] R. Susitaival and S. Aalto. Adaptive load balancing with OSPF (extendedversion). Technical report, 2005. 15, 16[65] R. Sustiatival, S. Aalto, and J. T. Virtamo. Adaptive load balancingusing MPLS. In MMB, pages 15–24, 2004. 16[66] D. Yuan. A bi-criteria optimization approach for robust OSPF routing. In6 th IEEE Workshop on IP Operation Management (IPOM), 2003. 1790
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 and 96: optimal configuration of network pa
Page 97 and 98: REFERENCES[14] Jones Lustig Format
Page 99: REFERENCES[40] A. V. Fiacco and G.
show all

Davide Cherubini - PhD Thesis - UniCA Eprints

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

Delete template?

Save as template?