Davide Cherubini - PhD Thesis - UniCA Eprints

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. PhDthesis, 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. PhD thesis, Dipartimento di IngegneriaElettrica ed Elettronica, Università di Cagliari, 2007. 17, 6789