Title :
A heuristic approach for solving the virtual topology design problem in next generation networks
Author :
El Asghar, Nihed Bahria ; Ben Fradj, Awatef ; Frikha, Mounir ; Tabbane, Sami
Author_Institution :
High Sch. of Commun. of Tunisia, Sup´´Com Univ. of Carthage, Ariana, Tunisia
Abstract :
The Next Generation Internet is intended to be an IP/WDM network which can be optimized using virtual topology based traffic engineering. In this paper we study the NP-hard Virtual Topology Design (VTD) problem for which we propose a MILP (Mixed Integer Linear Program) formulation with a tradeoff object between saving resources and minimum delay traffic handling. To solve it for large scale backbone networks, we propose a multi-weighted graph illustration of the problem and use a Pareto-based heuristic to solve it. We have applied the proposed heuristic for a load-based weight and a transit-based weight. The obtained results have shown better solutions for the transit-based weight.
Keywords :
IP networks; Internet; Pareto distribution; computational complexity; next generation networks; optimisation; telecommunication network topology; telecommunication traffic; wavelength division multiplexing; IP/WDM network; NP-hard virtual topology design; Pareto-based heuristic; delay traffic handling; mixed integer linear program; multiweighted graph illustration; next generation Internet; next generation networks; tradeoff object; traffic engineering; virtual topology design problem; Algorithm design and analysis; IP networks; Network topology; Routing; Silicon; Topology; Wavelength division multiplexing; MILP; MWPA; Pareto optimality; heuristic; multi-weighted; virtual topology;
Conference_Titel :
Wireless Personal Multimedia Communications (WPMC), 2011 14th International Symposium on
Conference_Location :
Brest
Print_ISBN :
978-1-4577-1786-4
Electronic_ISBN :
1347-6890