Table of Contents
ISRN Communications and Networking
Volume 2011, Article ID 201314, 11 pages
Research Article

Window-Based Popularity Caching for IPTV On-Demand Services

Department of Multimedia Applications Laboratory, Chunghwa Telecom Laboratories, Taoyuan 32601, Taiwan

Received 16 June 2011; Accepted 25 July 2011

Academic Editor: M. Maier

Copyright © 2011 Hsuan Chiu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


In recent years, many telecommunication companies have regarded IP network as a new delivery platform for providing TV services because IP network is equipped with two-way and high-speed communication abilities which are appropriate to provide on-demand services and linear TV programs. However, in this IPTV system, the requests of VOD (video on demand) are usually aggregated in a short period intensively and user preferences are fluctuated dynamically. Moreover, the VOD content is updated frequently under the management of IPTV providers. Thus, an accurate popularity prediction method and an effective cache system are vital because they affect the IPTV performance directly. This paper proposed a new window-based popularity mechanism which automatically responds to the fluctuation of user interests and instantly adjusts the popularity of VOD. Further, we applied our method to a commercial IPTV system and the results illustrated that our mechanism indeed offers a significant improvement.

1. Introduction

In the recent few years, there has been an undeniable global trend on developing IPTV (Internet protocol television) network among telecommunication companies because they have believed that IPTV is a new generation of TV industry. Comparing to the traditional broadcast services (or linear programming TV), IPTV possesses its unique competitive advantages. For example, it is more suitable to support personalized service since it transmits the user requests to the control center immediately and it recognizes user identity straightforwardly. On the other hand, all data on IPTV are encoded as a series of IP packets and conveyed to the audience through the residential broadband access network. This characteristic removes the traditional restrictions of watching TV. Any Internet-connectable digital devices equipped with a multimedia player could be a “TV.” For telecommunication companies, these unique characteristics create more opportunities for developing new services on the next generation TV industry.

In Taiwan, MOD (media-on-demand) service is one of the most representative IPTV applications developed by Chunghwa Telecom Company (CHT). An important breakthrough is that MOD turns the control back to the audience so that they can book different paid channels according to their program watching custom. MOD provides services over a managed IP (Internet protocol) network and subscribers are constrained geographically. Through IP network, they transmit television channel, movies and different multimedia content to the MOD set-top box (STB) and audience could watch them on the TV. Within this network, service providers must guarantee the quality of service when they transmit video stream to the end user no matter the stream is encoded with standard or high definition. Therefore, when an end user requests a service, a unicast connection will be established from the central video server to the requesting user. If the number of user requests increases dramatically, it might generate overwhelming traffic cost in the network. For preventing this situation, MOD adopts proxy-based architecture and redirection mechanism as its network structure. As a result, all of the client requests will be oriented to the nearest proxy servers (we use term “local servers” or “cache” interchangeably) in each local area at first. If there is no available video at local server, these requests will be redirected to the central servers (we adopt the term “global servers” alternatively). However, the server storage capacity is limited and the cost of local servers is expensive. To determine which VOD is worthy to be stored in the cache should be carefully considered. It is apparent that placing popular content at the cache is the most economical solution because it guarantees that a maximal amount of demands can be supplied from the cache and the traffic cost from central video server to requesting users can be reduced.

In reality, the information of popular content is not acquirable until user requests are generated. On the other hand, the popularity of VOD content may evolve over time according to the diverse audience preferences. Furthermore, the status of a real online system alternates dynamically and the cache decision should be adjusted immediately according to the context. All of these requirements pose new challenges on designing the IPTV caching algorithm.

In this paper, we propose the window-based popularity mechanism (WBPM) which aims to automatically react to the rapid change of user demands and effectively make cache decision. In addition, we ensure that our cache decision is accurate and the local servers should store necessary content only. Moreover, WBPM need not pay any additional maintaining cost and it is simple to be implemented on IPTV system. We build a window-based popularity caching system (WBPCS) which is constructed on the basis of WBPM. WBPCS replenishes the popular VOD immediately and we expect that most demands can be supplied at local servers instantly.

The rest of the paper is organized as follows. Section 2 introduces related studies in the VOD delivery system, and the concept of window-based popularity will be clarified in Section 3. Our proposed popularity computation models and content allocation methods will be presented in Section 4. In Section 5, we experiment our mechanism on MOD and we measure the effectiveness. Finally, we summarize our experiment results and offer conclusions in Section 6.

