1 |
A Content Delivery Model for Online VideoYuan, Liang 09 October 2009 (has links)
Online video accounts for a large and growing portion of all Internet traffic.
In order to cut bandwidth costs, it is necessary to use the available bandwidth of
users to offload video downloads. Assuming that users can only keep and distribute
one video at any given time, it is necessary to determine the global user cache
distribution with the goal of achieving maximum peer traffic.
The system model contains three different parties: viewers, idlers and servers.
Viewers are those peers who are currently viewing a video. Idlers are those peers
who are currently not viewing a video but are available to upload to others. Finally,
servers can upload any video to any user and has infinite capacity.
Every video maintains a first-in-first-out viewer queue which contains all the
viewers for that video. Each viewer downloads from the peer that arrived before it,
with the earliest arriving peer downloading from the server. Thus, the server must
upload to one peer whenever the viewer queue is not empty. The aim of the idlers
is to act as a server for a particular video, thereby eliminating all server traffic
for that video. By using the popularity of videos, the number of idlers and some
assumptions on the viewer arrival process, the optimal global video distribution in
the user caches can be determined.
|
2 |
A Content Delivery Model for Online VideoYuan, Liang 09 October 2009 (has links)
Online video accounts for a large and growing portion of all Internet traffic.
In order to cut bandwidth costs, it is necessary to use the available bandwidth of
users to offload video downloads. Assuming that users can only keep and distribute
one video at any given time, it is necessary to determine the global user cache
distribution with the goal of achieving maximum peer traffic.
The system model contains three different parties: viewers, idlers and servers.
Viewers are those peers who are currently viewing a video. Idlers are those peers
who are currently not viewing a video but are available to upload to others. Finally,
servers can upload any video to any user and has infinite capacity.
Every video maintains a first-in-first-out viewer queue which contains all the
viewers for that video. Each viewer downloads from the peer that arrived before it,
with the earliest arriving peer downloading from the server. Thus, the server must
upload to one peer whenever the viewer queue is not empty. The aim of the idlers
is to act as a server for a particular video, thereby eliminating all server traffic
for that video. By using the popularity of videos, the number of idlers and some
assumptions on the viewer arrival process, the optimal global video distribution in
the user caches can be determined.
|
3 |
Privacy Concerned D2D-Assisted Delay-Tolerant Content Distribution SystemMa, Guoqing 28 April 2019 (has links)
It is foreseeable that device-to-device (D2D) communication will become a standard feature in the future, for the reason that it offloads the data traffic from network infrastructures to user devices. Recent researches prove that delivering delay-tolerant contents through content delivery network (CDN) by D2D helps network operators increase spectral and energy efficiency. However, protecting the private information of mobile users in D2D assistant CDN is the primary concern, which directly affects the willingness of mobile users to share their resources with others. In this thesis, we proposed a privacy concerned top layer system for selecting the sub-optimal set of mobile nodes as initial mobile content provider (MCP) for content delivery in any general D2D communications, which implies that our proposed system does not rely on private user information such as location, affinity, and personal preferences. We model the initial content carrier set problem as an incentive maximization problem to optimize the rewards for network operators and content providers. Then, we utilized the Markov random field (MRF) theory to build a probabilistic graphical model to make an inference on the observation of delivered contents. Furthermore, we proposed a greedy algorithm to solve the non-linear binary integer programming (NLBIP) problem for selecting the optimal initial content carrier set. The evaluations of the proposed system are based on both a simulated dataset and a real-world collected dataset corresponding to the off-line and on-line scenarios.
|
4 |
A Peer-to-Peer Internet Measurement Platform and Its Applications in Content Delivery NetworksTriukose, Sipat 21 February 2014 (has links)
No description available.
|
5 |
Adaptivitätssensitive Platzierung von Replikaten in Adaptiven Content Distribution Networks / Adaptation-aware Replica Placement in Adaptive Content Distribution NetworksBuchholz, Sven 14 June 2005 (has links) (PDF)
Adaptive Content Distribution Networks (A-CDNs) sind anwendungsübergreifende, verteilte Infrastrukturen, die auf Grundlage verteilter Replikation von Inhalten und Inhaltsadaption eine skalierbare Auslieferung von adaptierbaren multimedialen Inhalten an heterogene Clients ermöglichen. Die Platzierung der Replikate in den Surrogaten eines A-CDN wird durch den Platzierungsmechanismus des A-CDN gesteuert. Anders als in herkömmlichen CDNs, die keine Inhaltsadaption berücksichtigen, muss ein Platzierungsmechanismus in einem A-CDN nicht nur entscheiden, welches Inhaltsobjekt in welchem Surrogat repliziert werden soll, sondern darüber hinaus, in welcher Repräsentation bzw. in welchen Repräsentationen das Inhaltsobjekt zu replizieren ist. Herkömmliche Platzierungsmechanismen sind nicht in der Lage, verschiedene Repräsentationen eines Inhaltsobjektes zu berücksichtigen. Beim Einsatz herkömmlicher Platzierungsmechanismen in A-CDNs können deshalb entweder nur statisch voradaptierte Repräsentationen oder ausschließlich generische Repräsentationen repliziert werden. Während bei der Replikation von statisch voradaptierten Repräsentationen die Wiederverwendbarkeit der Replikate eingeschränkt ist, führt die Replikation der generischen Repräsentationen zu erhöhten Kosten und Verzögerungen für die dynamische Adaption der Inhalte bei jeder Anfrage. Deshalb werden in der Arbeit adaptivitätssensitive Platzierungsmechanismen zur Platzierung von Replikaten in A-CDNs vorgeschlagen. Durch die Berücksichtigung der Adaptierbarkeit der Inhalte bei der Ermittlung einer Platzierung von Replikaten in den Surrogaten des A-CDNs können adaptivitätssensitive Platzierungsmechanismen sowohl generische und statisch voradaptierte als auch teilweise adaptierte Repräsentationen replizieren. Somit sind sie in der Lage statische und dynamische Inhaltsadaption flexibel miteinander zu kombinieren. Das Ziel der vorliegenden Arbeit ist zu evaluieren, welche Vorteile sich durch die Berücksichtigung der Inhaltsadaption bei Platzierung von adaptierbaren Inhalten in A-CDNs realisieren lassen. Hierzu wird das Problem der adaptivitätssensitiven Platzierung von Replikaten in A-CDNs als Optimierungsproblem formalisiert, Algorithmen zur Lösung des Optimierungsproblems vorgeschlagen und diese in einem Simulator implementiert. Das zugrunde liegende Simulationsmodell beschreibt ein im Internet verteiltes A-CDN, welches zur Auslieferung von JPEG-Bildern an heterogene mobile und stationäre Clients verwendet wird. Anhand dieses Simulationsmodells wird die Leistungsfähigkeit der adaptivitätssensitiven Platzierungsmechanismen evaluiert und mit der von herkömmlichen Platzierungsmechanismen verglichen. Die Simulationen zeigen, dass der adaptivitätssensitive Ansatz in Abhängigkeit vom System- und Lastmodell sowie von der Speicherkapazität der Surrogate im A-CDN in vielen Fällen Vorteile gegenüber dem Einsatz herkömmlicher Platzierungsmechanismen mit sich bringt. Wenn sich die Anfragelasten verschiedener Typen von Clients jedoch nur wenig oder gar nicht überlappen oder bei hinreichend großer Speicherkapazität der Surrogate hat der adaptivitätssensitive Ansatz keine signifikanten Vorteile gegenüber dem Einsatz eines herkömmlichen Platzierungsmechanismus. / Adaptive Content Distribution Networks (A-CDNs) are application independent, distributed infrastructures using content adaptation and distributed replication of contents to allow the scalable delivery of adaptable multimedia contents to heterogeneous clients. The replica placement in an A-CDN is controlled by the placement mechanisms of the A-CDN. As opposed to traditional CDNs, which do not take content adaptation into consideration, a replica placement mechanism in an A-CDN has to decide not only which object shall be stored in which surrogate but also which representation or which representations of the object to replicate. Traditional replica placement mechanisms are incapable of taking different representations of the same object into consideration. That is why A-CDNs that use traditional replica placement mechanisms may only replicate generic or statically adapted representations. The replication of statically adapted representations reduces the sharing of the replicas. The replication of generic representations results in adaptation costs and delays with every request. That is why the dissertation thesis proposes the application of adaptation-aware replica placement mechanisms. By taking the adaptability of the contents into account, adaptation-aware replica placement mechanisms may replicate generic, statically adapted and even partially adapted representations of an object. Thus, they are able to balance between static and dynamic content adaptation. The dissertation is targeted at the evaluation of the performance advantages of taking knowledge about the adaptability of contents into consideration when calculating a placement of replicas in an A-CDN. Therefore the problem of adaptation-aware replica placement is formalized as an optimization problem; algorithms for solving the optimization problem are proposed and implemented in a simulator. The underlying simulation model describes an Internet-wide distributed A-CDN that is used for the delivery of JPEG images to heterogeneous mobile and stationary clients. Based on the simulation model, the performance of the adaptation-aware replica placement mechanisms are evaluated and compared to traditional replica placement mechanisms. The simulations prove that the adaptation-aware approach is superior to the traditional replica placement mechanisms in many cases depending on the system and load model as well as the storage capacity of the surrogates of the A-CDN. However, if the load of different types of clients do hardly overlap or with sufficient storage capacity within the surrogates, the adaptation-aware approach has no significant advantages over the application of traditional replica-placement mechanisms.
|
6 |
Adaptivitätssensitive Platzierung von Replikaten in Adaptiven Content Distribution NetworksBuchholz, Sven 08 July 2005 (has links)
Adaptive Content Distribution Networks (A-CDNs) sind anwendungsübergreifende, verteilte Infrastrukturen, die auf Grundlage verteilter Replikation von Inhalten und Inhaltsadaption eine skalierbare Auslieferung von adaptierbaren multimedialen Inhalten an heterogene Clients ermöglichen. Die Platzierung der Replikate in den Surrogaten eines A-CDN wird durch den Platzierungsmechanismus des A-CDN gesteuert. Anders als in herkömmlichen CDNs, die keine Inhaltsadaption berücksichtigen, muss ein Platzierungsmechanismus in einem A-CDN nicht nur entscheiden, welches Inhaltsobjekt in welchem Surrogat repliziert werden soll, sondern darüber hinaus, in welcher Repräsentation bzw. in welchen Repräsentationen das Inhaltsobjekt zu replizieren ist. Herkömmliche Platzierungsmechanismen sind nicht in der Lage, verschiedene Repräsentationen eines Inhaltsobjektes zu berücksichtigen. Beim Einsatz herkömmlicher Platzierungsmechanismen in A-CDNs können deshalb entweder nur statisch voradaptierte Repräsentationen oder ausschließlich generische Repräsentationen repliziert werden. Während bei der Replikation von statisch voradaptierten Repräsentationen die Wiederverwendbarkeit der Replikate eingeschränkt ist, führt die Replikation der generischen Repräsentationen zu erhöhten Kosten und Verzögerungen für die dynamische Adaption der Inhalte bei jeder Anfrage. Deshalb werden in der Arbeit adaptivitätssensitive Platzierungsmechanismen zur Platzierung von Replikaten in A-CDNs vorgeschlagen. Durch die Berücksichtigung der Adaptierbarkeit der Inhalte bei der Ermittlung einer Platzierung von Replikaten in den Surrogaten des A-CDNs können adaptivitätssensitive Platzierungsmechanismen sowohl generische und statisch voradaptierte als auch teilweise adaptierte Repräsentationen replizieren. Somit sind sie in der Lage statische und dynamische Inhaltsadaption flexibel miteinander zu kombinieren. Das Ziel der vorliegenden Arbeit ist zu evaluieren, welche Vorteile sich durch die Berücksichtigung der Inhaltsadaption bei Platzierung von adaptierbaren Inhalten in A-CDNs realisieren lassen. Hierzu wird das Problem der adaptivitätssensitiven Platzierung von Replikaten in A-CDNs als Optimierungsproblem formalisiert, Algorithmen zur Lösung des Optimierungsproblems vorgeschlagen und diese in einem Simulator implementiert. Das zugrunde liegende Simulationsmodell beschreibt ein im Internet verteiltes A-CDN, welches zur Auslieferung von JPEG-Bildern an heterogene mobile und stationäre Clients verwendet wird. Anhand dieses Simulationsmodells wird die Leistungsfähigkeit der adaptivitätssensitiven Platzierungsmechanismen evaluiert und mit der von herkömmlichen Platzierungsmechanismen verglichen. Die Simulationen zeigen, dass der adaptivitätssensitive Ansatz in Abhängigkeit vom System- und Lastmodell sowie von der Speicherkapazität der Surrogate im A-CDN in vielen Fällen Vorteile gegenüber dem Einsatz herkömmlicher Platzierungsmechanismen mit sich bringt. Wenn sich die Anfragelasten verschiedener Typen von Clients jedoch nur wenig oder gar nicht überlappen oder bei hinreichend großer Speicherkapazität der Surrogate hat der adaptivitätssensitive Ansatz keine signifikanten Vorteile gegenüber dem Einsatz eines herkömmlichen Platzierungsmechanismus. / Adaptive Content Distribution Networks (A-CDNs) are application independent, distributed infrastructures using content adaptation and distributed replication of contents to allow the scalable delivery of adaptable multimedia contents to heterogeneous clients. The replica placement in an A-CDN is controlled by the placement mechanisms of the A-CDN. As opposed to traditional CDNs, which do not take content adaptation into consideration, a replica placement mechanism in an A-CDN has to decide not only which object shall be stored in which surrogate but also which representation or which representations of the object to replicate. Traditional replica placement mechanisms are incapable of taking different representations of the same object into consideration. That is why A-CDNs that use traditional replica placement mechanisms may only replicate generic or statically adapted representations. The replication of statically adapted representations reduces the sharing of the replicas. The replication of generic representations results in adaptation costs and delays with every request. That is why the dissertation thesis proposes the application of adaptation-aware replica placement mechanisms. By taking the adaptability of the contents into account, adaptation-aware replica placement mechanisms may replicate generic, statically adapted and even partially adapted representations of an object. Thus, they are able to balance between static and dynamic content adaptation. The dissertation is targeted at the evaluation of the performance advantages of taking knowledge about the adaptability of contents into consideration when calculating a placement of replicas in an A-CDN. Therefore the problem of adaptation-aware replica placement is formalized as an optimization problem; algorithms for solving the optimization problem are proposed and implemented in a simulator. The underlying simulation model describes an Internet-wide distributed A-CDN that is used for the delivery of JPEG images to heterogeneous mobile and stationary clients. Based on the simulation model, the performance of the adaptation-aware replica placement mechanisms are evaluated and compared to traditional replica placement mechanisms. The simulations prove that the adaptation-aware approach is superior to the traditional replica placement mechanisms in many cases depending on the system and load model as well as the storage capacity of the surrogates of the A-CDN. However, if the load of different types of clients do hardly overlap or with sufficient storage capacity within the surrogates, the adaptation-aware approach has no significant advantages over the application of traditional replica-placement mechanisms.
|
7 |
Arquitetura de IPTV com suporte à apresentação deslocada no tempo baseada em distribuição peer-to-peer. / IPTV architecture with time-shift support based on peer-to-peer distribution.Gallo, Diego Sanchez 11 March 2009 (has links)
Com o aumento da concorrência sofrido pelas operadoras de telecomunicações frente à entrada de diversas empresas de outros ramos no mercado de comunicação, como, por exemplo, os Provedores de Serviço de Internet (ISPs - Internet Service Providers) através da oferta de serviços de voz sobre IP, tais operadoras viram-se obrigadas a diversificar sua oferta de serviços para gerar novas fontes de receita. Por possuírem ampla infra-estrutura instalada, as operadoras de telecomunicações passaram a oferecer, também, serviço de TV aos usuários, através de suas redes (convergentes) de telefonia e dados já existentes, o chamado IPTV. O objetivo deste trabalho foi possibilitar, neste cenário, que estas empresas consigam oferecer, além dos serviços convencionais de TV (e.g., transmissões lineares dos conteúdos nos canais de TV), serviços diferenciados empregando-se a mesma infra-estrutura. O foco deste trabalho é a oferta do serviço de apresentação deslocada no tempo dos conteúdos transmitidos linearmente nos canais de TV, sem a necessidade de configuração prévia por parte do usuário. Desta maneira, dá-se maior flexibilidade ao usuário, possibilitando-o assistir aos conteúdos que lhe interessam, no horário mais conveniente, sem ter que se preocupar com isso antecipadamente (i.e., sem a necessidade de configurar algum equipamento para gravar o conteúdo ou saber antecipadamente quais programas lhe interessam). Para isso foram pesquisadas e analisadas tanto tecnologias de transmissão e distribuição de conteúdos, como também o paradigma peer-to-peer, muito utilizado atualmente no compartilhamento de arquivos na Internet. A partir daí, foi concebida uma arquitetura capaz de oferecer tanto o serviço tradicional de transmissão linear de TV, quanto de apresentar vídeos deslocados no tempo (i.e., vídeos cuja transmissão linear já foi iniciada ou até concluída, a partir de qualquer posição já transmitida), combinando-se técnicas de multidifusão de dados, armazenamento distribuído e protocolos peer-to-peer. Desta maneira, obteve-se uma solução eficiente, utilizando-se os recursos disponíveis em todo o sistema, incluindo recursos ociosos dos usuários finais, para auxiliar no armazenamento e distribuição dos conteúdos deslocados no tempo. Finalmente, um protótipo foi desenvolvido como prova de conceito da arquitetura proposta neste trabalho, e, juntamente com os testes realizados, comprovam a viabilidade de se utilizar redes P2P para a distribuição dos conteúdos para a apresentação deslocada no tempo. / Telecommunication companies are suffering from the increasing offer of cheap and reliable voice over IP services, being forced to diversify their services looking for new revenue possibilities. Since these companies have a vast infrastructure, they are now providing TV services through the same telephony and data infrastructure, using their IP networks to offer IPTV. The goal of the present work is to allow, in this scenario, that such companies offer, additionally to the traditional TV services (e.g., the linear transmissions of the TV channels), differentiated services through the same infrastructure. The focus of the present work is, therefore, the offering of the time-shift service, allowing users to watch linear transmitted contents, time-shifted, without the need for any in-advance configuration. This approach gives more flexibility to the users, allowing them to choose the most appropriate time to watch some content without having to specify their interests in advance (i.e., without configuring some equipment to record the content or knowing in advance which programs will interest themselves). To achieve this goal, technologies for content transmission and distribution, as well as the peer-to-peer paradigm for file sharing were studied, resulting in the development of an architecture capable of offering the traditional linear transmissions service as well as the possibility of time-shift, combining multicast, distributed caching and peer-to-peer technologies. Accordingly, an efficient solution was envisioned, making use of all available resources in the system, including idle resources in the user equipments, to help in the caching and distribution of the time-shifted contents. Finally, a prototype was developed as a proof-of-concept for the designed architecture, which together with the performed tests, shows the viability of utilizing P2P networks in the distribution of time-shifted contents.
|
8 |
Arquitetura de IPTV com suporte à apresentação deslocada no tempo baseada em distribuição peer-to-peer. / IPTV architecture with time-shift support based on peer-to-peer distribution.Diego Sanchez Gallo 11 March 2009 (has links)
Com o aumento da concorrência sofrido pelas operadoras de telecomunicações frente à entrada de diversas empresas de outros ramos no mercado de comunicação, como, por exemplo, os Provedores de Serviço de Internet (ISPs - Internet Service Providers) através da oferta de serviços de voz sobre IP, tais operadoras viram-se obrigadas a diversificar sua oferta de serviços para gerar novas fontes de receita. Por possuírem ampla infra-estrutura instalada, as operadoras de telecomunicações passaram a oferecer, também, serviço de TV aos usuários, através de suas redes (convergentes) de telefonia e dados já existentes, o chamado IPTV. O objetivo deste trabalho foi possibilitar, neste cenário, que estas empresas consigam oferecer, além dos serviços convencionais de TV (e.g., transmissões lineares dos conteúdos nos canais de TV), serviços diferenciados empregando-se a mesma infra-estrutura. O foco deste trabalho é a oferta do serviço de apresentação deslocada no tempo dos conteúdos transmitidos linearmente nos canais de TV, sem a necessidade de configuração prévia por parte do usuário. Desta maneira, dá-se maior flexibilidade ao usuário, possibilitando-o assistir aos conteúdos que lhe interessam, no horário mais conveniente, sem ter que se preocupar com isso antecipadamente (i.e., sem a necessidade de configurar algum equipamento para gravar o conteúdo ou saber antecipadamente quais programas lhe interessam). Para isso foram pesquisadas e analisadas tanto tecnologias de transmissão e distribuição de conteúdos, como também o paradigma peer-to-peer, muito utilizado atualmente no compartilhamento de arquivos na Internet. A partir daí, foi concebida uma arquitetura capaz de oferecer tanto o serviço tradicional de transmissão linear de TV, quanto de apresentar vídeos deslocados no tempo (i.e., vídeos cuja transmissão linear já foi iniciada ou até concluída, a partir de qualquer posição já transmitida), combinando-se técnicas de multidifusão de dados, armazenamento distribuído e protocolos peer-to-peer. Desta maneira, obteve-se uma solução eficiente, utilizando-se os recursos disponíveis em todo o sistema, incluindo recursos ociosos dos usuários finais, para auxiliar no armazenamento e distribuição dos conteúdos deslocados no tempo. Finalmente, um protótipo foi desenvolvido como prova de conceito da arquitetura proposta neste trabalho, e, juntamente com os testes realizados, comprovam a viabilidade de se utilizar redes P2P para a distribuição dos conteúdos para a apresentação deslocada no tempo. / Telecommunication companies are suffering from the increasing offer of cheap and reliable voice over IP services, being forced to diversify their services looking for new revenue possibilities. Since these companies have a vast infrastructure, they are now providing TV services through the same telephony and data infrastructure, using their IP networks to offer IPTV. The goal of the present work is to allow, in this scenario, that such companies offer, additionally to the traditional TV services (e.g., the linear transmissions of the TV channels), differentiated services through the same infrastructure. The focus of the present work is, therefore, the offering of the time-shift service, allowing users to watch linear transmitted contents, time-shifted, without the need for any in-advance configuration. This approach gives more flexibility to the users, allowing them to choose the most appropriate time to watch some content without having to specify their interests in advance (i.e., without configuring some equipment to record the content or knowing in advance which programs will interest themselves). To achieve this goal, technologies for content transmission and distribution, as well as the peer-to-peer paradigm for file sharing were studied, resulting in the development of an architecture capable of offering the traditional linear transmissions service as well as the possibility of time-shift, combining multicast, distributed caching and peer-to-peer technologies. Accordingly, an efficient solution was envisioned, making use of all available resources in the system, including idle resources in the user equipments, to help in the caching and distribution of the time-shifted contents. Finally, a prototype was developed as a proof-of-concept for the designed architecture, which together with the performed tests, shows the viability of utilizing P2P networks in the distribution of time-shifted contents.
|
Page generated in 0.119 seconds