1 / 21

Distributed Multimedia Streaming over Peer-to-Peer Network

Distributed Multimedia Streaming over Peer-to-Peer Network. Jin B. Kwon, Heon Y. Yeom. Euro-Par 2003, 9th International Conference on Parallel and Distributed Computing, August 2003, (Klagenfurt, Austria) (Also published in LNCS 2790, Euro-Par 2003 Parallel Processing, pp. 851-858). Agenda.

sasson
Télécharger la présentation

Distributed Multimedia Streaming over Peer-to-Peer Network

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Distributed Multimedia Streaming over Peer-to-Peer Network Jin B. Kwon, Heon Y. Yeom Euro-Par 2003, 9th International Conference on Parallel and Distributed Computing, August 2003, (Klagenfurt, Austria) (Also published in LNCS 2790, Euro-Par 2003 Parallel Processing, pp. 851-858)

  2. Agenda • Introduction • Definitions and assumptions • Transmission Scheduling • Fast Distribution • Simulations and Performance Studies • Conclusion

  3. Introduction • Existing multimedia streaming • Client-sever model -> server network bandwidth limitations… • Possible solutions • Multicast ->scalability • Peer-to-Peer model ->in early stage

  4. Introduction • The authors focus on 1)Transmission scheduling of the media data for a multi-supplier P2P streaming session • Supplying peers with heterogeneous out-bound bandwidth • The problem is to schedule the segments of media data so as to minimize the buffering delay • Propose Fixed-length slotted scheduling (FSS), better than OTS.

  5. Introduction • The authors focus on 2)Fast distribution of media contents • P2P system is self-growing. • Important to convert requesting peer to supplying peers as soon as possible • Propose FAST : aims at accelerating the speed at which the P2P system capacity increases

  6. Definitions • Candidate Set : Set of supplying peers • Requesting peer • selects the supplying peers from the set, • opens a channel with each selected supplying peer, • requests the data segment from them according to a scheduling mechanism • After receiving, stores and becomes a candidate of the media content

  7. Assumptions • Appropriate searching algorithm • γ : playback rate of the media data • Pr : requesting peer • Rin(r) : in-bound bandwidth Pr • Rout(r) : out-bound bandwidth Pr • 0 < Rin(r) ≤ γRout > 0 • : buffering delay

  8. Transmission Schedule • The goal : minimize buffering delay while ensure continuous playback • Determine the data segments to be transmitted over each channel and the transmission order of the segments.

  9. To ensure continuous playback

  10. OTS • Consider 4 channels with bandwidth of

  11. Fixed Length Slotted Scheduling (FSS) • Variable-length segments are assigned to the channels in round-robin fashion • Define slot length w i-th channel bandwidth Bi segment length wBi • Use previous example,

  12. Fixed Length Slotted Scheduling (FSS) • notice the overhead transmission!

  13. Fast Distribution - definition • Requesting Peer • Candidate Peer • Mature Peer : holding the whole media file • Immature Peer : being download the media data

  14. Fast Distribution Xi(t, r) : when Pi is assumed to be selected as a supplying peer of a request peer Pr, the position within the media file of the data to be requested to transmit at t. Rate of increase For a immature peer to be a supplying peer of Pr (called semi-mature peer)

  15. Fast Distribution Xi(t, r) can not be determined until Pr select its supplying peers use upper bound function xr(t) However, not satisfying it does not mean that Pi is not a semi-mature peer

  16. Peer requesting video : procedure • Select from mature and semi-mature peers • Since FSS depends on B1, the maximum outbound bandwidth peer will be chosen. The procedure is repeated until B*(r) = Rin(r)

  17. Peer requesting video : procedure • If the P2P system is beyond capacity • Start download with the acquired channels and buffering (FAST1) • Withdraw the request and retry after a randomized second.(FAST2) • Start download with the acquired channels and retry to acquire the remainder after T minutes.(FAST3)

  18. Simulation • Parameters • 50,100 peers, 100 seed peers initial • Request arrival rate follows Poisson distribution with mean 1/Θ • Video length = 60min • Inbound bandwidth = γ • Outbound bandwidth : • Seed peers : γ/2 • Others : γ/2, γ/4, γ/8 γ/16 : 10%, 10%, 40%, 40%

  19. Performance Study • Assume • Channel bandwidth has one of γ/2, γ/4, γ/8 γ/16 … γ/2n • B*(r) = γ • Time to transmit a segment =>

  20. Conclusion • Variable length segment for Transmission Scheduling FSS • Define semi-mature peer for fast Distribution • Performance evaluation over OTS and FSS

  21. ~ End ~

More Related