On The Expansion Problem of Reliable ip Networks with Performance Guarantees

Abstract

In this paper, we tackle the problem of how to expand Internet protocol (IP) networks with performance guarantees in a cost-effective way. We firsi propose an optimization model that deals wilh selecting the location of the routers, selecting their types, expanding (he access and the backbone networks and selecting the transmission link types. The model also considers the routing of the IP traffic using a standardized routing protocol. The pcrtbrmance guarantees we refer to are bandwidth guarantees between the clients' routers. The performance guarantees stand not only for the nonnal state of the network, but also for all failure scenarios of interest to the network planner. A tabu-based metaheuristic algorithm is proposed to find solutions of the model. Numerical results show that "good" solutions can be found using the proposed algorithm.Keywords: Internet protocol (IP): IP network planning; access and backbone networks; metaheuristic; tabu search RESUME Dans cet article, nous traitons du probleme de I'expansion des r^seaux IP (Internet Protocol) avec garantic de pedbrmance el ce en minimisant le cout du icseau. Dans un premier temps, nous proposons un modele comprenant la localisation et la configuration dcs routeurs, I'expansion des reseaux d'acces et etendu et le choix des liens dc transmission. De plus, la garanlie de performance est desiree non seutement pour I'ctat normal du reseau mais aussi pour les scenarios de pannes d'interets pour ie planiHcateur du teseau. Ensuite, nous presentons une mctaheuristique basee sur la recherche avec tabous pour trouver des solutions. Lcs lesultats numeriques montrent que de bonnes solutions peuvent etre obtenues avec l'approche proposee.Mots-cles : Internet protocol (IP); planification de rcseaux; reseaux d'acces et etendu; metaheuristique; recherche avec tabous

An Analysis of Three-Level IP Network Topologies

“…This problem has not been considered before in the literature. In fact, several authors have proposed models and solution algorithms for the two-level network design problem (see Klincewicz [5] and the references contained therein and, for more recent papers, see Carrello et al [1], Chamberland [2] and Yaman and Carello [6]). …”

Incorporating Point of Interconnect within the Australian National Broadband Network

“…The two-level network design problem, without including the design of the Points of Presence (PoP), has been considered by several authors (for an exhaustive review of the papers published before 1998, see Klincewicz [10] and for more recent papers, see Carrello et al [1], Chamberland [3], Yaman and Carello [11]). However, only a few authors have considered switch or router modularity in the two-level network design problem.…”

“…The algorithm produced solutions that were, on average, within 1.93% of the optimal solution. An extended version of the problem was developed by Chamberland [2] and included additional performance and reliability constraints. The solutions found were, on average, within 1.16% of the optimal solution.…”

Designing Two-Level IP Networks Including the Points of Presence

“…The two-level network design problem (without including the design of the points of presence) has been considered by several authors (for an exhaustive review of the papers published before 1998, see Klincewicz [13] and for more recent papers, see Carrello et al [2], Chamberland [4], Yaman and Carello [14] and the references contained therein). However, only a few authors have considered switch or router modularity in the two-level network design problem.…”