Presentation	2011-11-10 Study of Steiner Algorithms Optimizing Multicast Path Cost and Network Resource Hiroshi MATSUURA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Multicast services represented by IPTV require high-quality communications assuring their required bandwidths. On the other hand, because of the huge traffic, lack of network resources such as MPLS labels is now being emerged. We run Steiner algorithms in a PCE (path computation element) and aim to create a directed multicast tree that has the minimum tree-cost and smaller number of MPLS labels to establish the multicast tree. In this paper, a new parameter is added to our proposed Steiner algorithm MARS and it is compared with other conventional major Steiner algorithms in their tree-costs and necessary number of MPLS labels required for their trees.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Steiner Tree / P2MP TE / IPTV / PCE / multicast
Paper #	ICM2011-21
Date of Issue

Conference Information
Committee	ICM
Conference Date	2011/11/3(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 Algorithms Optimizing Multicast Path Cost and Network Resource
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()
Date	2011-11-10
Paper #	ICM2011-21
Volume (vol)	vol.111
Number (no)	279
Page	pp.pp.-
#Pages	6
Date of Issue