TY - GEN
T1 - Packing strictly-shortest paths in a tree for QoS-aware routing
AU - Yallouz, Jose
AU - Tapolcai, Janos
AU - Korosi, Attila
AU - Berczi, Kristof
AU - Gyimothi, Laszlto
AU - Orda, Ariel
N1 - Publisher Copyright: © 2017 IFIP.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85050503571&partnerID=8YFLogxK
U2 - https://doi.org/10.23919/IFIPNetworking.2017.8264825
DO - https://doi.org/10.23919/IFIPNetworking.2017.8264825
M3 - منشور من مؤتمر
T3 - 2017 IFIP Networking Conference, IFIP Networking 2017 and Workshops
SP - 1
EP - 9
BT - 2017 IFIP Networking Conference, IFIP Networking 2017 and Workshops
T2 - 2017 IFIP Networking Conference and Workshops, IFIP Networking 2017
Y2 - 12 June 2017 through 16 June 2017
ER -