Title
The Cardinality-Constrained Paths Problem: Multicast Data Routing In Heterogeneous Communication Networks
Abstract
In this paper, we present two new problems and a theoretical framework that can be used to route information in heterogeneous communication networks. These problems are the cardinality-constrained and interval-constrained paths problems and they consist of finding paths in a network such that cardinality constraints on the number of nodes belonging to different sets of labels are satisfied. We propose a novel algorithm for finding said paths and demonstrate the effectiveness of our approach on networks of various sizes.
Publication Date
12-8-2016
Publication Title
Proceedings - 2016 IEEE 15th International Symposium on Network Computing and Applications, NCA 2016
Number of Pages
126-130
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
DOI Link
https://doi.org/10.1109/NCA.2016.7778606
Copyright Status
Unknown
Socpus ID
85010408122 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/85010408122
STARS Citation
Velasquez, Alvaro; Wojciechowski, Piotr; Subramani, K.; Drager, Steven L.; and Jha, Sumit Kumar, "The Cardinality-Constrained Paths Problem: Multicast Data Routing In Heterogeneous Communication Networks" (2016). Scopus Export 2015-2019. 4231.
https://stars.library.ucf.edu/scopus2015/4231