1 / 42

P2P & Multimedia Streaming

P2P & Multimedia Streaming. NPUST-MINAR. Professor : Sheau-Ru Tong Student : Yi-Chen Hsu. 1. 2. 3. 4. Introduction. P2P Network Streaming Architecture. Stream Over P2P Neteork. Issues In Multimedia P2P Streaming. Contents. 1. Introduction. Introduction – 1.1.

Download Presentation

P2P & Multimedia Streaming

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. P2P & Multimedia Streaming NPUST-MINAR Professor : Sheau-Ru Tong Student : Yi-Chen Hsu

  2. 1 2 3 4 Introduction P2P Network Streaming Architecture Stream Over P2P Neteork Issues In Multimedia P2P Streaming Contents

  3. 1. Introduction

  4. Introduction – 1.1 1. Content Delivery Net Work(CDN) A content delivery network or content distribution network (CDN) is a system of computers containing copies of data, placed at various points in a network so as to maximize bandwidth for access to the data from clients throughout the network. A client accesses a copy of the data near to the client, as opposed to all clients accessing the same central server, so as to avoid bottleneck near that server. Content types include web objects, download-able objects (media files, software, documents), applications, real time media streams, and other components of internet delivery (DNS, routes, and database queries). [Wikipedia] YouTube is the most familiar solution for streaming video with client-server model over Internet

  5. Introduction – 1.2 • IP-multicast-based techniques can efficiently share a single channel, but the server is only scoped at local networks.

  6. Introduction – 2.1 2. Streaming Proxy Server In computer networks, a proxy server is a server (a computer system or an application program) that acts as an intermediary for requests from clients seeking resources from other servers. A client connects to the proxy server, requesting some service, such as a file, connection, web page, or other resource, available from a different server. [Wikipedia]

  7. Introduction – 2.2 A caching proxy server accelerates service requests by retrieving content saved from a previous request made by the same client or even other clients. Caching proxies keep local copies of frequently requested resources, allowing large organizations to significantly reduce their upstream bandwidth usage and costs, while significantly increasing performance. [Wikipedia]

  8. Introduction – 2.3 Streaming Proxy Server Suffix-Window Caching

  9. Introduction – 3.1 3. What is P2P? A peer-to-peer, commonly abbreviated to P2P, is any distributed network architecture composed of participants that make a portion of their resources (such as processing power, disk storage or network bandwidth) directly available to other network participants, without the need for central coordination instances (such as servers or stable hosts). Peers are both suppliers and consumers of resources, in contrast to the traditional client–server model where only servers supply, and clients consume. [Wikipedia]

  10. Introduction – 3.2 The Popular P2P Applications • P2P File System: open-after-downloading • BitTorrent • BitComet  • eDonkey • eMule • P2P Media Streaming System:play-while-downloading • KKBOX • ezPeer • Skype • PPStream • PPLive • FOXY • Freenet • KazaA • WinMX • Winny

  11. Introduction – 3.3 BitTorrent (protocol) • A user playing the role of file-provider makes a file available to the network. This first user's file is called aseed and its availability on the network allows other users, calledpeers, to connect and begin to download the seed file. • As new peers connect to the network and request the same file, their computer receives a different piece of the data from the seed. • Once multiple peers have multiple pieces of the seed, BitTorrent allows each to become a source for that portion of the file. [Wikipedia]

  12. Introduction – 3.3 BitTorrent (Measurements) • The number of downloaders increases exponentially in a short period of time after the torrent’s birth (the flash crowd period), and then decreases exponentially, but at a slower rate. • The number of seeds also increases exponentially at first, and then decreases exponentially at a slower rate. FROM: Measurements, Analysis, and Modeling of BitTorrent-like Systems

  13. Introduction – 3.4 P2P IPTV (PPStream) FROM: A Measurement Study of PPStream

  14. Introduction – 3.4 P2P IPTV (PPStream) FROM: Study of PPStream Based on Measurement

  15. Introduction – 3.4 P2P IPTV Measurement 2006 FIFA World Cup • PPStream seems to get the data from many peers at the same time and its peers seem to have long session duration. • PPLive seems to get the data from only a few peers at the same time but its peers have not a long session duration. • SOPcast download policy looks like PPLive policy. • TVants download policy seems to mix PPStream and SOPcast policies. FROM: P2P IPTV Measurement: A Comparison Study

  16. 2. P2P Network Streaming Architecture

  17. P2P Network Streaming Architecture – 1 Overlay Network • Overlay network is a computer network which is built on top of another network.  • Nodes in the overlay can be thought of as being connected by virtual or logical links, each of which corresponds to a path, perhaps through many physical links, in the underlying network. • For example, distributed systems such as cloud computing, peer-to-peer networks, and client-server applications are overlay networks because their nodes run on top of the Internet. [Wikipedia]

  18. P2P Network Streaming Architecture – 2 Challenges • Dynamic uptime • Peers don’t always stay online in the system. • Requesting peers need to find new supplying peers to replace the failed ones. • Limited and dynamic peer bandwidth • Unlike powerful video servers, peers have limited bandwidth capacities. • The available bandwidth of supplying peers might fluctuate unexpectedly. FROM: Challenges and Approaches in Large-Scale P2P Media Streaming

  19. P2P Network Streaming Architecture – 3.1 Locating supplying peers • Centralized directory • EX: PPStream, PPLive • The simplest and most commonly used method FROM: Challenges and Approaches in Large-Scale P2P Media Streaming

  20. P2P Network Streaming Architecture – 3.2 • Hierarchical overlay structure • Peers are organized into a hierarchical overlay structure such as an overlay tree. • The new client probes each peer in the list and finds out the most suitable peer Px . FROM: Challenges and Approaches in Large-Scale P2P Media Streaming

  21. P2P Network Streaming Architecture – 3.3 • DHT-based approach • Each peer is assigned a peer ID by hashing its own IP address using a common known hash function. • Each object is also associated with a key in the same space of peer IDs by hashing the object itself. • The peer with an ID equal to the hashed key is responsible for storing the object’s location (or the actual object). FROM: Challenges and Approaches in Large-Scale P2P Media Streaming

  22. P2P Network Streaming Architecture – 3.3 EX: BitTorrent (Kademlia) • Third generation peer-to-peer networks use Distributed hash tables(DHT) to look up files in the network.  • Kademlia uses a "distance" calculation between two nodes. This distance is computed as the exclusive or of the two node IDs, taking the result as an integer number. • The node ID is typically a large random number that is chosen with the goal of being unique for a particular node (see GUID). It can and does happen that nodes from Germany and Australia are "neighbours"; they have chosen similar random node IDs. • A basic Kademlia network with 2n nodes will only take n steps (in the worst case) to find that node. • [Wikipedia]

  23. d471f1 1 d467c4 d46a1c 8 d462ba 58 54 d4213f 14 10 47 21 Route(d46a1c) d13da3 42 38 32 65a1fc 38 24 30 P2P Network Streaming Architecture – 3.3 EX:P2P-over-SIP Additionally, implement P2P using SIP messaging REGISTER INVITE alice P2P-SIP overlay Alice 128.59.19.194 1 servers 54 10 38 24 30 Use DHT for all clients - but some are resource limited clients Use DHT among super-nodes HierarchyDynamically adapt Use DHT in server farm http://www.cs.columbia.edu/IRT/p2p-sip

  24. P2P Network Streaming Architecture – 3.4 • Gossip-based Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking

  25. 3. Stream Over P2P Network

  26. Stream Over P2P Network– 1.1 1. Content delivery path maintenance • Tree-based multicast

  27. Stream Over P2P Network– 1.2 • Tree-based multicast SplitStream: High-Bandwidth Multicast in CooperativeEnvironments

  28. Stream Over P2P Network– 1.3 • Tree-based multicast Topology Optimization in Multi-Tree Based P2P Streaming System

  29. Stream Over P2P Network– 2.1 2. Content delivery path selection In PROMISE, we represent the segmentgoodness as a function of the loss rate and available bandwidthbecause these two metrics: (1) can be measured segmentwise, and (2) are the most influential on the receiving rate, andhence on the quality. A segment with high available bandwidth andlow loss is unlikely to introduce high jitter or long queuing delay. PROMISE: PeertoPeerMedia Streaming

  30. Stream Over P2P Network– 2.2 CoolStreaming/DONet: A Data-Driven OverlayNetwork for Efficient Live Media Streaming

  31. Stream Over P2P Network– 2.3 Inbound/outbound 2 4 3 1 Optimal scheduling Local rarest first (LRF) scheduling Optimizing the Throughput of Data-Driven Peer-to-Peer Streaming

  32. Stream Over P2P Network– 2.3 Optimizing the Throughput of Data-Driven Peer-to-Peer Streaming

  33. Stream Over P2P Network– 2.4 Optimal media data assignment algorithm OTSp2p 0.5 Out-bound bandwidth 0.25 0.125 0.125 Buffer delay On Peer-to-Peer Media Streaming

  34. Stream Over P2P Network– 2.4 Optimal media data assignment algorithm OTSp2p On Peer-to-Peer Media Streaming

  35. Stream Over P2P Network– 2.4 Distributed differentiated admission control protocol DACp2p Average waiting time On Peer-to-Peer Media Streaming

  36. Stream Over P2P Network– 2.4 Distributed differentiated admission control protocol DACp2p Average waiting time On Peer-to-Peer Media Streaming

  37. Stream Over P2P Network– 2.4 R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming

  38. 4. Issues In Multimedia P2P Streaming

  39. Issues In Multimedia P2P Streaming – 1 Appropriate video coding scheme Each packet pn Packet size sn Decoding timestamp tdn Weight wn Directed acyclic dependency graph representation for a typical MPEGlayered-encoded video sequence (one network packet per layer, with IPBPBformat). Thesuccessful decoding of one packet is contingent on thesuccessfuldecoding of some other packets, called ancestors of pn.

  40. Issues In Multimedia P2P Streaming – 1 Appropriate video coding scheme

  41. Issues In Multimedia P2P Streaming – 1 Appropriate video coding scheme

  42. Thank You !

More Related