Hop-Constrained Tree-Shaped Networks

Authors :: Monteiro, Marta S. R.
Fontes, Dalila B. M. M.
Fontes, Fernando A. C. C.
Departamento de Engenharia Electrotécnica e de Computadores [Porto] (DEEC)
Universidade do Porto = University of Porto
Sergiy Butenko
Eduardo L. Pasiliao
Volodymyr Shylo
European Project: 264735,EC:FP7:PEOPLE,FP7-PEOPLE-2010-ITN,SADCO(2011)
Universidade do Porto
Source :: Examining Robustness and Vulnerability of Networked Systems, Sergiy Butenko; Eduardo L. Pasiliao; Volodymyr Shylo. Examining Robustness and Vulnerability of Networked Systems, IOS, pp.192-208, 2014, NATO Science for Peace and Security Series-D: Information and Communication Security, 978-1-61499-390-2. ⟨10.3233/978-1-61499-391-9-192⟩
Publication Year :: 2014
Publisher :: HAL CCSD, 2014.
Abstract: International audience; Hop constraints are used to limit the number of links between two given points in a network, this way improving the quality of service by increasing the availability and reliability of the network. They have been applied to a limited number of problems, although their application can be of the greatest importance both from the academical and practical points-of-view. In this work, we survey relevant and recent works on hop-constrained problems focusing on problems with tree shaped solutions.

Subjects :: [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]

Language :: English
ISBN :: 978-1-61499-390-2
ISBNs :: 9781614993902
Database :: OpenAIRE
Journal :: Examining Robustness and Vulnerability of Networked Systems, Sergiy Butenko; Eduardo L. Pasiliao; Volodymyr Shylo. Examining Robustness and Vulnerability of Networked Systems, IOS, pp.192-208, 2014, NATO Science for Peace and Security Series-D: Information and Communication Security, 978-1-61499-390-2. ⟨10.3233/978-1-61499-391-9-192⟩
Accession number :: edsair.dedup.wf.001..a0708e3a98d223aaf321629f56fe7056
Full Text :: https://doi.org/10.3233/978-1-61499-391-9-192⟩