Hop-Constrained Tree-Shaped Networks

Abstract : 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.
Type de document :
Chapitre d'ouvrage
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〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01122335
Contributeur : Estelle Bouzat <>
Soumis le : mardi 3 mars 2015 - 16:01:56
Dernière modification le : lundi 21 mars 2016 - 11:29:07

Identifiants

Collections

Citation

Marta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes. Hop-Constrained Tree-Shaped Networks. 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〉. 〈hal-01122335〉

Partager

Métriques

Consultations de la notice

91