2. Related Studies in the VOD Delivery System

2.1. IPTV Architecture

In IPTV network, VOD and other video services consume enormous bandwidth when many users simultaneously request the VOD services. Thus, for IPTV services, to effectively deploy the VOD system is crucial. According to Thouin and Coates [1], there are two common topologies applied to VOD deployments: centralized and proxy based. Centralized deployment method has a central server and all user requests are directed to it. Proxy based architecture consists of a central server and several proxy servers. The former contains all VOD files, while the latter store only part of popular videos. All client requests are oriented to the nearest proxy server at first. If there is no available video at proxy server, these requests will be redirected to the central server. In addition, Chen et al. [2] suggest that P2P (peer-to-peer) may be another helpful choice in providing IPTV services because of its noted file-transferring capabilities. In general, most IPTV network architectures managed by telecommunication companies still adopt proxy-based deployment. After all, it performs well in several aspects so far, such as minimizing end-user latency, reducing bandwidth consumption, and decreasing the central server loading; however, all of these benefits must rely on a well-designed caching strategy.

2.2. Caching Strategy

Caching strategies are effective mechanisms for mitigating the massive loading from global server to local servers. It takes advantage of storage capacity to absorb traffic by locating the most popular video replica at local servers instead of storing them in central location only. When designing caching strategy, popular content prefetching and content allocation are two vital criteria.

2.2.1. Content Prefetching

Content prefetching relates to selecting popular items and preserving them at the cache before enormous requests arise. The popularity is defined as the likelihood that content might be fetched in the near future. Previous studies modeled the popularity distribution on the assumption of Zipf’s law or Zipf-like law. Actually, Zipf-like law describes the Web object access distribution suitably. For example, Breslau et al. [3] gave six traces ranging from academic, corporate to ISP environments and this evidence supported that Web accessed pattern followed the Zipf-like distribution. In order to assure that the measured popularity is reliable, Shi et al. [4] suggested a time interval which is the most appropriate length to collect the Web accessed information. In IPTV system, the characteristics of VOD have some minor variances with Web objects, such as average file size, object life cycle, and user behavior. Qiu et al. [5] gathered real data and performed an in-depth analysis on several aspects of IPTV user behaviors, including durations for on, off, and channel sessions, time-varying rates of switching-on, switching-off, and channel switching events, and channel popularity. In our work, we study the VOD request pattern and form the popularity distribution from the real data collected from MOD. We tend to indicate that VOD content in IPTV system also follows Zipf’s law in static and 80/20 rule is reasonable when deciding the caching quantity.

In reality, content popularity distribution is hard to know in advance and some previous works asserted that the popularity distribution will evolve and be volatile [6, 7]. De Vleeschauwer and Laevens [7] proposed a generic model that captures popularity evolution trend and applied exponential smoothing (ES) method to track the momentary popularity. Verhoeyen et al. [6] proposed Alcatel-Lucent 5910 Video Server caching architecture (A-Lu 5910), which also used ES method for tracking each VOD popularity. A-Lu 5910 aimed to allocate content to cache dynamically and respond to adjust popularity automatically. ES considers weighted average between the new popularity and the one obtained just after the previous period: 𝑃𝑖,now=𝛾𝑃𝑖,old+(1𝑟)𝑃𝑖,new,(1) where 𝑖 represents a specific VOD, 𝑃𝑖,new is the popularity of VOD 𝑖 at the newest period, and 𝑃𝑖,old is the past popularity of 𝑖 measured since item 𝑖 launched until the end of last period. The weight 𝑟(0<𝑟<1) is a parameter which determines how much history is taken into account when tracking popularity distributions. Actually, A-Lu 5910 is not suitable to handle the explosive rise and fall in popularity. In MOD environment, the demands of VOD usually amass in a short period and user interests change dynamically because the content of VOD is updated frequently under the manipulation by CHT providers. Tracking the popularity of every VOD is not practical for online IPTV system since it will cause additional operating cost for maintaining surplus popularity information. Hence, an essential issue faced by MOD is how to adjust popularity degree immediately and modify caching decision flexibly.

2.2.2. Content Allocation

