P. Jokela, A. Zahemszky, C. E. Rothenberg, S. Arianfar, and P. , Nikander: LIPSIN: line speed publish/subscribe inter-networking, Proc. of SIGCOMM, 2009.

A. N. Letchford, J. Lysgaard, and R. W. , A branch-and-cut algorithm for the capacitated open vehicle routing problem, Journal of the Operational Research Society, vol.56, issue.12, pp.1642-1651, 2007.
DOI : 10.1057/palgrave.jors.2601848

L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Informatica, vol.30, issue.2, pp.141-145, 1981.
DOI : 10.1007/BF00288961

W. Chen, P. Sheu, and Y. Chang, Efficient multicast source routing scheme, Computer Communications, vol.16, issue.10, pp.662-666, 1993.
DOI : 10.1016/0140-3664(93)90083-5

T. P. Yum and M. S. Chen, Multicast source routing in packet-switched networks, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings, pp.1212-1215, 1994.
DOI : 10.1109/INFCOM.1991.147652

X. Zhang, J. Y. Wei, and C. Qiao, Constrained multicast routing in WDM networks with sparse light splitting, Journal of Lightwave Technology, vol.18, issue.12, pp.1917-1927, 2000.
DOI : 10.1109/50.908787

T. Koch and A. Martin, Solving Steiner tree problems in graphs to optimality, Networks, vol.32, issue.3, pp.207-232, 1998.
DOI : 10.1002/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O

I. Ljubic, R. Weiskircher, U. Pferschy, G. W. Klau, P. Mutzel et al., Solving the prize-collecting Steiner tree problem to optimality, Proc. of ALENEX workshop, SIAM, 2005.

V. Sharma and F. Hellstrand, Framework for Multi-Protocol Label Switching (MPLS)based Recovery, 2003.
DOI : 10.17487/rfc3469

M. Doar and I. Leslie, How bad is naive multicast routing?, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings, 1993.
DOI : 10.1109/INFCOM.1993.253246

L. Barenboim and M. , Elkin: Distributed (? + 1)-coloring in linear (in ?) time, Proc. of the 41st Symposium on Theory of Computing, 2009.

J. Leskovec, J. Kleinberg, and C. , Faloutsos: Graph evolution: Densification and shrinking diameters, In: ACM Transactions on Knowledge Discovery from Data (TKDD), vol.1, issue.1, 2007.

J. Zhao, P. Zhu, X. Lu, and L. Xuan, Does the Average Path Length Grow in the Internet?, Proc. of ICOIN, 2007.
DOI : 10.1145/505680.505683

E. W. Zegura, K. Calvert, and S. Bhattacharjee, How to model an internetwork, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications, 1996.
DOI : 10.1109/INFCOM.1996.493353

B. Yang and P. Mohapatra, Edge router multicasting with MPLS traffic engineering, Proc. of ICON, 2002.

A. Boudani and B. , Cousin: A New Approach to Construct Multicast Trees in MPLS Networks, Proc. of ISCC, 2002.

D. Bertsimas and J. N. , Tsitsiklis: Introduction to Linear Optimization, 1997.