Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure

REFERENCES

• Ahuja, R. K., Magnanti, T.L., and Orlin, J. B. (1993), Network Flows: Theory, Algorithms, and Application, Prentice-Hall.
   Google Scholar
• Andrews, M. and Zhang, L. (1998), The Access Network Design Problem, Annual Symposium on Foundations of Computer Science (FOCS).
   Google Scholar
• Balas, E. (1989), “The prize collecting traveling salesman problem”, Networks, 19: 621–636.
   Web of Science ®Google Scholar
• Ball, M. O., Colbourn, C. J., and Provan, J. S. (1995), “Network reliability”, Network models, Handbook of Operations Research and Management Science, 8.
   Google Scholar
• Ben-Ameur, W., Michel, N., Gourdin, E., and Lieu, B. (2001), “Routing strategies for IP networks”, Telektronikk, 97(2–3): 145–158.
   Google Scholar
• Carello, G., Della Croce, F., Ghirardi, M., and Tadei, R. (2004), “Solving the hub location problem in telecommunication network design: a local search approach”, Networks, 44(2): 94–105.
   Web of Science ®Google Scholar
• Chamberland, S. (2005), “On the expansion problem of reliable IP networks with performance guarantees”, INFOR, 43(4): 341–359.
   Web of Science ®Google Scholar
• Chamberland, S. (2008), “Designing low cost access networks with IPTV performance constraints”, Proceedings of IEEE EURO-NGI Conference on Next Generation Internet Networks.
   Google Scholar
• Chamberland, S. and Sansó, B. (1997), “Sequential and parallel approaches to incorporate reliability in the synthesis of computer networks”, Journal of Network and Systems Management, 5(2): 131–157.
   Google Scholar
• Chamberland, S. and Sansó, B. (2000), “Topological expansion of metropolitain area networks”, Networks, 36(4): 210–224.
   Web of Science ®Google Scholar
• Chamberland, S. and Sansó, B. (2001), “On the design of multi-technology networks”, INFORMS Journal of Computing, 13(3): 245–256.
   Web of Science ®Google Scholar
• Ericsson, M., Resende, M. G. C., and Pardalos, P. M. (2002), “A genetic algorithm for the weight setting problem in OSPF routing”, Journal of Combinatorial Optimization, 6(3): 299–333.
   Web of Science ®Google Scholar
• Feldmann, A., Greenberg, A., Lund, C., Reingold, N., and Rexford, J. (2000), “NetScope: traffic engineering for IP networks”, IEEE Network, 14(2): 11–19.
   Web of Science ®Google Scholar
• Fortz, B., Rexford, J., and Thorup, M. (2002), “Traffic engineering with traditional IP routing protocols”, IEEE Communications Magazine, 40(10): 118–124.
   Web of Science ®Google Scholar
• Fortz, B. and Thorup, M. (2000), “Internet traffic engineering by optimizing OSPF weights”, Proceedings of IEEE Conference on Computer Communications (INFOCOM), pp. 519–528.
   Google Scholar
• Girard, A., Sansó, B., and Dadjo, L. (2001), “A tabu search algorithm for access network design”, Annals of Operations Research, 106: 229–262.
   Web of Science ®Google Scholar
• Glover, F. and Laguna, M. (1997), Tabu Search, Kluwer Academic Publisher.
   Google Scholar
• ILOG, Inc. (2005), Using the CPLEX Callable Library and CPLEX Mixed Integer Library, ILOG, Inc.
   Google Scholar
• Jonker, R. and Volgenant, T. (1987), “A shortest augmenting path algorithm for dense and sparse linear assignment problems” Computing, 38(4): 325–340.
   Web of Science ®Google Scholar
• Klincewicz, J. G. (1998), “Hub location in backbone-tributary networks: a review”, Location Science, 6(1–4): 307–335.
   Google Scholar
• Kumar, R., Parida, P. P., and Gupta, M. (2002), Topological Design of Communication Networks using Multiobjective Genetic Optimization, World Congress on Computational Intelligence (WCCI), pp. 425–430.
   Google Scholar
• Moy, J. (1998), “OSPF Version 2”, RFC2328. Available [online]: www.ietf.org.
   Google Scholar
• Sansó, B., Gendreau, M., and Soumis, F. (1992), “An algorithm for network dimensioning under reliability considerations”, Annals of Operations Research, 36: 263–274.
   Google Scholar
• Sherali, H. D., Lee, Y., and Park, T. (2000), “New modeling approaches for the design of local access transport area networks”, European Journal of Operational Research, 127: 94–108.
   Web of Science ®Google Scholar
• Stevens, W. R. (1994), TCP/IP Illustrated, Volume 1: The Protocols, Addison-Wesley Professional Computing Series.
   Google Scholar
• van der Merwe, D.J. and Hattingh, J. M. (2006), “Tree knapsack approaches for local access network design”, European Journal of Operational Research, 174: 1968–1978.
   Web of Science ®Google Scholar
• Yaman, H. and Carello, G. (2005), “Solving the hub location problem with modular link capacities”, Computers and Operations Research, 32(12): 3227–3245.
   Web of Science ®Google Scholar