Searcharxiv⌕ Search

arXiv subjects

M Dakshayini

Publications and source records attributed to M Dakshayini.

2 recordsLinked to original sources
arXiv2010

An Optimal Prefix Replication Strategy for VoD Services

In this paper we propose scalable proxy servers cluster architecture of interconnected proxy servers for high quality and high availability services. We also propose an optimal regional popularity based video prefix replication strategy and a scene change based replica caching algorithm that utilizes the zipf-like video popularity distribution to maximize the availability of videos closer to the client and request-servicing rate thereby reducing the client rejection ratio and the response time for the client. The simulation results of our proposed architecture and algorithm show the greater achievement in maximizing the availability of videos, client request-servicing rate and in reduction of initial start-up latency and client rejection ratio.

cs.MM↗
arXiv2009

Prefix based Chaining Scheme for Streaming Popular Videos using Proxy servers in VoD

Streaming high quality videos consumes significantly large amount of network resources. In this context request to service delay, network traffic, congestion and server overloading are the main parameters to be considered in video streaming over the internet that effect the quality of service (QoS). In this paper, we propose an efficient architecture as a cluster of proxy servers and clients that uses a peer to peer (P2P) approach to cooperatively stream the video using chaining technique. We consider the following two key issues in the proposed architecture (1) Prefix caching technique to accommodate more number of videos close to client (2) Cooperative client and proxy chaining to achieve the network efficiency. Our simulation results shows that the proposed approach yields a prefix caching close to the optimal solution minimizing WAN bandwidth usage on server-proxy path by utilizing the proxy-client and client-client path bandwidth, which is much cheaper than the expensive server proxy path bandwidth, server load, and client rejection ratio significantly using chaining.

cs.MM↗