Content allocation concerns how to deploy the most popular objects in the cache, and this topic is involved with wide range of considerations, such as data placement, data replacement, and equipment allocation. The problem data placement on multiple disks has been proved by Dowdy and Foster [8] to be an NP-complete problem. Heuristic algorithms such as greedy [9] and sort partition (SP) [10] have been proved to be available solutions. Data replacement algorithm [11] has been developed for improving hit ratio from virtual memory paging to Web caching. In IPTV network, the volume space of local servers is limited so that data replacement is needed. Moreover, most content allocation optimization solutions under VOD environment were given assumption that content popularity distribution was predetermined, and they aimed to minimize other cost problems. For example, Thouin et al. [12] intended to solve equipment allocation problem by determining the number of VOD servers deployed at each network end site. Nimkar et al. [13] proposed a greedy algorithm with INLP model for balancing proxy-server loading which considers server bandwidth and video file size. For IPTV architecture, Sofman et al. [14] proposed a U-turn caching architecture where each proxy server can obtain video not only from upper level servers but also from the equal level neighbor servers. Under this U-turn caching structure, Borst et al. [15] provided a light-weight cooperative cache management algorithm which was aimed at maximizing the traffic volume served from cache and reducing the bandwidth cost as large as possible. Sofman and Krogfoss [16] presented an analytic model for investigating the effects of hierarchical cache optimization. The hierarchical cache optimization intended to minimize network cost by technically distributing cache capacity involving with several factors such as traffic volume, memory size, and topology. Sofman et al. and Jian et al. [14, 17] considered heuristic content allocation methods for solving cache optimization problem under hierarchical architecture.

3. An Overview of Window-Based Popularity Caching System

3.1. Concept of Window-Based Popularity

Caching mechanism is regarded as an effective method for alleviating global server loading and network cost. One reason is that caching the most popular objects ensures that most requests can be served while the other is that the traffic volume from global servers can be reduced. The content popularity is defined as the probability that it will be requested in the future. In practical situation, content popularity distribution is not a priori known so that the prediction technique is needed. Most prediction methods measured content popularity by aggregating user requests over time for a certain content. In a real online system, an accurate and fast response prediction is vital because audience requests fluctuate rapidly. On the other hand, since most VOD file sizes are large and the amounts of user requests and media files are tremendous, it is necessary to design a reliable and flexible popularity prediction without any additional loading effort.

According to these issues mentioned, we propose a window-based popularity mechanism which is not only accurate and robust but also facile to be implemented on a real system. We suppose that the content popularity is more related to the recent audience interests than long-term user preference. Moreover, most VOD programs exist with a short life cycle. Hence, we define a window, which is a time period starting from time 𝑇𝑎 to time 𝑇𝑏 where 𝑇𝑎<𝑇𝑏, and a VOD popularity is gathered during the window. As the window moves on, we obtain the newest content popularity which is derived from the nearest time period.

For the rest of the paper, video request sequence in a certain local area denotes the sequence of VOD accessed by local area users.

Definition 1. A video request sequence during a time window 𝑇𝑎,𝑏, denoted as 𝑅𝐴𝑖𝑇𝑎,𝑏, is a sequence of video requests that are accessed from local area 𝐴𝑖 and are ordered by arriving time from 𝑡𝑎 to 𝑡𝑏.𝑅𝐴𝑖𝑇𝑎,𝑏 is expressed as 𝑟𝐴𝑖𝑉𝑗,𝑡𝑎,𝑟𝐴𝑖𝑉𝑘,𝑡𝑎+1,,𝑟𝐴𝑖𝑉𝑙,𝑡𝑏 and 𝑡𝑎<𝑡𝑎+1<<𝑡𝑏, where 𝑟𝐴𝑖𝑉𝑗,𝑡𝑎denotes the request of VOD object 𝑉𝑗 from area 𝐴𝑖 accessed at time 𝑡𝑎. If 𝑟𝐴𝑖𝑉𝑗,𝑡𝑎=0, then 𝑉𝑗 can be provided from proxy servers at area 𝐴𝑖; otherwise, if 𝑟𝐴𝑖𝑉𝑗,𝑡𝑎=1, 𝑉𝑗 should be supplied from central server in global area 𝐴𝐺.𝑡𝑎 is the starting time index of the time window, and 𝑡𝑏 is the last time index of the time window.

3.2. Proposed Framework of Window-Based Popularity Caching System

