Desain Video on Demand (Vod) Menggunakan High Speed Downlink Packet Access (Hsdpa) Di Wilayah Urban Kota Malang

Layanan Video On Demand (VOD) adalah salah satu dari kegiatan streaming. Layanan VOD membutuhkan alokasi bandwidth yang lebih besar daripada aplikasi streaming suara. High Speed Downlink Packet Access (HSDPA) adalah jaringan generasi 3,5G dengan bandwidth 5 MHz dan data rate mencapai 13,6 Mbps. HSDPA secara teoretis mampu memenuhi kebutuhan untuk layanan VOD. Pada penelitian dilakukan desain konfigurasi layanan VOD pada HSDPA dan kajian penerapannya. Parameter yang digunakan untuk menentukan Quality of Service (QoS) layanan VOD pada HSDPA adalah delay end to end, packet loss dan throughput yang dihitung dengan pendekatan teoretis dan pengamatan langsung menggunakan perangkat analisis jaringan (Wireshark). Wireshark adalah perangkat lunak untuk analisis paket jaringan (packet sniffer). Pada penelitian digunakan 3 jenis resolusi video,yakni 144p, 240p, 360p. Kualitas performansi layanan VOD di daerah Rumah Sakit Syaiful Anwar Malang menggunakan High Speed Downlink Packet Access (HSDPA) adalah sesuai dengan standar ITU-T G.1010 untuk delay dan packet loss ratio (PLR), jika menggunakan video dengan resolusi 144p, 240p.Kata Kunci—VOD, HSDPA, QoS, ITU

Minimizing buffer requirements in video-on-demand servers

23rd Euromicro Conference EUROMICRO 97: 'New Frontiers of Information Technology', Budapest, Hungary, 1-4 Sept 1997Memory management is a key issue when designing cost effective video on demand servers. State of the art techniques, like double buffering, allocate buffers in a per stream basis and require huge amounts of memory. We propose a buffering policy, namely Single Pair of Buffers, that dramatically reduces server memory requirements by reserving a pair of buffers per storage device. By considering in detail disk and network interaction, we have also identified the particular conditions under which this policy can be successfully applied to engineer video on demand servers. Reduction factors of two orders of magnitude compared to the double buffering approach can be obtained. Current disk and network parameters make this technique feasible.Publicad

Efficient memory management in video on demand servers

In this article we present, analyse and evaluate a new memory management technique for video-on-demand servers. Our proposal, Memory Reservation Per Storage Device (MRPSD), relies on the allocation of a fixed, small number of memory buffers per storage device. Selecting adequate scheduling algorithms, information storage strategies and admission control mechanisms, we demonstrate that MRPSD is suited for the deterministic service of variable bit rate streams to intolerant clients. MRPSD allows large memory savings compared to traditional memory management techniques, based on the allocation of a certain amount of memory per client served, without a significant performance penaltyPublicad

Cooperative announcement-based caching for video-on-demand streaming

Recently, video-on-demand (VoD) streaming services like Netflix and Hulu have gained a lot of popularity. This has led to a strong increase in bandwidth capacity requirements in the network. To reduce this network load, the design of appropriate caching strategies is of utmost importance. Based on the fact that, typically, a video stream is temporally segmented into smaller chunks that can be accessed and decoded independently, cache replacement strategies have been developed that take advantage of this temporal structure in the video. In this paper, two caching strategies are proposed that additionally take advantage of the phenomenon of binge watching, where users stream multiple consecutive episodes of the same series, reported by recent user behavior studies to become the everyday behavior. Taking into account this information allows us to predict future segment requests, even before the video playout has started. Two strategies are proposed, both with a different level of coordination between the caches in the network. Using a VoD request trace based on binge watching user characteristics, the presented algorithms have been thoroughly evaluated in multiple network topologies with different characteristics, showing their general applicability. It was shown that in a realistic scenario, the proposed election-based caching strategy can outperform the state-of-the-art by 20% in terms of cache hit ratio while using 4% less network bandwidth

Bandwidth Borrowing Schemes for Instantaneous Video-on-Demand Systems

A controlled multicast scheme provides instantaneous service, but limited server bandwidth causes some user requests to be either delayed or rejected when insufficient free bandwidth is available. Two borrowing schemes are proposed for instantaneous video-on-demand (VOD) that reduce the user request blocking rate by borrowing bandwidth from ongoing video streams when there is insufficient free bandwidth for the server to deliver a new video stream. Both these new schemes have proved to be successful in reducing blocking rate and increasing bandwidth utilization at the expense of temporarily degrading the video quality

Architecture for Cooperative Prefetching in P2P Video-on- Demand System

Most P2P VoD schemes focused on service architectures and overlays optimization without considering segments rarity and the performance of prefetching strategies. As a result, they cannot better support VCRoriented service in heterogeneous environment having clients using free VCR controls. Despite the remarkable popularity in VoD systems, there exist no prior work that studies the performance gap between different prefetching strategies. In this paper, we analyze and understand the performance of different prefetching strategies. Our analytical characterization brings us not only a better understanding of several fundamental tradeoffs in prefetching strategies, but also important insights on the design of P2P VoD system. On the basis of this analysis, we finally proposed a cooperative prefetching strategy called "cooching". In this strategy, the requested segments in VCR interactivities are prefetched into session beforehand using the information collected through gossips. We evaluate our strategy through extensive simulations. The results indicate that the proposed strategy outperforms the existing prefetching mechanisms.Comment: 13 Pages, IJCN