Scalable multicast MPLS protocol for next generation broadband service convergence network

Yasukawa, Seisho; Sugisono, Koji; Inoue, Ituro; Urushidani, Shigeo

doi:10.1109/icc.2004.1312655

Cited by 7 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, RSVP-TE-based signaling has been extended for multicast path setting [5], and a PCE has been proposed for determining the routes of point to multi point (P2MP) paths [6].…”

Section: Introductionmentioning

confidence: 99%

Proposal of new steiner tree algorithm applied to P2MP traffic engineering

Matsuura

2012

2012 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

There are many polynomial-time heuristic Steiner tree algorithms since seeking the minimum point to multi point (P2MP) tree in a network, which is known as the Steiner problem in networks (SPN), is nondeterministic polynomial time complete. Takahashi and Matsuyama's minimum-cost path heuristic algorithm (MPH) is widely applied to various multicast services. MPH has to run Dijkstra's algorithm m times in its algorithm process, where m is the number of end nodes of the multicast tree. + n log n)). By using Fibonacci heaps (F-heaps), the time complexity of MPH is O(m(l + n log n)), where l is the number of links and n is the number of nodes on the network. A new Steiner tree algorithm called branch-based multi-cast (BBMC) is proposed for this study, which produces exactly the same P2MP tree as MPH does. BBMC shortens MPH's average time complexity to O((log m)(l In addition, the algorithm speed of BBMC is much faster than that of MPH because BBMC does not use Dijkstra's algorithm in its algorithm process and drastically reduces the number of accesses to the F-heaps. MPH's processing time increasesproportionally to m, especially when m is large, but BBMC's processing time is almost independent from m. The speed of BBMC is about the same as that of the destination-driven multi-cast algorithm (DDMC), which has a time complexity of O(l + n log n), though BBMC produces a P2MP tree with a tree cost much smaller than that of DDMC.

show abstract

“…Recently, RSVP-TE-based signaling has been extended for multicast path setting [5], and a PCE has been proposed for determining the routes of point to multi point (P2MP) paths [6].…”

Section: Introductionmentioning

confidence: 99%

Proposal of new steiner tree algorithm applied to P2MP traffic engineering

Matsuura

2012

2012 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

show abstract

“…Recently, IETF has presented a set of requirements for P2MP TE extensions to Multi Protocol Label Switching (MPLS) [1]. A scalable multicast MPLS protocol is also proposed [2], [3], and the network framework is not limited to the packet switched networks, but also includes SDH/SONET, lambda and port switching networks managed by Generalized MPLS (GM-PLS) protocols. In this architecture, multicast tree is achieved by source node calculating explicit route and without running a multicast routing protocol in the network core.…”

Section: Introductionmentioning

confidence: 99%