Figure 1 shows the framework of window-based popularity caching system (WBPCS) which is built on window-based popularity mechanism (WBPM). WBPCS is an automatic process for distributing video files to central servers in global area (global servers) and proxy servers in local area (local servers). Mainly, it is designed for predicting popularity of VOD content and caching popular VOD at local area. WBPCS contains several processing modules: program manager (PM), user information collector (UIC), WBPM, and content cleaner (CC). At the beginning, the daily program schedules are injected into PM module which is responsible for maintaining the life cycle of programs. When a new program is launched, its media file should be uploaded to global servers. After the file is allocated to global servers, set-top boxes in users’ houses are allowed to access video contents from global servers. Considering the network cost and server loading, it is uneconomical to satisfy all VOD requests from global server. Hence, WBPM is created for prefetching popular contents and caching them at local servers. First, UIC gathers audience’s watching records from all local servers and data analyzer writes retrieved information back to the database periodically. The information which WBPM needs is what media has been accessed by which set-top box from which area during a specific period. If a VOD is always obtained from global servers, this represents that no replica exist in local servers; moreover, if the request frequency is high, this means that the local area should place a duplicate file in order to reduce the transmission loading. This information is incorporated into WBPM, and popular contents are determined by our window-based popularity algorithm. We propose two kinds of window-based popularity algorithm which consider global popularity and local popularity, respectively. After deriving the content popularity, WBPM filters out unpopular items and makes cache decision to allocate popular content to necessary area. Finally, CC evicts unessential content periodically so that the space will be recycled.

Figure 1: Proposed framework of window-based popularity caching system.

4. Window-Based Popularity Mechanism

In the following, we will illustrate several content request distributions in MOD, and we will propose two window-based popularity mechanisms.

4.1. Distribution of MOD Content Requests

In the recent 10 years, MOD has been developed as a mature IPTV system, which has owned over 800,000 subscribers in Taiwan. More than 10,000 of VOD programs and various services have been provided. This VOD request distribution and user behavior information will be a supportive evidence for developing cache mechanism.

We retrieve about eight thousand VODs as sample data set and illustrate the relationship between request frequency and ranking on log-log scale in Figure 2. Rank 1 means the most frequently accessed media file. From the plots, it is obvious that the curve fit the straight line with minor bias. The straight line suggests that the popular video accessing frequency is proportional to 1/𝑖𝛼, where 𝛼=0.765. Hence, we find that the distribution of VOD data in MOD also conforms to Zipf’s law. In Figure 3, we present the cumulative probability of access for the top 𝑛% of VOD data, and the result shows that top 20% popular VOD contents are able to satisfy 80% demands. This proves that a small portion of popular contents is able to supply most demands. Furthermore, if we place more VOD at proxy server, such as more than 40%, the hit ratio will not significantly rise than that if we allocate only 30% VOD.

Figure 2: Frequency of VOD content accessing versus content ranking.
Figure 3: Cumulative distribution of requests to VOD.

Figure 4 describes user VOD watching behavior in one week and the amplitude oscillate fiercely during weekend but smoothly on usual day. On the other hand, Figure 5 demonstrates the life cycle and access frequency of several VODs. It can be observed that most contents have short life period and user requests may increase rapidly around a specific time. Hence, considering user recent request pattern is helpful when deciding content popularity. In the following, we will propose two methods for calculating content popularity as the basis for WBPCS.

Figure 4: Daily user requests rate in a week.
Figure 5: A few typical traces of the daily popularity of VOD contents on MOD.
4.2. Global Window-Based Popularity (GWBP)

In this section, we illustrate the global window-based popularity computation model and describe the content placement mechanism. Each local area has a request sequence during a time window 𝑇𝑎,𝑏, as the window moves forward the popularity of video 𝑉𝑗 will alter according to the newest audience demands pattern. We collect the popularity of video 𝑉𝑗 from each local area and determine which popular VOD should be duplicated and allocated at proxy server.

