PPC11
Summary
Pedro Pedroso, Dimitri Papadimitriou and Davide Careglio (2011) Dynamic compact multicast routing on power-law graphs. In in Proceedings of 2011 IEEE Global Communication Conference (Globecom 2011). Houston, TX, USA, dec. ((URL)) (PDF)
Abstract
Compact routing schemes address the fundamental tradeoff between the memory space required to store the routing table entries and the length of the routing paths that these schemes produce. This paper introduces the first known name- independent, leaf-initiated dynamic compact routing scheme that allows the distribution of traffic from any source to any set of leaf nodes along a multicast routing path that defines a distribution tree. By means of the proposed scheme, a multicast distribution tree dynamically evolves according to the arrival of leaf-initiated join/leave requests. To evaluate the performance we consider the following metrics: the stretch of the produced routing paths, the size and the number of routing table entries, and the communication cost. The results obtained by simulation on synthetic power law graphs (modeling the Internet topology) show that our scheme can successfully handle leaf-initiated dynamic setup of multicast distribution trees. Two reference multicast routing schemes (the Shortest Path Tree and the Steiner Tree algorithm) are used to compare the performance of the proposed scheme. While increasing the communication cost compared to the Shortest Path Tree, the proposed scheme achieves considerable reduction of the routing table size compared to both reference schemes. Moreover, the stretch of the resulting multicast routing paths show limited deterioration compared to the minimum value obtained with Steiner Trees.
Bibtex entry
@INPROCEEDINGS { PPC11,
AUTHOR = { Pedro Pedroso and Dimitri Papadimitriou and Davide Careglio },
TITLE = { Dynamic compact multicast routing on power-law graphs },
BOOKTITLE = { in Proceedings of 2011 IEEE Global Communication Conference (Globecom 2011) },
YEAR = { 2011 },
MONTH = { dec },
ADDRESS = { Houston, TX, USA },
ABSTRACT = { Compact routing schemes address the fundamental tradeoff between the memory space required to store the routing table entries and the length of the routing paths that these schemes produce. This paper introduces the first known name- independent, leaf-initiated dynamic compact routing scheme that allows the distribution of traffic from any source to any set of leaf nodes along a multicast routing path that defines a distribution tree. By means of the proposed scheme, a multicast distribution tree dynamically evolves according to the arrival of leaf-initiated join/leave requests. To evaluate the performance we consider the following metrics: the stretch of the produced routing paths, the size and the number of routing table entries, and the communication cost. The results obtained by simulation on synthetic power law graphs (modeling the Internet topology) show that our scheme can successfully handle leaf-initiated dynamic setup of multicast distribution trees. Two reference multicast routing schemes (the Shortest Path Tree and the Steiner Tree algorithm) are used to compare the performance of the proposed scheme. While increasing the communication cost compared to the Shortest Path Tree, the proposed scheme achieves considerable reduction of the routing table size compared to both reference schemes. Moreover, the stretch of the resulting multicast routing paths show limited deterioration compared to the minimum value obtained with Steiner Trees. },
PDF = { File:Publications/GC2010_pedro.pdf },
URL = { http://www.ieee-globecom.org/2011/ },
}