By Topic

A heuristic approach for solving the virtual topology design problem in next generation networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Nihed Bahria El Asghar ; High School of Communications of Tunisia, Sup'Com University of Carthage, Ariana, Tunisia ; Awatef Ben Fradj ; Mounir Frikha ; Sami Tabbane

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.

Published in:

Wireless Personal Multimedia Communications (WPMC), 2011 14th International Symposium on

Date of Conference:

3-7 Oct. 2011