Suppose that we have 𝑁 local areas and one global area 𝐴𝐺, each local area 𝐴𝑖 has a video request sequence 𝑅𝐴𝑖𝑇𝑎,𝑏during a time window 𝑇𝑎,𝑏. When 𝑟𝐴𝑖𝑉𝑗,𝑡𝑎=1, the request of video 𝑉𝑗 at 𝑡𝑎 should be redirected to global area 𝐴𝐺. We assume that there are 𝑀 videos provided by servers at 𝐴𝐺 during 𝑇𝑎,𝑏, and we collect the amount of requests of each video file 𝑉𝑗 from 𝑅𝐴𝑖𝑇𝑎,𝑏, where 𝑖 is from 1 to 𝑁 and 𝑟𝐴𝑖𝑉𝑗,𝑡𝑎=1. We define the popularity of 𝑉𝑗 at 𝐴𝑖 as Gp𝐴𝑖𝑉𝑗,𝑇𝑎,𝑏=𝑏𝑦=𝑎𝑟𝐴𝑖𝑉𝑗,𝑡𝑦𝑁𝑥=1𝑀𝑧=1𝑏𝑦=𝑎𝑟𝐴𝑥𝑉𝑧,𝑡𝑦,(2) and 𝑀 popularity degrees will form a set GP𝐴𝐺𝑇𝑎,𝑏 which is expressed as Gp𝐴𝑖𝑉𝑗,𝑇𝑎,𝑏,,Gp𝐴𝑁𝑉𝑀,𝑇𝑎,𝑏 in descending order. Since our data, which is retrieved from MOD system with practical audience behavior records, conforms to Zipf’s model, it is reasonable to place a small portion of GP𝐴𝐺𝑇𝑎,𝑏 at local area so that most demands in the future will be satisfied. We create a popular content set GPCS𝐴𝐺𝑇𝑎,𝑏, which contains top 𝐾 percent of elements in GP𝐴𝐺𝑇𝑎,𝑏 and allocate each item with popular degree Gp𝐴𝑖𝑉𝑗,𝑇𝑎,𝑏in GPCS𝐴𝐺𝑇𝑎,𝑏 to the area 𝐴𝑖. As the window is moves forward, the popularity of each item at each local area adjusted dynamically with the fluctuation of user demands collected in short term period.

Figure 6 shows an example for deriving GWBP for each VOD from area 𝐴𝑖, where RT𝑎,𝑏 represents the sum of request times 𝑏𝑦=𝑎𝑟𝐴𝑖𝑉𝑗,𝑡𝑦. Suppose that we collect content requests at global servers from time a to time 𝑏 and we retrieve top 20% popular items from items gathered from 𝑇𝑎,𝑏. From Figure 6, 𝑉3 will be allocated to area 𝐴3 with the highest popularity degree 0.32. As window moves on, we collect popular items again at time window 𝑇𝑐,𝑑, and then 𝑉5will be placed at 𝐴3.

Figure 6: Illustration of global window-based popularity gathered at global area.
4.3. Local Window-Based Popularity (LWBP)

In this section, we compute the popularity of each VOD item at each local area individually. Considering that the local area audience population may be distinct, we suggest another view, which calculates popularity according to the popularity limited to the local area, to make popular content allocation decision.

Suppose that local area 𝐴𝑖 has a video request sequence 𝑅𝐴𝑖𝑇𝑎,𝑏, where 1𝑖𝑁, and we select videos 𝑉𝑗 with 𝑟𝐴𝑖𝑉𝑗,𝑡𝑦=1, where 𝑎𝑦𝑏. The popularity of 𝑉𝑗 at 𝐴𝑖 will be Lp𝐴𝑖𝑉𝑗,𝑇𝑎,𝑏=𝑏𝑦=𝑎𝑟𝐴𝑖𝑉𝑗,𝑡𝑦|||𝑅𝐴𝑖𝑇𝑎,𝑏|||.(3)|𝑅𝐴𝑖𝑇𝑎,𝑏| is the amount of elements in sequence 𝑅𝐴𝑖𝑇𝑎,𝑏. If 𝑀 video requests from 𝐴1 to 𝐴𝑁 are supplied from 𝐴𝐺 during 𝑇𝑎,𝑏, the popularity of each content from each area will form a set LP𝐴𝐺𝑇𝑎,𝑏 which is expressed as Lp𝐴𝑖𝑉𝑗,𝑇𝑎,𝑏,,Lp𝐴𝑁𝑉𝑀,𝑇𝑎,𝑏 in descending order. After that, a popular content set L𝑃𝐶𝑆𝐴𝐺𝑇𝑎,𝑏 is created, which contains top 𝐾 percent of elements in LP𝐴𝐺𝑇𝑎,𝑏. Each item in LPCS𝐴𝐺𝑇𝑎,𝑏 with a popular degree Lp𝐴𝑖𝑉𝑗,𝑇𝑎,𝑏is allocated to area 𝐴𝑖.

