Distributed Multimedia Streaming over Peer-to-Peer Networks

Kwon, Jin Baek; Yeom, Heon Y.

doi:10.1007/978-3-540-45209-6_117

Cited by 16 publications

(10 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The negative aspects of this work are that it is claimed that the P2P system is selfgrowing since the requesting peers can become supplying peers only after they receive all the data [37] but this is not true because a peer does not require all the data to become a supplier. This approach uses buffering delay as the only performance metric, however, buffering delay is not as important as other metrics such as quality and continuity index, which were not mentioned.…”

Section: Related Workmentioning

confidence: 98%

“…Another interesting work, focuses on transmission scheduling of the media data for a multi-source streaming session and it realizes a sophisticated scheduling scheme, called fixed-length slotted scheduling (FSS), which results in minimum buffering delay [37]. FSS employs variable length segments whose size is determined based on the bandwidth at which each segment is transmitted.…”

Section: Related Workmentioning

confidence: 99%

“…Some scheduling algorithms [37] are actually designed with the goal of minimizing the buffering delay. No other works, however, consider buffering delay in addition to continuity and balance indices, i.e., they focus solely on the buffering delay metric.…”

Section: Buffering Delaymentioning

confidence: 99%

See 2 more Smart Citations

Empirical Analysis of Multi-sender Segment Transmission Algorithms in Peer-to-Peer Streaming

Kowalski

Hefeeda

2009

2009 11th IEEE International Symposium on Multimedia

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 98%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Empirical Analysis of Multi-sender Segment Transmission Algorithms in Peer-to-Peer Streaming

Kowalski

Hefeeda

2009

2009 11th IEEE International Symposium on Multimedia

View full text Add to dashboard Cite

“…To conquer the dynamics of peer behavior, membership management in GoCast [10] and HPAM [13,14] incorporate mechanisms to explore potential peer candidates for recovery from peer loss or network degradation. Some works [7,12] focus on improving the stream quality by minimizing buffer time while ensuring continuous playback by scheduling the data sending order individually.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Transmission Scheduling for Streaming Applications via P2P Overlay

Yeo

2009

J Sign Process Syst Sign Image Video Technol

View full text Add to dashboard Cite

In current Peer-to-Peer streaming applications, a lot of research attempts to provide timely stream services to the end users. Most of them focus on how to organize the peer connections into an efficient overlay network. Due to the variation in the network, a lot of overhead is generated when the overlay structure adapts to the changes. In order to minimize the impact of network fluctuation, we proposed a scheduling algorithm which helps to distribute stream data efficiently through the fluctuating networks. It needs only partial information about overlay structure and provides the services to satisfy most number of users. The global latency experienced by peers in the system is thus minimized. To alleviate the problem of packet loss along the overlay, we introduce retransmission requests into our scheduling algorithm. Requests for much needed data are treated with higher priority. Parent peers which receive the request will re-send the missing data to minimize the loss impact. The missing data which are needed by more peers will have a larger cumulative impact through the tree overlay and these are thus scheduled and sent earlier. Simulation results showed that our prioritization and scheduling algorithm minimizes the negative impact of fluctuation and data loss in a dynamic network environment.

show abstract

“…P2P has been specifically applied for file-sharing applications [6]. However, the popularity of P2P paradigm has lead to its adoption by other types of applications such as information retrieval [105,109,127,135,146], filesystems [38,39,42,46,66,81,83,104], database [70,111], content delivery [34,41,48,73,82,88,125], and communication and messaging systems [3,11,12,13,102]. Recently, P2P has also been proposed to support resource discovery in computational grid [27,28,71,91,132,145].…”

Section: Chapter 1 Introductionmentioning

confidence: 99%

A Read-Only Distributed Hash Table

March

Teo

2011

J Grid Computing

View full text Add to dashboard Cite

Distributed hash table (DHT) is an infrastructure to support resource discovery in large distributed system. In DHT, data items are distributed across an overlay network based on a hash function. This leads to two major issues. Firstly, to preserve ownership of data items, commercial applications may not allow a node to proactively store its data items on other nodes. Secondly, data-item distribution requires all nodes in a DHT overlay to be publicly writable, but some nodes do not permit the sharing of its storage to external parties due to a different economical interest. In this thesis, we present a DHT-based resource discovery scheme without distributing data items called R-DHT (Read-only DHT). We further extend R-DHT to support multi-attribute queries with our Midas scheme (Multi-dimensional range queries).R-DHT is a new DHT abstraction that does not distribute data items across an overlay network. To map each data item (e.g. a resource, an index to a resource, or resource metadata) back onto its resource owner (i.e. physical host), we virtualize each host into virtual nodes. These nodes are further organized as a segment-based overlay network with each segment consisting of resources of the same type. The segment-based overlay also increases R-DHT resiliency to node failures. Compared to conventional DHT, R-DHT's overlay has a higher number of nodes which increases lookup path length and maintenance overhead. To reduce iii R-DHT lookup path length, we propose various optimizations, namely routing by segments and shared finger tables. To reduce the maintenance overhead of overlay networks, we propose a hierarchical R-DHT which organizes nodes as a two-level overlay network. The top-level overlay is indexed based on resource types and constitutes the entry points for resource owners at second-level overlays.Midas is a scheme to support multi-attribute queries on R-DHT based on d-toone mapping. A multi-attribute resource is indexed by a one-dimensional key which is derived by applying a Hilbert space-filling curve (SFC) to the type of the resource. The resource is then mapped (i.e. virtualized) onto an R-DHT node. To retrive query results, a multi-attribute query is transformed into a number of exact queries using Hilbert SFC. These exact queries are further processed using R-DHT lookups. To reduce the number of lookup required, we propose two optimizations to Midas query engine, namely incremental search and search-key elimination.We evaluate R-DHT and Midas through analytical and simulation analysis. Our main findings are as follows. Firstly, the lookup path length of each R-DHT lookup operation is indeed independent of the number of virtual nodes. This demonstrates that our lookup optimization techniques are applicable to other DHT-based systems that also virtualize physical hosts into nodes. Secondly, we found that R-DHT is effective in supporting multi-attribute range queries when the number of query results is small. Our results also imply that a selective data-item distribution scheme would red...

show abstract

Distributed Multimedia Streaming over Peer-to-Peer Networks

Cited by 16 publications

References 8 publications

Empirical Analysis of Multi-sender Segment Transmission Algorithms in Peer-to-Peer Streaming

Empirical Analysis of Multi-sender Segment Transmission Algorithms in Peer-to-Peer Streaming

Dynamic Transmission Scheduling for Streaming Applications via P2P Overlay

A Read-Only Distributed Hash Table

Contact Info

Product

Resources

About