Packing strictly-shortest paths in a tree for QoS-aware routing

Jose Yallouz, Janos Tapolcai, Attila Korosi, Kristof Berczi, Laszlto Gyimothi, Ariel Orda

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Spanning trees are a basic and important network design tool, which constitutes an efficient infrastructure for broadcasting and routing protocols. The number of shortest-paths covered by a spanning tree is a metric of major importance for evaluating the 'quality' of the tree. However, typically, demanding that the connection would be precisely through a shortest path is essential only for a few source-destination pairs with strict communication requirements (critical-demands). Accordingly, we define the covering effectiveness of a spanning tree as the proportion of critical-demands whose paths in the spanning tree are indeed shortest in the network. We provide a rigorous study of this novel metric and classify several optimization problems. Specifically, we are interested in scenarios where the critical-demands originate at a few selected nodes. According to the tractability of the considered problems, we derive either optimal or heuristic solutions for finding a spanning tree with maximum covering effectiveness. Then, through extensive simulations, we demonstrate the effectiveness of our solutions. Most notably, we indicate that the quite common approach, in which a (spanning) shortest-paths tree from a single source node is selected, is often unsuitable for the scenario where critical-demands are associated with more than one pair of nodes.

Original languageEnglish
Title of host publication2017 IFIP Networking Conference, IFIP Networking 2017 and Workshops
Pages1-9
Number of pages9
ISBN (Electronic)9783901882944
DOIs
StatePublished - 2 Jul 2017
Event2017 IFIP Networking Conference and Workshops, IFIP Networking 2017 - Stockholm, Sweden
Duration: 12 Jun 201716 Jun 2017

Publication series

Name2017 IFIP Networking Conference, IFIP Networking 2017 and Workshops
Volume2018-January

Conference

Conference2017 IFIP Networking Conference and Workshops, IFIP Networking 2017
Country/TerritorySweden
CityStockholm
Period12/06/1716/06/17

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Packing strictly-shortest paths in a tree for QoS-aware routing'. Together they form a unique fingerprint.

Cite this