Figure 7 shows an example for deriving LWBP for each VOD item from area 𝐴𝑖, where RT𝑎,𝑏 represents the sum of requests 𝑏𝑦=𝑎𝑟𝐴𝑖𝑉𝑗,𝑡𝑦 and LTR𝑎,𝑏,|𝑅𝐴𝑖𝑇𝑎,𝑏|, means the total requests times at local area 𝐴𝑖 during time 𝑇𝑎,𝑏. Suppose that we collect the popularity of every VOD at each local server from time 𝑎 to time 𝑏 and we retrieve top 20% popular items from items which must be obtained from global servers. From Figure 7, 𝑉4 will be allocated to area 𝐴1 with the highest popularity degree 0.35. As window moves on, we collect popular items again at time window 𝑇𝑐,𝑑 and 𝑉3 will be selected as popular data with popularity degree 0.12 and allocated at area 𝐴3.

Figure 7: Illustration of local window-based popularity gathered at global area.

5. Experiments and Evaluations

In this section, we conducted experiments to evaluate the cache quality for our proposed methods and we compared them with A-Lu 5910 [6]. We describe the experiment set-up in Section 5.1, and we demonstrate the experimental results in Sections 5.2 and 5.3.

5.1. Experiment Setup and Evaluation Metric

In our experiment, we collected the data set from MOD which is an IPTV system provided by CHT company in Taiwan. The data set contained millions of user requests and thousands of VOD content over time. We extracted requests log among several days as sample data and rebuilt content allocation environment. We are concerned with the hit ratio at local area because if the hit ratio is high and stable, we could infer that most audience can download VOD content from local servers. This also implies that the network cost from audience to global servers is reduced. We define the hit ratio at local area and global area as =localhitratioNumberofRequeststoLocalServers=NumberofTotalRequests×100%,globalhitratioNumberofRequeststoGlobalServersNumberofTotalRequests×100%.(4)

5.1.1. Methods Compared in the Experiment

In WBPM, the popularity degree is obtained by aggregating user requests from global area or local area individually. We compare the performance of the two window-based popularity methods with the performance of A-Lu 5910 proposed by Verhoeyen et al. [6]. The cache decision is made according to these popularities. These popularity methods are defined as follows.

Calculate content popularity with global window-based popularity mechanism.

Calculate content popularity with local window-based popularity mechanism.

A-Lu 5910
Calculate content popularity with exponential smoothing popularity mechanism [6] but rank popularity locally.

5.2. Experimental Results

In the experiments, we compared GWBP, LWBP, and A-Lu 5910 from different aspects in Sections 5.2.1–5.2.3. First, we analyzed the difference between GWBP and LWBP. Then, pertaining to A-Lu 5910, we examined the best weight coefficient and history requests inspecting period which ensured that its performance attains the most satisfying level. Finally, we evaluated GWBP, LWBP, and A-Lu 5910 together.

5.2.1. Comparison of the GWBP and the LWBP

In this section, we evaluated the result of GWBP and LWBP. The only difference between GWBP and LWBP is popularity computing methods. The former popularity is divided by the sum of all request counts in global area while the latter is divided by the number of total requests aggregated in local area. From Figure 8, it is obvious to see that GWBP performs better than LWBP at most times, especially around the 49th hour. The reason to cause the gap is that the IPTV providers refresh large amount of VOD content on that day and it is obvious to see that GWBP has much fast adjustment ability. We infer that if a VOD is popular in a local area, it does not represent that the VOD is really popular. It may be just because there is a small portion of audience watching the program during that period in that area. Hence, LWBP may generate error message especially in the VOD content update time interval. Except for the gap, LWBP performs not far inferiorly than GWBP.

Figure 8: Comparison of the GWBP and LWBP.
5.2.2. Examination of the Best Coefficient and History Requests Inspect Period of A-Lu 5910

In this experiment, we evaluated the performance of A-Lu 5910 under different 𝛾 coefficients which determines how much the past popularity value influences the newest popularity measurement. From Figure 9, the result implies that the coefficient value makes no significant difference between these 𝛾 values, and this conclusion corresponds to the experiment made by Verhoeyen et al. [6].

