973 research outputs found
ISP-friendly Peer-assisted On-demand Streaming of Long Duration Content in BBC iPlayer
In search of scalable solutions, CDNs are exploring P2P support. However, the
benefits of peer assistance can be limited by various obstacle factors such as
ISP friendliness - requiring peers to be within the same ISP, bitrate
stratification - the need to match peers with others needing similar bitrate,
and partial participation - some peers choosing not to redistribute content.
This work relates potential gains from peer assistance to the average number
of users in a swarm, its capacity, and empirically studies the effects of these
obstacle factors at scale, using a month-long trace of over 2 million users in
London accessing BBC shows online. Results indicate that even when P2P swarms
are localised within ISPs, up to 88% of traffic can be saved. Surprisingly,
bitrate stratification results in 2 large sub-swarms and does not significantly
affect savings. However, partial participation, and the need for a minimum
swarm size do affect gains. We investigate improvements to gain from increasing
content availability through two well-studied techniques: content bundling -
combining multiple items to increase availability, and historical caching of
previously watched items. Bundling proves ineffective as increased server
traffic from larger bundles outweighs benefits of availability, but simple
caching can considerably boost traffic gains from peer assistance.Comment: In Proceedings of IEEE INFOCOM 201
A New Stable Peer-to-Peer Protocol with Non-persistent Peers
Recent studies have suggested that the stability of peer-to-peer networks may
rely on persistent peers, who dwell on the network after they obtain the entire
file. In the absence of such peers, one piece becomes extremely rare in the
network, which leads to instability. Technological developments, however, are
poised to reduce the incidence of persistent peers, giving rise to a need for a
protocol that guarantees stability with non-persistent peers. We propose a
novel peer-to-peer protocol, the group suppression protocol, to ensure the
stability of peer-to-peer networks under the scenario that all the peers adopt
non-persistent behavior. Using a suitable Lyapunov potential function, the
group suppression protocol is proven to be stable when the file is broken into
two pieces, and detailed experiments demonstrate the stability of the protocol
for arbitrary number of pieces. We define and simulate a decentralized version
of this protocol for practical applications. Straightforward incorporation of
the group suppression protocol into BitTorrent while retaining most of
BitTorrent's core mechanisms is also presented. Subsequent simulations show
that under certain assumptions, BitTorrent with the official protocol cannot
escape from the missing piece syndrome, but BitTorrent with group suppression
does.Comment: There are only a couple of minor changes in this version. Simulation
tool is specified this time. Some repetitive figures are remove
Recommended from our members
Multimedia delivery in the future internet
The term “Networked Media” implies that all kinds of media including text, image, 3D graphics, audio
and video are produced, distributed, shared, managed and consumed on-line through various networks,
like the Internet, Fiber, WiFi, WiMAX, GPRS, 3G and so on, in a convergent manner [1]. This white
paper is the contribution of the Media Delivery Platform (MDP) cluster and aims to cover the Networked
challenges of the Networked Media in the transition to the Future of the Internet.
Internet has evolved and changed the way we work and live. End users of the Internet have been confronted
with a bewildering range of media, services and applications and of technological innovations concerning
media formats, wireless networks, terminal types and capabilities. And there is little evidence that the pace
of this innovation is slowing. Today, over one billion of users access the Internet on regular basis, more
than 100 million users have downloaded at least one (multi)media file and over 47 millions of them do so
regularly, searching in more than 160 Exabytes1 of content. In the near future these numbers are expected
to exponentially rise. It is expected that the Internet content will be increased by at least a factor of 6, rising
to more than 990 Exabytes before 2012, fuelled mainly by the users themselves. Moreover, it is envisaged
that in a near- to mid-term future, the Internet will provide the means to share and distribute (new)
multimedia content and services with superior quality and striking flexibility, in a trusted and personalized
way, improving citizens’ quality of life, working conditions, edutainment and safety.
In this evolving environment, new transport protocols, new multimedia encoding schemes, cross-layer inthe
network adaptation, machine-to-machine communication (including RFIDs), rich 3D content as well as
community networks and the use of peer-to-peer (P2P) overlays are expected to generate new models of
interaction and cooperation, and be able to support enhanced perceived quality-of-experience (PQoE) and
innovative applications “on the move”, like virtual collaboration environments, personalised services/
media, virtual sport groups, on-line gaming, edutainment. In this context, the interaction with content
combined with interactive/multimedia search capabilities across distributed repositories, opportunistic P2P
networks and the dynamic adaptation to the characteristics of diverse mobile terminals are expected to
contribute towards such a vision.
Based on work that has taken place in a number of EC co-funded projects, in Framework Program 6 (FP6)
and Framework Program 7 (FP7), a group of experts and technology visionaries have voluntarily
contributed in this white paper aiming to describe the status, the state-of-the art, the challenges and the way
ahead in the area of Content Aware media delivery platforms
Angels: In-Network Support for Minimum Distribution Time in P2P Overlays
This thesis proposes the use of in-network caches (which we call Angels) to reduce the Minimum Distribution Time (MDT) of a file from a seeder – a node that possesses the file – to a set of leechers – nodes who are interested in downloading the file. An Angel is not a leecher in the sense that it is not interested in receiving the entire file, but rather it is interested in minimizing the MDT to all leechers, and as such uses its storage and up/down-link capacity to cache and forward parts of the file to other peers. We extend the analytical results by Kumar and Ross (Kumar and Ross, 2006) to account for the presence of angels by deriving a new lower bound for the MDT. We show that this newly derived lower bound is tight by proposing a distribution strategy under assumptions of a fluid model. We present a GroupTree heuristic that addresses the impracticalities of the fluid model. We evaluate our designs through simulations that show that our GroupTree heuristic outperforms other heuristics, that it scales well with the increase of the
number of leechers, and that it closely approaches the optimal theoretical bounds
A credit-based approach to scalable video transmission over a peer-to-peer social network
PhDThe objective of the research work presented in this thesis is to study
scalable video transmission over peer-to-peer networks. In particular,
we analyse how a credit-based approach and exploitation of social networking
features can play a significant role in the design of such systems.
Peer-to-peer systems are nowadays a valid alternative to the traditional
client-server architecture for the distribution of multimedia content, as
they transfer the workload from the service provider to the final user,
with a subsequent reduction of management costs for the former. On
the other hand, scalable video coding helps in dealing with network
heterogeneity, since the content can be tailored to the characteristics
or resources of the peers. First of all, we present a study that evaluates
subjective video quality perceived by the final user under different
transmission scenarios. We also propose a video chunk selection algorithm
that maximises received video quality under different network
conditions. Furthermore, challenges in building reliable peer-to-peer
systems for multimedia streaming include optimisation of resource allocation
and design mechanisms based on rewards and punishments that
provide incentives for users to share their own resources. Our solution
relies on a credit-based architecture, where peers do not interact with
users that have proven to be malicious in the past. Finally, if peers
are allowed to build a social network of trusted users, they can share
the local information they have about the network and have a more
complete understanding of the type of users they are interacting with.
Therefore, in addition to a local credit, a social credit or social reputation
is introduced. This thesis concludes with an overview of future
developments of this research work
From resource allocation to neighbor selection in peer-to-peer networks
Incluye bibliografĂa y anexosEn la tesis se estudia primero, desde un punto de vista teĂłrico, las diferentes posibilidades de asignaciĂłn de recursos de las redes peer-to-peer (P2P) y los incentivos que las mismas proveen a los peers. Luego, se realiza el diseño de un algoritmo que alcanza la asignaciĂłn deseada manteniendo los incentivos para motivar a los peers a contribuir. Analizando los incentivos aparece un compromiso entre eficiencia y justicia en la red. Se procede a diseñar un algoritmo descentralizado de “selecciĂłn de vecinos” (donde se elige con quiĂ©n compartir contenido de manera de alcanzar un Ăłptimo global). El algoritmo se basa en el uso de Cadenas de Markov de tiempo continuo que aparecen en el estudio de la mecánica estadĂstica, en particular las distribuciones de Gibbs. El algoritmo consiste en un Gibbs Sampler, que alcanza la asignaciĂłn deseada manteniendo sencillez en la implementaciĂłn. En la Ăşltima parte de la tesis se extienden las propuestas al contexto de redes inalámbricas ad-hoc, en las cuales el compromiso de eficiencia y justicia cambia radicalmente debido a que la eficiencia de la red está asociada a quĂ© vecinos podemos elegir para comunicar, ya que en las redes inalámbricas las restricciones de capacidad se vuelven par a par, en lugar de una Ăşnica restricciĂłn de subida por peer. Las interferencias entre enlaces debido la comunicaciĂłn inalámbrica complican aĂşn más el problema. De todos modos, se propone una extensiĂłn al algoritmo que logra los objetivos deseados tambiĂ©n en este tipo de redes y que permite modular el compromiso entre eficiencia y justicia satisfactoriamente.ANII - POS_NAC_2012_1_9088
Video-on-Demand over Internet: a survey of existing systems and solutions
Video-on-Demand is a service where movies are delivered to distributed users with low delay and free interactivity. The traditional client/server architecture experiences scalability issues to provide video streaming services, so there have been many proposals of systems, mostly based on a peer-to-peer or on a hybrid server/peer-to-peer solution, to solve this issue. This work presents a survey of the currently existing or proposed systems and solutions, based upon a subset of representative systems, and defines selection criteria allowing to classify these systems. These criteria are based on common questions such as, for example, is it video-on-demand or live streaming, is the architecture based on content delivery network, peer-to-peer or both, is the delivery overlay tree-based or mesh-based, is the system push-based or pull-based, single-stream or multi-streams, does it use data coding, and how do the clients choose their peers. Representative systems are briefly described to give a summarized overview of the proposed solutions, and four ones are analyzed in details. Finally, it is attempted to evaluate the most promising solutions for future experiments. Résumé La vidéo à la demande est un service où des films sont fournis à distance aux utilisateurs avec u
Mathematical analysis of scheduling policies in peer-to-peer video streaming networks
Las redes de pares son comunidades virtuales autogestionadas, desarrolladas en la capa de aplicaciĂłn sobre la infraestructura de Internet, donde los usuarios (denominados pares) comparten recursos (ancho de banda, memoria, procesamiento) para alcanzar un fin comĂşn. La distribuciĂłn de video representa la aplicaciĂłn más desafiante, dadas las limitaciones de ancho de banda. Existen básicamente tres servicios de video. El más simple es la descarga, donde un conjunto de servidores posee el contenido original, y los usuarios deben descargar completamente este contenido previo a su reproducciĂłn. Un segundo servicio se denomina video bajo demanda, donde los pares se unen a una red virtual siempre que inicien una solicitud de un contenido de video, e inician una descarga progresiva en lĂnea. El Ăşltimo servicio es video en vivo, donde el contenido de video es generado, distribuido y visualizado simultáneamente. En esta tesis se estudian aspectos de diseño para la distribuciĂłn de video en vivo y bajo demanda. Se presenta un análisis matemático de estabilidad y capacidad de arquitecturas de distribuciĂłn bajo demanda hĂbridas, asistidas por pares. Los pares inician descargas concurrentes de mĂşltiples contenidos, y se desconectan cuando lo desean. Se predice la evoluciĂłn esperada del sistema asumiendo proceso Poisson de arribos y egresos exponenciales, mediante un modelo determinĂstico de fluidos. Un sub-modelo de descargas secuenciales (no simultáneas) es globalmente y estructuralmente estable, independientemente de los parámetros de la red. Mediante la Ley de Little se determina el tiempo medio de residencia de usuarios en un sistema bajo demanda secuencial estacionario. Se demuestra teĂłricamente que la filosofĂa hĂbrida de cooperaciĂłn entre pares siempre desempeña mejor que la tecnologĂa pura basada en cliente-servidor
- …