Patching: a multicast technique for true video-on-demand services
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Source-adaptive multilayered multicast algorithms for real-time video distribution
IEEE/ACM Transactions on Networking (TON)
Analysis of educational media server workloads
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Scalability of multicast delivery for non-sequential streaming access
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The dyadic stream merging algorithm
Journal of Algorithms
Minimizing Bandwidth Requirements for On-Demand Data Delivery
IEEE Transactions on Knowledge and Data Engineering
Supplying Instantaneous Video-on-Demand Services Using Controlled Multicast
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Analyzing client interactivity in streaming media
Proceedings of the 13th international conference on World Wide Web
Competitive on-line stream merging algorithms for media-on-demand
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Best-Effort Patching for Multicast True VoD Service
Multimedia Tools and Applications
Scalable media streaming to interactive users
Proceedings of the 13th annual ACM international conference on Multimedia
Measurement and analysis of a streaming-media workload
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Proxy caching for media streaming over the Internet
IEEE Communications Magazine
| Hi-index | 0.00 |
In order to minimize bandwidth requirements and improve on demand streaming media distribution scalability, several distribution protocols based on stream sharing by multiple users have been proposed. Despite the great scalability of these protocols proven for workloads where users access the entire media with no interruptions, several studies show that protocol scalability is severely degraded under interactive scenarios, where users access media segments. These scenarios are commonly observed in real streaming media server workloads. In reply to these results, a number of extensions to the original protocols, optimized for interactive access, have been proposed and evaluated, indicating significant server bandwidth savings even under highly interactive scenarios. However, one of the most promissing class of optimizations may send extra streams through the network during inactive client periods. Therefore, network bandwidth requirements for these optimizations become a critical issue that has not been evaluated yet. This work presents an evaluation of the network bandwidth requirements for the interactive access optimized protocols, considering realistic workloads of different interactivity levels and canonical and real network topologies. Results indicate that the optimizations also lead to a significant reduction in the average network bandwidth requirements (peak of 60%).Visando minimizar os requisitos de banda e aumentar a escalabilidade da distribuição sob demanda de mĩdia contĩnua, v´rios protocolos de distribuição baseados em compartilhamento de fluxos por múltiplos usu´rios foram propostos. Embora esteja comprovada a grande escalabilidade desses protocolos para cargas onde os usu´rios acessam toda a mĩdia sem interrupções, v´rios estudos mostraram que a mesma é severamente degradada em cen´rios interativos, onde os usu´rios acessam segmentos da mĩdia. Cen´rios comumente observados em cargas de acesso a servidores reais de mĩdia contĩnua. Em resposta a esse resultado, v´rias extensões dos protocolos originais, otimizadas para acesso interativo, foram propostas e avaliadas, indicando uma grande economia de banda de servidor mesmo em cen´rios com alta interatividade. Entretanto, uma das classes de otimizações mais promissoras pode enviar fluxos extras pela rede durante perĩodos inativos do cliente. Assim, os requisitos de banda de rede dessas otimizações se torna um ponto crĩtico que ainda não foi avaliado. Este artigo avalia o consumo de banda de rede pelos protocolos otimizados para acessos interativos, considerando cargas de trabalho realistas com diferentes nĩveis de interatividade e topologias de redes canônicas e reais. Os resultados indicam que as otimizações também levam a uma significativa redução no consumo médio de banda de rede (pico de até 60%).