Figure 9: Comparing the coefficient value 𝛾of A-Lu 5910.

Next, we aim to discover a proper history request inspect period for A-Lu 5910 and the outcome presents that the shorter the period we collected data for A-Lu 5910, the more precise the popularity prediction of A-Lu 5910. The three gaps in Figure 10 emphasize the effects. In the further experiment, we intended to compare the performance of GWBP, LWBP, and A-Lu 5910. We set A-Lu 5910 with parameter 𝛾=0.2 and inspect period 6 hours.

Figure 10: Comparing the iterate periods of A-Lu 5910.
5.2.3. Comparison with All Methods

Considering the best inspect period of A-Lu 5910, we applied the same time length as the window size to GWBP and LWBP and we allocated equivalent VOD quantities to local area in each time unit for our methods and A-Lu 5910. From Figure 11, GWBP usually keeps the highest hit ratio in most situations especially around the gap and there is only minor variance between LWBP and A-Lu 5910. Hence, we can draw two conclusions. The first is that the popularity examined by global view is much confident than the gathered in local view. The second is that even though the result of LWBP and A-Lu 5910 seems to have no significant difference, the LWBP often performs better than A-Lu 5910 when the hit ratio of A-Lu 5910 decreases to the lower point. This implies that the recovery ability of window-based popularity mechanism is superior to A-Lu 5910 and our method is able to respond to changeable demands flexibly and immediately.

Figure 11: Comparison of all methods.
5.3. Comparison with the Preadopt-to-Postadopt WBPCS on MOD System
5.3.1. MOD System before Adopting WBPCS

From Figure 12, the local hit ratio before applying WBPCS was unsteady and it varied rapidly. MOD system attained only 60 percent hit ratio. On the other side, the hit ratio of global servers was near to 40 percent which meant that the network loading was heavy between audience and global servers.

Figure 12: Hit ratio before MOD adopts WBPCS.
5.3.2. MOD System after Adopting WBPCS

After WBPCS was applied to MOD system, it is clear to observe that the hit ratio in local servers increases to 75 percent and the hit ratio in global servers decreases to 25 percent. The gap between them is larger than the MOD system without WBPCS assistance. The data presented in Figure 13 was collected when MOD just adopted WBPCS. When the time goes by, this situation remained steady and the improvement was more significant. In Figure 14, we collected the data after MOD adopted WBPCS for a long time. From the trend, the hit ratio in local area augments to nearly 80 percent and the difference between it and global hit ratio expands by 60 percent. This inspiring result demonstrates that the WBPCS system indeed supplies an apparent contribution.

Figure 13: Hit ratio of MOD just adopting WBPCS.
Figure 14: Hit ratio of MOD adopting WBPCS for a long time.

6. Conclusions and Future Work

A new challenge in IPTV system is how to design an effective and adjustable cache system since the on-demand object in IPTV are different from the on-demand objects in Web in some aspects. In IPTV environment, the demands of VOD usually amass in a short period and user interests change dynamically. On the other hand, the VOD content is updated frequently under the manipulation of IPTV providers. How to design an effective and adjustable cache system has become a new issue.

