DocumentCode
2522541
Title
Evaluation of MPLS P2MP Distribution Tree Algorithms
Author
Matsumura, R. ; Inoue, M. ; Tsujino, M. ; Iwashita, Motoi
Author_Institution
NTT Service Integration Labs., NTT Corp., Musashino
fYear
2008
fDate
Sept. 28 2008-Oct. 2 2008
Firstpage
1
Lastpage
15
Abstract
Dynamic Steiner heuristic algorithm with hop constraint such as CMPH attains low cost and high QoS at the same time. Addition of suitable hop constraint does not mean increase of network cost. Estimation on more realistic network is future study.
Keywords
multicast communication; multiprotocol label switching; telecommunication traffic; trees (mathematics); CMPH; MPLS P2MP distribution tree algorithms; constrained minimum cost path heuristic; dynamic Steiner heuristic algorithm; hop constraint; multiprotocol label switching point to multipoint; Computer networks; Costs; Joining processes; Multicast algorithms; Multicast protocols; Multiprotocol label switching; Network topology; Quality of service; Routing; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications Network Strategy and Planning Symposium, 2008. Networks 2008. The 13th International
Conference_Location
Budapest
Print_ISBN
978-963-8111-68-5
Type
conf
DOI
10.1109/NETWKS.2008.4763713
Filename
4763713
Link To Document