Soumen-Large Scale VoD
Soumen-Large Scale VoD
Soumen-Large Scale VoD
ABSTRACT
Next Generation Network (NGN) provides multimedia services over broadband based networks, which supports high definition TV (HDTV), and DVD quality video-on-demand content. The video services are thus seen as merging mainly three areas such as computing, communication, and broadcasting. It has numerous advantages and more exploration for the large-scale deployment of video-ondemand system is still needed. This is due to its economic and design constraints. Its need significant initial investments for full service provision. This paper presents different estimation for the different topologies and it require efficient planning for a VOD system network. The methodology investigates the network bandwidth requirements of a VOD system based on centralized servers, and distributed local proxies. Network traffic models are developed to evaluate the VOD systems operational bandwidth requirements for these two network architectures. This paper present an efficient estimation of the of the bandwidth requirement for the different architectures.
General Terms
Bandwidth optimization by using the user interactive traffic model.
Keywords
Video on demand System, Traffic, Computation, broadcast.
1. INTRODUCTION
The proposed models provide a framework for studying the key parameters that have influence on the VOD network infrastructure. The research achievements are expected to be very useful for VOD system designers due to the essential roles of appropriate configuration and tuning of multiple VOD system parameters in achieving a cost-effective VOD system design. The network provides a new generation of multimedia services over high speed network and broadband technology that will support high definition television, and the demand for video content of DVD-quality. Thus, the video services for online deliberation will result from the merger of three industries: computing, communications, and broadcasting. Although it involves the many advantages, but there is a need for further research in order to achieve wide spread it. This is due to economic constraints and obstacles faced by design, as well as to the need for a large initial investment required to provide full service. This paper presents an overview and models for planning and selection of the network system based on demand video service. The proposed frame work provide a mechanism to determine the bandwidth
requirements of the network, assuming the two approaches one for central network and the other for distributed. Models have been developed to determine the operational requirements of bandwidth of these two architects. These models also allow the possibility of studying the various factors affecting the infrastructure of the network. It is expected based on the research achievements to be very useful to designers of systems. The video on demand service given the need for proper preparation and the need for multiple network Setting transactions to ensure an effective network of appropriate economic cost.The TV delivery mechanism over NGN will support various services while maintaining its required levels of security, interactivity and reliability. It will allow users to access video services, such as entertainment movies, advertisements, electronic encyclopaedia, interactive games, and educational video documentaries from video servers on a broadband network. Potential new applications based on VOD systems include video information retrieval services, collaboration and conferencing systems, and distance learning [1].To meet and design objectives and to fulfill the requirements of VOD service, VOD systems require continuous data transfer over relatively long periods of time, media synchronization, very large storage, and special indexing and retrieval techniques adapted to multimedia data types. Therefore, a cost effective design for VOD system needs to evaluate a collection of various VOD system components [2]. In terms of the VOD transmission network, the system design must guarantee the required bandwidth for video traffic, and this bandwidth must support the VOD service quality needs and meet its packet loss polices. Video content delivery consumes large amounts of bandwidth in these networks due to its scalability, i.e. it must be able to support a large number of clients, thus imposing a heavy burden on the network and the system resources. A high definition (HD) stream, for instance, may require 10Mbps or more of bandwidth under MPEG-2 encoding. Therefore, any network link that handles many subscribers, each capable of demanding one or more VOD streams, must have enough bandwidth to meet the users demands. In addition, system client must comply with the necessary buffer size and video request rate for the VOD delivery policy [3]. The Video on demand over broadband networks has been a prolific area of research [4-9]. The particular problems of provisioning VOD bandwidth, system deployment and architecture design have also received extensive attention in the literature [1017].Reference [6] develops a performance evaluation tool for the system design and a user activity model to describe the utilization of network bandwidth and video server usage. An extensive survey on video-on-demand networks, their design
International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868 Foundation of Computer Science FCS, New York, USA Volume 2 No.2, February 2012 www.ijais.org
approaches and future research challenges, is covered in [7]. The research in reference [11] builds a mathematical model for determining the TV bandwidth demand of multicast and surfing during commercial breaks. Various scalable VOD distribution architectures for broadband operators (based on a P2P streaming concept), together with schemes for VOD equipment allocation, are discussed in [12, 13] and [10, 14] respectively. This paper provides a planning methodology for analysing VOD architectures in order to determine their bandwidth requirements. Additionally, it examines all the key parameters that have influence on VOD communication networks. The remainder of this paper is organized as follows. In Section II, present the architectures and topologies that have been considered for VOD distribution networks, as well as the access mechanisms and traffic patterns required for retrieval of on-line video files. In Section III, present the planning methodology developed to estimate the VOD network bandwidth requirements. In Section IV, present a performance analysis and simulation parameters of the VOD network, discuss the various results obtained. In the last section, summarize with the acknowledgement and references.
2. COMPONENT ARCHITECTURE
This section describes the basic component required for the video on demand system.
International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868 Foundation of Computer Science FCS, New York, USA Volume 2 No.2, February 2012 www.ijais.org
Network cloud Figure 1: Video-on-demand Network (Centralized) VOD Server VOD Server Switch
Client
Network cloud Local Archives Local Archives VOD Server VOD Server Switch
Client
International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868 Foundation of Computer Science FCS, New York, USA Volume 2 No.2, February 2012 www.ijais.org
1 i
with 0 < < 1 and typically taking on some value less than unity. The request distribution rarely follows the strict Zipf law (for which =1) [18].For Zipf-like distribution, the cumulative probability that one of the K popular movies is accessed (i.e. the probability of a popular movies request) is given asymptotically by
(k ) =
i =1
k 1 (1 )
.(1)
and
(1 ) N (1 )
(k )
(k ) (k / N )(1 )
Because
k / N 1
popular movies [95]. Based on this, we can estimate the probability of a request for an unpopular movie, for a VOD system with
Value
Sat. nights (3to 4 hrs/night)
Punp = 1 (k / N )1
The analytical methods for provisioning links in this study assume steady state busy hour traffic for movie retrieval. In the steady state, multicasting is used to reduce VOD traffic volumes. The network needs to deliver only one video stream (one video server port) for a group of viewers (multicast group) watching the same video or broadcast program
7hrs 1 to 5 times
request attempts per movie per period Holding time of interactive request Interactive-request attempts per movie per period Bandwidth per port SD movie bandwidth Variable; 3Mbps-20Mbps 3Mbps 1 to 4 times 1 to 10 seconds
segment.
bandwidth of all video streams (or server ports) in use. There are two types of request in the VOD network; the first one is the request for initializing or starting the video movie (labelled normal request in the study). The other type is the request for interactive service (e.g. stop/pause, jump forward, fast reverse, etc) to be performed on the viewed movie (labelled interactive request in the study). Since each of these requests is independent from each other, and the arrival
International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868 Foundation of Computer Science FCS, New York, USA Volume 2 No.2, February 2012 www.ijais.org
requests come from large numbers of client set-up terminals, the arrival process of normal requests, as well as of interactive requests, to each video server can be modelled as a Poisson process with average rates n and Now, the number of server ports supported by the VOD network (Sc) can then be found using the Erlang-B formula, from the total calculated network traffic (Mc) with a given blocking probability respectively. With this
PB
, where
k of independent
identically distributed random variables, representing the request inter arrival times, is then the Erlang distribution.
( M C ) SC ( SC )! PB = S C (M C ) N N! N =0
And the requires bandwidth is then Wc = Sc * r
(5)
(6)
Where r is the movie rate (e.g. 3Mbps for SD movie), and the allocated bandwidth per household (Wch) is given by
Wch =
(r * Sc ) ( x * h)
(7)
(4) To simplify the analysis, we assume that most of the clusterarea traffic through the broadband link is for non-popular requests. Therefore, there is no blocked popular request
Z = Multicast factor (i.e. number of viewers who request the same multimedia movie within a short period of time, thus it can be served from the same server port),
traffic at the local server. This assumption is justified as it is expected that local servers will contain all popular movies. We proceed as follows:
h = Number of houses in VOD system cluster service area., p = Penetration of service in a VOD system cluster area,
MCL
ML SL
tn = Holding time of a normal request for a movie in minutes, ti = Holding time of an interactive request in minutes,
T = Peak busy period in minutes.
SCL =
primary servers,
International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868 Foundation of Computer Science FCS, New York, USA Volume 2 No.2, February 2012 www.ijais.org
Pun =
connection technologies such as ADSL or VSAT. Such links work under the assumption that the clients will download more information than they send, and for the VOD clients, the analysis includes an evaluation of the requirements in terms of the number of cluster areas that can be supported as a function of request message length and rate.
Equation 3 as
Pun = 1 (k / N )1
Now
ML
(8)
Let the inbound channel bandwidth = Wu, the number of bits per normal request = Ln , the number of bits per interactive request = Li , interactive request rate per house = request rate per house =
i , normal
( M L ) SL ( S )! PB = SL L N (M ) 0 NL! N=
Now MCL is calculated as follows:
WOC
Woc =
Pxh(n Ln + i Li ) T
(12)
M CL
Similarly we can find SCL from MCL using the Erlang-B formula. The local cluster-area bandwidth WLL and the bandwidth to central servers WLC can be found by multiplying the corresponding number of ports with the movie bandwidth. Finally the total required server ports per cluster area are then the sum of SCL and SL and the total bandwidth per area is given by:
(11)
respectively.
Wch = r *( SCL + S L ) / h
The overall system bandwidth is
TW = x * TWLC
3.4 VOD Inbound Channel Requirements
The effects of some of the centralized system parameters (13) (such as the number of clusters, interactive session like movie holding time, Pause, fast, fast forward and the average number of requests arriving to the system during the peak
In this section we study the requirements of the network inbound channel (from cluster-area clients to VOD servers) that support the proposed VOD system. This is needed as client links may be implemented using asymmetrical
International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868 Foundation of Computer Science FCS, New York, USA Volume 2 No.2, February 2012 www.ijais.org
30
27
24
22
19
15
Figure 4
173.8 163.9 145.3 132.7 127.3 112.5
It is clear from the figure 3 that the VOD systems with the help of clustering significantly reduce the required bandwidth.
52.4 46.7 43.5 41.9 39.4 38.1
For example if there is no cluster i.e. number of cluster is 1 means, bandwidth be consumed as unicast streaming as peer
310.2
305.9
301.2
297.5
288.5
280.1
to peer network. Also, high video movie resolution required bandwidth significantly. In Figures 4 and 5, represents the relationship between the required channel link required to
The table 2 represents the parameters related to the real world scenario of the centralized video on demand system. The other parameters are assign like maximum number of clients in the cluster i.e. X = 250 , h = 600, traffic rate 2.5,
serve the clustered customers. The figures 4 shown the required bandwidth comes down for any types of the interactive session pause/skip/hold/fast-forwards, when the number of cluster is increases. In the simulation, we have considered the total number of clients in the population is fixed. The sum of the clients belongs to each clusters is equal to the total client population size. The bandwidth of the system is also depends on the size of the client population for a given resolution. The blocking probability is used to reduce the load in side server. If the client request forwarded to the server buffer, the client request put into the buffer because already the resources occupied by the other clients. In that case the client is in long delay and unnecessary burden on the storage system, other important area is it will consume the important bandwidth. The blockage probability has great importance to reduce load inside the server i.e. used to load balancing. The blockage probability also used to enhance the overall performance by the full use of the bandwidth. Figure 5, presents the relationship between the client densities inside the cluster the required channel bandwidth for the interactive traffic request rate. The increment of the interactive traffic, (i.e. increment of
n =
i =4,
tn
= 120
seconds , assuming
ti =6,
Figure 3
International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868 Foundation of Computer Science FCS, New York, USA Volume 2 No.2, February 2012 www.ijais.org
of the normal request rate will require more servers to satisfy the system blocking probability that presents in the figure 7. Figure 8 represent the system bandwidths for the local proxy architecture as a function of interactive session. Here the Clustering shown the greater importance in real scenario according to figure 8.
40
50
60
70
80
90
100
Figure 6
The other parameters are assign like maximum number of clients in the cluster i.e. X = 250, h = 600, 6,8 and the interactive session is
n = 2.5, i =4,
ti =6,
Figure 7
tn
= 120 seconds ,
blocking probability =.05. Simulation runs for 5 minutes. The system parameters (such as the number of clusters, interactive session during the peak period on the distributed local proxy system and the channel bandwidth has shown in Table 3. In Figures 6 and 7, presents the relationship between the channel bandwidth and the system normal video request rate and the growing cluster size. Figure 6 presents
bandwidth requirement with the client request for local VOD architecture. The Client request generally follows Gaussian type statistical distribution. In general by increasing the size
Figure 8
International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868 Foundation of Computer Science FCS, New York, USA Volume 2 No.2, February 2012 www.ijais.org
5. FURTHER IMPROVEMENTS
The dynamic spreading cluster and the dynamic request filtering will be added to the extended work. For the dynamic spreading cluster spectrum and the efficiently request handling, new algorithms required. The optimum strategy is also be reviews the help of the traffic scenario.
Lee,Planning and Managing the IPTV Service Deployment ,10th IFIP/IEEE International Symposium on Integrated Network Management, 2007 Volume 25, Issue 21, May 2007, pp. 353-362.
[14] Gyu Myoung Lee, Chae Sub Lee, Woo Seop Rhee and
5. ACKNOWLEDGMENTS
My thanks to the unknown experts who have contributed towards development of the Manuscript.
Jun Kyon Choi, Functional Architecture for NGNBased Personalized IPTV services, IEEE Transaction on Broadcasting, Vol. 55, No. 2, June 2009.
[15] S. Deering and D. CherJton, "Multicast routing in
6. REFERENCES
[1]
datagrarn internetworks and extended LANs," ACM Tran. on Computer Systems, pp.gS-111, May 1990.
[16] L.Souza, A.Ripoll, X.Y. Yang, P. Hernandez, R. Suppi,
Padmavathi Mundur, Robert Simon, and Arun K. Sood, Class Based Access Control for distributed Video on demand Systems ,IEEE Transactions on Circuits and Systems for Video technology, Vol. 15, No. 7, July 2005, March/April 2007. Soumen Kanrar, M.Siraj Class Based Admission Control by Complete Partitioning Video on demand Server IJCNC Vol 2, Issue 1, May 2010. doi: 10.5121/ijcnc.2010.2308 Soumen Kanrar Effcient Traffic Control of VOD System (IJCNC) Vol.3, No.5, Sep 2011 doi: 10.5121/ijcnc.2011.3507 C. Bisdikian and B. Patel. Issues on movie allocation in distributed Video-on-Demand systems. In Proceedings of the IEEE ICC, pages 250-255. IEEE Press, 1995. D. W. Brubeck and L. A. Rowe. Hierarchical storage managencnt in a distributed VoD system. IEEE Multimedia, pages 37-47, Fall 1996. D. J. Gemmell, H. M. Vin, D. D. Kandlur, P. V. Rangan, and L.A. Rowe. Multimedia storage servers: A tutorial. IEEE Computer, 28(5):40-49, 1995. Y. Wang, J. Liu, D. Du, and J. Hsieh. Efficient video file allocation schemes for video-on-demand services. Multimedia Systems, 5(5):283-296, September 1997. J. Wolf, P. Yu, and H. Shachnai. Disk load balancing for Video-on-Desystems. Multimedia Systems, 5(5):358370, September 1997. L. Georgiadis, R. Guerin, V. Peris, and R. Rajan. Efficient support of delay and rate guarantees in an internet. In ACM SIGCOMM, pages 106-1 16, August 1996. sharing approach to flow control - the multiple node case. IEEEZACM Transactions on Networking, 2(2):137-150,1994.
E. Luqu and F. Cores, Designing a Video on Demand System for a Brazilian High Speed Network, Proceedings of the 26th IEEE International Conference on distributed Computing Systems Workshops 2006. [17] Soumen Kanrar, M.Siraj Performance Measurement of the Heterogeneous Network IJCSNS Vol 9 No -8 August 2009. Page 255-261.
[2]
[3]
Author
[4]
[5]
[6]
[7]
[8]
[9]
Soumen Kanrar received the M.Tech. degree in computer science from Indian Institute of Technology Kharagpur India in 2000. Advanced Computer Programming RCC Calcutta India 1998. and MS degree in Applied Mathematics from Jadavpur University India in 1996. BS degree from Calcutta University India. Currently he is working as researcher at Vehere Interactive Calcutta India. Previously he had worked at King Saud University, Riyadh. Formally attached with the University Technology Malaysia. He is the member of IEEE.
Multicast in Distributed Network IJCNS Vol 3, Number 6 June 2010. DOI: 10.4236/ijcns.2010.36074
[12] S.Annapu Reddy ,Exploring IP/VOD in P2P Swarming
Systems ,Proc. INFOCOM 07, Anchorage, AK, May 2007, pp. 2571-75