In this research, we propose a window-based popularity mechanism to derive the popularity degree of VOD in IPTV environment. Considering the challenge in IPTV system, our method is designed to be equipped with immediate reactivity according to the change of user preferences. Comparing to the method A-Lu 5910, proposed by Verhoeyen et al. [6], WBPM is simpler and robust because it is needless to maintain and update the popularity degree of every VOD in each iterative period. Furthermore, the experiment results demonstrate that the global popularity is more confidential than local popularity since the VOD which is regarded as a popular item in a local area may be only because the number of total users is few. Our proposed methods calculate the popularity of VOD during a specific time window and they respond to context automatically and instantly. From the experiment results, we discover that the popularity prediction accuracy of WBPM is superior to conventional popularity tracking method and WBPM indeed made a significant improvement on practical system. In our future study, we intend to further analyze the cache problem of more diverse VOD which is equipped with distinct business policy. Moreover, our current study does not consider the practical size of VOD and the relationship with server volume, also, the content allocation optimization will be our next interest issue.


  1. F. Thouin and M. Coates, “Video-on-demand networks: design approaches and future challenges,” IEEE Network, vol. 21, no. 2, pp. 42–48, 2007. View at Publisher · View at Google Scholar · View at Scopus
  2. Y. F. Chen, Y. Huang, R. Jana et al., “Towards capacity and profit optimization of video-on-demand services in a peer-assisted IPTV platform,” Multimedia Systems, vol. 15, no. 1, pp. 19–32, 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. L. Breslau, C. Pei, F. Li, G. Phillips, and S. Shenker, “Web caching and Zipf-like distributions: evidence and implications,” in Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '99), vol. 1, pp. 126–134, New York, NY, USA, March 1999. View at Publisher · View at Google Scholar
  4. L. Shi, Z. Gu, L. Wei, and Y. Shi, “An applicative study of Zipf's law on web cache,” International Journal of Information Technology, vol. 12, pp. 49–57, 2006. View at Google Scholar
  5. T. Qiu, Z. Ge, S. Lee, J. Wang, J. Xu, and Q. Zhao, “Modeling user activities in a large IPTV system,” in Proceedings of the Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement Conference (IMC '09 ), pp. 430–441, ACM, Chicago, Ill, USA, 2009. View at Publisher · View at Google Scholar
  6. M. Verhoeyen, D. De Vleeschauwer, and D. Robinson, “Content storage architectures for boosted IPTV service,” Bell Labs Technical Journal, vol. 13, no. 3, pp. 29–44, 2008. View at Publisher · View at Google Scholar · View at Scopus
  7. D. De Vleeschauwer and K. Laevens, “Performance of caching algorithms for IPTV on-demand services,” IEEE Transactions on Broadcasting, vol. 55, pp. 491–501, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. L. W. Dowdy and D. V. Foster, “Comparative models of the file assignment problem,” ACM Computing Surveys, vol. 14, no. 2, pp. 287–313, 1982. View at Publisher · View at Google Scholar
  9. R. L. Graham, “Bounds on multiprocessing timing anomalies,” SIAM Journal on Applied Mathematics, vol. 7, no. 2, pp. 416–429, 1969. View at Google Scholar · View at Scopus
  10. L. W. Lee, P. Scheuermann, and R. Vingralek, “File assignment in parallel I/O systems with minimal variance of service time,” IEEE Transactions on Computers, vol. 49, no. 2, pp. 127–140, 2000. View at Publisher · View at Google Scholar · View at Scopus
  11. C. Pei and I. Sandy, “Cost-aware WWW proxy caching algorithms,” in Proceedings of the USENIX Symposium on Internet Technologies and Systems, USENIX Association, Monterey, Calif, USA, December 1997.
  12. F. Thouin, M. Coates, and D. Goodwill, “Video-on-demand equipment allocation,” in Proceedings of the 5th IEEE International Symposium on Network Computing and Applications (NCA '06), pp. 103–110, Cambridge, Mass, USA, July 2006. View at Publisher · View at Google Scholar
  13. A. Nimkar, C. Mandal, and C. Reade, “Video placement and disk load balancing algorithm for VoD proxy server,” in Proceedings of the 2009 IEEE International Conference on Internet Multimedia Services Architecture and Applications (IMSAA '09), pp. 1–6, Bangalore, India, December 2009. View at Publisher · View at Google Scholar
  14. L. B. Sofman, B. Krogfoss, and A. Agrawal, “U-turn caching optimization in IPTV networks,” in Proceedings of the IEEE Sarnoff Symposium (SARNOFF '09), pp. 1–5, Princeton, NJ, USA, April 2009. View at Publisher · View at Google Scholar
  15. S. Borst, V. Gupta, and A. Walid, “Distributed caching algorithms for content distribution networks,” in Proceedings of the IEEE INFOCOM, pp. 1–9, San Diego, Calif, USA, March 2010. View at Publisher · View at Google Scholar
  16. L. B. Sofman and B. Krogfoss, “Analytical model for hierarchical cache optimization in IPTV network,” IEEE Transactions on Broadcasting, vol. 55, no. 1, pp. 62–70, 2009. View at Publisher · View at Google Scholar
  17. N. Jian, D. H. K. Tsang, I. S. H. Yeung, and H. Xiaojun, “Hierarchical content routing in large-scale multimedia content delivery network,” in Proceedings of the International Conference on Communications (ICC '03), vol. 2, pp. 854–859, May 2003.