Presentation 2009-11-13
Study of Steiner Tree Algorithms Applied to P2MP TE
Hiroshi MATSUURA, Naotaka MORITA, Kazumasa TAKAMI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Multicast services represented by IPTV require high-quality communication with guaranteed bandwidth reserved by MPLS paths. We put Steiner tree algorithms in a path computation element (PCE) to create the multicast trees, and improve their algorithm speed and seek the cost minimization of created directed multicast trees. In this paper, we compare our proposed Steiner algorithm MARS with conventional popular Steiner algorithms. In the comparison, computational complexity, processing time, and multicast tree cost of each Steiner algorithm are evaluated. In addition, applicability of each algorithm depending on the network features, such as degree of network asymmetry and network link density, is also evaluated.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Steiner Tree / P2MP TE / IPTV / PCE / multicast
Paper # ICM2009-32
Date of Issue

Conference Information
Committee ICM
Conference Date 2009/11/5(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information and Communication Management(ICM)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Study of Steiner Tree Algorithms Applied to P2MP TE
Sub Title (in English)
Keyword(1) Steiner Tree
Keyword(2) P2MP TE
Keyword(3) IPTV
Keyword(4) PCE
Keyword(5) multicast
1st Author's Name Hiroshi MATSUURA
1st Author's Affiliation NTT Service Integration Laboratories, NTT Corporation()
2nd Author's Name Naotaka MORITA
2nd Author's Affiliation NTT Service Integration Laboratories, NTT Corporation
3rd Author's Name Kazumasa TAKAMI
3rd Author's Affiliation Faculty of Engineering, Soka University
Date 2009-11-13
Paper # ICM2009-32
Volume (vol) vol.109
Number (no) 275
Page pp.pp.-
#Pages 6
Date of Issue