Seventh International Conference on Networking (Icn 2008) 2008
DOI: 10.1109/icn.2008.86
|View full text |Cite
|
Sign up to set email alerts
|

Peer-to-Peer Streaming Technology Survey

Abstract: Lately there has been a growing interest in the use of peer-to-peer technologies for deploying large-scale live media streaming systems over the Internet. In this paper we give a brief survey on the peer-to-peer streaming field and have also a closer look on selected applications. In practice, we analyse the selected peer-to-peer streaming systems (Octoshape, SopCast, TVAnts and TVU networks) and see if they are suitable for mobile usage. This paper also shows results from an experimental test carried out by … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2009
2009
2014
2014

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 20 publications
(14 citation statements)
references
References 3 publications
0
14
0
Order By: Relevance
“…The buffer size in our application is also ten seconds due to the RTP usage and is relatively small compared to the buffer sizes of existing solutions reported in [1].…”
Section: Methodsmentioning
confidence: 86%
See 2 more Smart Citations
“…The buffer size in our application is also ten seconds due to the RTP usage and is relatively small compared to the buffer sizes of existing solutions reported in [1].…”
Section: Methodsmentioning
confidence: 86%
“…In the second step, RTP packets belonging to each of the RTP sessions are assigned to the N partial streams according to (1), where i denotes the index of the partial stream (0 ≤ i < N) and t RT P denotes the RTP timestamp as carried in the RTP data packet. The algorithm allows assigning every RTP packet in the session to a partial RTP stream without having to maintain the state in the peer itself.…”
Section: Partial Rtp Stream Conceptmentioning
confidence: 99%
See 1 more Smart Citation
“…Many peer-to-peer solutions adopt strategies to bypass the problem, for instance by organizing the set of peers as a tree, multi-tree, or even employing more sophisticated approaches (e.g. DHTs) [4], [7], [8]. From this standpoint, our approach is more dynamic, since peers act by changing their partners at each round, choosing them at random.…”
Section: Implementation Issuesmentioning
confidence: 99%
“…Peers can be logically organized as a tree, where the data flows from the root, i.e. the broadcaster, to the leaves [7], [8], [9], a multi-tree [6], [10], or a generic mesh [11], [12], [13]. Alternatively, more sophisticated approaches can be utilized that, for instance, exploit DHTs for the content distribution, e.g.…”
Section: Introductionmentioning
confidence: 99%