Details

Autor(en) / Beteiligte

• Velasquez, Alvaro
• Wojciechowski, Piotr
• Subramani, K.
• Drager, Steven L.
• Jha, Sumit Kumar

Titel

The cardinality-constrained paths problem: Multicast data routing in heterogeneous communication networks

Ist Teil von

• 2016 IEEE 15th International Symposium on Network Computing and Applications (NCA), 2016, p.126-130

Ort / Verlag

IEEE

Erscheinungsjahr

2016

Quelle

IEEE Electronic Library (IEL)

Beschreibungen/Notizen

• 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.