GRAPES: a Generic Environment for P2P Streaming

نویسندگان

  • Luca Abeni
  • Csaba Kiraly
  • Alessandro Russo
  • Marco Biazzini
  • Renato Lo Cigno
چکیده

Practical implementation of new P2P streaming systems requires a lot of coding and is often tedious and costly, slowing down the technology transfer from the research community to real users. GRAPES aims at relieving this burden, and speed-up application development, by providing a set of open-source components conceived as basic building blocks for building new P2P streaming applications. GRAPES is designed to be usable in different environments and situations, to have a minimal set of pre-requisites and dependencies, and not to impose any particular constraints on applications using it. The development of streamers in the Napa-Wine project [1] has shown that using GRAPES P2P streaming applications with different characteristics can be developed by only writing a small amount of glue code that connects the desired functionalities and dictates the architecture

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Achievability of an Incentive Mechanism for Gossip based Peer-to-Peer Streaming

We provide a generic achievability argument for incentives in gossip based p2p streaming by proving that after coupling a randomized optimistic unchoke mechanism to an incentive based gossip streaming algorithm we can (still) distribute a stream from one source to n peers in O(log n) time with high probability. We provide simulation results for a distributed incentive scheme for gossip based p2...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Modeling User Behavior in P2P Live Video Streaming Systems through a Bayesian Network

Live video streaming over a Peer-to-Peer (P2P) architecture is promising due to its scalability and ease of deployment. Nevertheless, P2P-based video streaming systems still face some challenges regarding their performance. These systems are in fact overlays of users who control peers. As peers depend upon each other for receiving the video stream, the user behavior has an impact over the perfo...

متن کامل

Characterizing Locality-aware P2P Streaming

Peer-to-peer (P2P) live streaming systems have been increasingly popular and successful in today’s Internet, which provide large collections of video channels to millions of users at low server costs. The large volumes of P2P streaming traffic are exceeding those incurred by BitTorrent-like file sharing applications, threatening huge traffic relay cost to the Internet service providers (ISPs). ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010