Virtual topology design and flow routing in optical networks under multi-hour traffic demand
View/ Open
Share
Statistics
View Usage StatisticsMetadata
Show full item recordAuthor
Pavón Mariño, Pablo; Aparicio Pardo, Ramón; Skorin-Kapov , Nina; García Manrubia, María BelénResearch Group
Grupo de Ingeniería Telemática (GIT)Knowledge Area
Ingeniería TelemáticaSponsors
The work described in this paper was carried out with the support of the BONE project (“Building the Future Optical Network in Europe”); a Network of Excellence funded by the European Commission through the 7th ICT-Framework Program. This research has been partially supported by the projects from the Spanish Ministry Of Education TEC2007-67966-01/TCM CON-PARTE-1, and TEC2008-02552-E, and it is also developed in the framework of the projects from Fundación Seneca (Regional Agency of Science and Technology of Region of Murcia ) 00002/CS/08 (FORMA) and "Programa de Ayudas a Grupos de Excelencia de la Región. de Murcia”, F. Séneca (Plan Regional de Ciencia y Tecnología 2007/2010).".Publication date
2010-02Publisher
SpringerBibliographic Citation
PAVÓN MARIÑO, Pablo, APARICIO PARDO, Ramón, GARCÍA PARDO, Ramón, SKORIN KAPOV, Nina. Photonic Network Communications, 19 (1): 42-54, February 2010. ISSN 1387-974XPeer review
SíKeywords
Diseño virtual de la topologíaFlujos de enrutamiento
Tráfico periódico
Dominación del tráfico
Virtual Topology Design
Flow routing
Periodic traffic
Traffic domination
Abstract
This paper addresses the problem of finding a static
virtual topology design and flow routing in transparent optical
WDM networks under a time-varying (multi-hour) traffic
demand. Four variants of the problem are considered, using
fixed or dynamically adaptable (i.e., variable) flow routing,
which can be splittable or unsplittable. Our main objective is
to minimize the number of transceivers needed which make up
for the main network cost. We formulate the problem variants
as exact ILPs (Integer Linear Programs) and MILPs (Mixed
ILPs). For larger problem instances, we also propose a family
of heuristics based on the concept of domination between
traffic matrices. This concept provides the theoretical
foundations for a set of techniques proposed to reduce the
problem complexity. We present a lower bound to the network
cost for the case in which the virtual topology could be
dynamically reconfigured along time. This allows us to assess
the limit on the maximum possible benefit ...
Collections
- Artículos [1713]
The following license files are associated with this item:
Social media