Design and Implementation of Overlay Multicast Protocol for Multimedia Streaming

Baduge, Thilmee M.; Hiromori, Akihito; Yamaguchi, Hirozumi; Higashino, Takeshi

doi:10.1109/icpp.2005.30

Cited by 2 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, we go for a decentralized approach as the tree refining procedure. Though there may be inter-session node joinings and departures, we assume that they are handled by some existing decentralized protocols such as [9] and mainly concentrate on the initial tree construction and refining procedures. These procedures are described in detail in the following sections 2 .…”

Section: Ms-ddbmsst Constructionmentioning

confidence: 99%

“…This is also critical when using ALM in real world applications. Multiple path approaches where the redundant paths are used in case of original path failure ( [5], [6]), or restore schemes where the overlay topology is re-established using a previously or immediately calculated restore mission ( [7], [8], [9]) are often used to realize this. The third one corresponds to the ALM schemes like [10], [11], [12], which are targeted to provide some other QoS features like bandwidth.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Stability Oriented Overlay Multicast for Multimedia Streaming in Multiple Source Context

Baduge

Ikeda

Yamaguchi

et al. 2008

2008 IEEE International Conference on Communications

Self Cite

View full text Add to dashboard Cite

Abstract-In this paper, we propose a new overlay multicast protocol designed for inter-active multimedia streaming applications. The protocol considers the heterogeneity of end-hosts and tries to minimize the negative impact (data outage) of end-hosts' unannounced departures. For this purpose, it concentrates on endhosts' reliability (lifetime for instance) and constructs a shared tree called ms-DDBMSST (multiple-source Degree and Delay Bounded Maximum Stability Spanning Tree) as an overlay network that involves all the participants of the application, in a distributed manner. For a given set of nodes where some of them are senders, ms-DDBMSST is a spanning tree where the receive path stability of the entire tree is maximized while satisfying the delay-from-source constraint and degree constraint for each node. We believe that this is the first approach that defines ms-DDBMSST construction problem and presents a distributed protocol for the purpose. Our performance evaluation is based on experiments in both simulated networks and PlanetLab that strongly shows the efficiency and usefulness of the proposed protocol.

show abstract

Section: Ms-ddbmsst Constructionmentioning

confidence: 99%