Davide Cherubini - PhD Thesis - UniCA Eprints

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