# A Fairness-Based Access Control Scheme to Optimize IPTV Fast Channel Changing

Authors: Junyu Lai; James C. F. Li; Alireza Abdollahpouri; Jianhua Zhang; Ming Lei
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

IPTV services are typically featured with a longer channel changing delay compared to the conventional TV systems. The major contributor to this lies in the time spent on intraframe (I-frame) acquisition during channel changing. Currently, most widely adopted fast channel changing (FCC) methods rely on promptly transmitting to the client (conducting the channel changing) a retained I-frame of the targeted channel as a separate unicasting stream. However, this I-frame acceleration mechanism has an inherent scalability problem due to the explosions of channel changing requests during commercial breaks. In this paper, we propose a fairness-based admission control (FAC) scheme for the original I-frame acceleration mechanism to enhance its scalability by decreasing the bandwidth demands. Based on the channel changing history of every client, the FAC scheme can intelligently decide whether or not to conduct the I-frame acceleration for each channel change request. Comprehensive simulation experiments demonstrate the potential of our proposed FAC scheme to effectively optimize the scalability of the I-frame acceleration mechanism, particularly in commercial breaks. Meanwhile, the FAC scheme only slightly increases the average channel changing delay by temporarily disabling FCC (i.e., I-frame acceleration) for the clients who are addicted to frequent channel zapping.


---

## Body

## 1. Introduction

A vitally important factor leading IPTV services to be successful is to ensure clients’ quality of experience (QoE) to be better than or at least comparable to the conventional TV systems. However, IPTV systems are generally featured with a longer channel changing delay, which is around 2 seconds, and can lengthen from 5 to 10 seconds with next generation video coding paradigms. This unfavourable feature can fatally degrade clients’ QoE and, consequently, incur revenue loss for IPTV service providers. TV channel changing delay is defined as the latency between the initiation of changing to a targeted channel (e.g., by pressing the buttons on the remote control) and the final display of the content on that channel. In a typical IPTV system, channel changing delay consists of several different components, which are summarized in Table1. A representative mean value for each component is also given based on previous literature and practical measurements [1]. It is obvious that the latency owing to Intraframe (I-frame) acquisition is the dominant factor contributing to the total channel changing delay. I-frame acquisition delay is directly related to the compression schemes used in modern video codec technologies (such as MPEG-2 or MPEG-4). More specifically, pictures in a video stream are encoded into either intracoded mode (i.e., I-frame) or interprediction mode (i.e., P- or B-frame). I-frames do not rely on any other frame for decoding, while the decoding of a P- or B-frame depends on the neighbouring frame(s). Owing to the fact that the size of an I-frame is typically much larger than that of a P- or B-frame, the frequency of the I-frames in a video stream should be small enough for an efficient compression scheme. Also note that when a user switches into a specific channel the upcoming I-frame should be the first independently decodable frame. Thus, we denote the time a user has to wait until the next I-frame arrives as I-frame acquisition delay.Table 1
Major components of channel changing delay.
Delay component
Typical latency (ms)
IGMP session joining/leaving for multicast delivery
~100
Network latency and jitter
~100
Client stream buffering (network dejitter buffer and video input buffer)
~250
I-frame acquisition
~1000 (GOP duration is 2 seconds)
Video/audio synchronization
~200
Content authorization
~100In order to decrease the IPTV channel changing delay, various fast channel changing (FCC) methods are proposed. Among them the most widely adopted ones in practical engineering are based on the so-calledI-frame acceleration mechanism. The IPTV system promptly transmits to a user conducting channel changing a retained I-frame of the requested channel as an (accelerated) uncasting communication, so as to reduce user waiting time for the first picture of the targeted channel. However, this mechanism has an inherent scalability problem which can be aggravated by the explosions of channel changing requests during commercial breaks. In particular, the scalability problem refers to the case that the network bandwidth required by using this I-frame acceleration mechanism can be considerably larger than the available bandwidth, which accordingly introduces heavy degradations to network quality of service (QoS) and user QoE. In order to mitigate the problem, we propose a fairness-based admission control (FAC) scheme as a scalability optimization method for the I-frame acceleration mechanism. Based on the channel changing histories of all the clients, our proposed FAC scheme can intelligently decide whether or not to conduct I-frame acceleration at each arrival of channel change requests. We carry out comprehensive simulation experiments, which demonstrates the potential of our proposed FAC scheme to optimize the scalability of the most widely used I-frame acceleration mechanism. Besides, the disadvantage brought by using the FAC scheme is also investigated.The rest of the paper is organized as follows. Section2 presents the state-of-the-art. More detailed introduction of the I-frame acceleration mechanism as well as its shortcomings is introduced in Section 3. Our major contribution is illustrated in Section 4, where we propose a FAC scheme in order to optimize the scalability of the aforementioned I-frame acceleration mechanism. Comprehensive simulation experiments have been conducted to evaluate the performance of the FAC scheme in Section 5. Finally, summary and outlook are given in Section 6.


## 2. Related Work

As aforementioned, a short channel changing delay is one of the key factors for IPTV services. In both academia and industry, there exist a plenty of research efforts to reduce the delay associated with different parts of channel changing process (such as those listed in Table1). In [2], Cho et al. proposed an approach based on the prediction that the adjacent channels are more likely to be watched by viewers (choosing channel by UP and DOWN buttons on the remote control) for the next time of channel changing. Their method requires to conduct the simultaneous transmission of the two adjacent channels. Soon after that, an improved approach was introduced in [3], where a statistical selection of channels are derived based on the historical channel changing information of each user, which is more accurate than always choosing the adjacent channels. However, the disadvantage lies in the fact that the bandwidth demand is proportional to the number of channels being concurrently transmitted and, consequently, the bandwidth demands will be tripled if these methods are applied. In order to mitigate the delay introduced by IP multicasting, [4] developed the source-specific multicast (SSM) mechanism to significantly reduce the complexity of IP multicasting routing process. There are a set of schemes [5, 6] aiming to decrease the I-frame acquisition latency based on adding a channel change tune-in stream, in addition to the main stream, for each provided TV channel. More specifically, the tune-in stream can be either a low-resolution (I-frame only) stream [5] or a full resolution (I-frame only) stream [6]. However, the former scheme can only provide a lower resolution before a full resolution I-frame arrives on the main stream, and the latter scheme may introduce prediction mismatches for the P- or B-frames in the main stream if the prediction is based on an I-frame in the tune-in stream. Similar to the low-resolution tune-in stream scheme, scalable video coding (SVC) [7] technology can also be employed to reduce the channel changing delay by using the base layer as the tune-in stream. The only difference lies in the fact that, after turning to the enhancement layer stream, the base layer stream is still used together with the enhancement layer stream to produce a full resolution video. In practice, the most widely used methods (e.g., Microsoft’s FCC [8]) are based on the I-frame acceleration mechanism. As already mentioned, this mechanism promptly transmits to a user conducting channel changing a retained I-frame of the requested channel, aiming to reduce the latency for displaying the first picture of the targeted channel. This method is based on IP unicasting, which may consume a large amount of network bandwidth. In order to mitigate this problem, IP multicasting based I-frame acceleration mechanism was proposed in [9]. As a summary, each of the above approaches has its advantages and application limits. In general, there exist trade-offs between the considered channel changing delay and some other important performance metrics, for example, the consumed bandwidth.As opposed to conventional TV systems, IPTV user behaviour can directly influence the traffic loads on the transmission networks. A large amount of existing research efforts have been conducted on the IPTV traffic characterization as well as user behaviour measurement, analysis, and modelling. In [10] Qiu et al. studied a large national IPTV system and developed a series of analytical models for different aspects of user activities. Ramos et al. [11] modelled the behaviour of a typical user as a rapid burst of channel selection events followed by an extended period of channel viewing. Yu et al. [12] investigated IPTV user activities in terms of zapping rate and session lengths. Cha et al. [13] studied how users select channels in the real world based on a comprehensive trace from a commercial IPTV service, including channel popularity dynamics, aggregate viewing sessions, and content locality. In our previous work [14, 15] (which was an extension of earlier IPTV user behaviour models), we modelled the channel switching behaviour of a single IPTV user. Both channel popularity and user activities have been taken into account. Our proposed IPTV user behaviour automaton (IPTV-UBA) model relies on formal descriptions to capture the characteristics of user behaviours. The aggregate user behaviour can be derived by overlaying the behaviours of a set of users.


## 3. The Most Widely Used Fast Channel Changing Mechanism and Its Shortcomings

As summarized in the previous section, a plenty of research efforts have been carried out to improve the QoE for IPTV clients by shortening the channel changing delay from different perspectives regarding the factors listed in Table1. Due to the fact that I-frame acquisition delay usually has the largest contribution to the total delay, the most effective and practically deployed fast channel changing methods are based on the I-frame acceleration mechanism. This mechanism was firstly proposed by Microsoft [8] and soon afterwards other companies (such as Huawei, ZTE, and Cisco) published their own improvements. In this section, we first present the principle behind the I-frame acceleration mechanism. Then, we discuss the shortcomings of using this mechanism and analyse the reasons.


### 3.1. I-frame Acceleration Mechanism

In a typical IPTV distribution architecture as illustrated in Figure1, there exists a Video Source responsible for transmitting all the live TV channels to its downstream Clients by means of dynamic or static multicasting via the Network in between. The network in the architecture contains a plurality of replication nodes (such as aggregation routers and switches), which forms a hierarchical networking architecture (e.g., tree topology) and supports both multicasting and unicasting communications. The simplified process of a user carrying out a new channel change is marked in Figure 1. A client in the first step sends a channel change request to the Video Source. After the request is approved, the Video Source starts to multicast the requested channel to the client in the second step. In fact, the multicasting joining process corresponding to the channel changing can usually be accomplished by the closest intermediate node to the client in the transmission path, where the requested channel is already available. It is worth noting that in this scenario all the TV channels are transmitted by means of IP multicasting, and the channel changing delay due to I-frame acquisition can be considerably large and variable as discussed in Section 1.Figure 1
A typical IPTV distribution architecture.In order to reduce the channel changing delay and improve the QoE for clients by applying the I-frame acceleration mechanism, a channel change server (CCS) is introduced in the architecture presented in Figure1 (see Figure 2). Depending on various system implementation features such as the scale of an IPTV system, the location of a CCS can be either at the edge of the core network or within a point-of-presence (PoP). The CCS is configured to retain at least the most recent I-frame, that is, the one just transmitted before the current instant, for each IPTV channel, and is adapted to respond to channel change requests from clients by transmitting the retained I-frame of a requested TV channel using an IP unicasting communication (probably with a higher transmission bit-rate than the average multicasting bit-rate), so that clients can receive the first picture of the requested channel much faster. Figure 2 demonstrates the service procedure when a client conducts the channel changing with applying the aforementioned I-frame acceleration mechanism. As can be seen, in the first step, a channel change request from a client is directly sent to the CCS. Then, upon receiving the request the CCS immediately transmits the retained I-frame of the requested channel back to the client by means of IP unicasting. Next, the client initiates the multicasting joining process to the requested TV channel towards the Video Source. At last, if successfully joining into the multicasting group, the client starts to receive the IP multicasting flow of the requested channel.Figure 2
A typical IPTV distribution architecture with CCS.


### 3.2. The Shortcomings of the I-Frame Acceleration Mechanism

It can be observed from practical IPTV systems that channel changing events are usually correlated and aligned with the timeline of TV programs. More specifically, at the end of each TV program (or during the commercial breaks), a large portion of online clients tend to conduct continuous channel zapping for a short period of time (e.g., several minutes), with the purpose to search for the channels of interest. In addition, we have also noticed the fact that the ends of the TV programs (or the starts of the commercial breaks) on different channels are generally aligned at every half an hour. Therefore, from the perspective of the entire IPTV system, the rate of channel changing events is likely to periodically burst up to double or even triple of its average value, as is illustrated in Figure3 (derived from [10]). Figure 3 presents the diurnal change of the aggregate channel changing events measured in a national-wide IPTV system with over two million clients in a representative working day. Particularly, it shows the timeline of these bursts, which are defined as the total number of channel changes normalized by the number of online clients. We can observe very strong spikes with the period of every 30 minutes, which reflect the correlated user activities due to the temporary alignment of TV programs.Figure 3
An illustration of periodic bursts of channel zapping events (derived from [10]).As already indicated, when the I-frame acceleration mechanism is used, a separate IP unicasting stream is needed to deliver the retained I-frame of the requested TV channel to a client upon the arrival of the client’s channel change request. Thus, each request will consume amount of system resources for a short period of time until the completion of the retained I-frame transmission. This is fundamentally different from the IP multicasting communication where the resource demands are directly determined by the number of multicasting channels. Furthermore, if we take the periodic burst feature of channel changing requests into account, the resource demands of the I-frame acceleration mechanism may become much larger than what the IPTV system can afford. Consequently, the scalability of the original I-frame acceleration mechanism can be severely degraded in practice. In particular, the scalability is mainly restricted by two factors, namely, the CCS’s capacity (e.g., I/O capacity), as well as the bandwidth capacity of the links in the IPTV transmission network (e.g., the links between the CCS and clients). The demands regarding the above two aspects will be linearly increased as the number of concurrently served channel changing requests grows. In general, the CCS’s capacity can be enhanced by employing more powerful servers, which is relatively easy compared to upgrading transmission networks (the second factor). The reason is clear that the transmission networks consist of a tremendous amount of links and intermediate nodes; most of the service providers cannot afford the costs of upgrading them (even in a medium scale). Therefore, it is highly desirable to propose efficient and easy-implementing schemes in order to optimize the scalability of the most widely used I-frame acceleration mechanism, particularly during commercial breaks of peak-hour durations.


## 3.1. I-frame Acceleration Mechanism

In a typical IPTV distribution architecture as illustrated in Figure1, there exists a Video Source responsible for transmitting all the live TV channels to its downstream Clients by means of dynamic or static multicasting via the Network in between. The network in the architecture contains a plurality of replication nodes (such as aggregation routers and switches), which forms a hierarchical networking architecture (e.g., tree topology) and supports both multicasting and unicasting communications. The simplified process of a user carrying out a new channel change is marked in Figure 1. A client in the first step sends a channel change request to the Video Source. After the request is approved, the Video Source starts to multicast the requested channel to the client in the second step. In fact, the multicasting joining process corresponding to the channel changing can usually be accomplished by the closest intermediate node to the client in the transmission path, where the requested channel is already available. It is worth noting that in this scenario all the TV channels are transmitted by means of IP multicasting, and the channel changing delay due to I-frame acquisition can be considerably large and variable as discussed in Section 1.Figure 1
A typical IPTV distribution architecture.In order to reduce the channel changing delay and improve the QoE for clients by applying the I-frame acceleration mechanism, a channel change server (CCS) is introduced in the architecture presented in Figure1 (see Figure 2). Depending on various system implementation features such as the scale of an IPTV system, the location of a CCS can be either at the edge of the core network or within a point-of-presence (PoP). The CCS is configured to retain at least the most recent I-frame, that is, the one just transmitted before the current instant, for each IPTV channel, and is adapted to respond to channel change requests from clients by transmitting the retained I-frame of a requested TV channel using an IP unicasting communication (probably with a higher transmission bit-rate than the average multicasting bit-rate), so that clients can receive the first picture of the requested channel much faster. Figure 2 demonstrates the service procedure when a client conducts the channel changing with applying the aforementioned I-frame acceleration mechanism. As can be seen, in the first step, a channel change request from a client is directly sent to the CCS. Then, upon receiving the request the CCS immediately transmits the retained I-frame of the requested channel back to the client by means of IP unicasting. Next, the client initiates the multicasting joining process to the requested TV channel towards the Video Source. At last, if successfully joining into the multicasting group, the client starts to receive the IP multicasting flow of the requested channel.Figure 2
A typical IPTV distribution architecture with CCS.


## 3.2. The Shortcomings of the I-Frame Acceleration Mechanism

It can be observed from practical IPTV systems that channel changing events are usually correlated and aligned with the timeline of TV programs. More specifically, at the end of each TV program (or during the commercial breaks), a large portion of online clients tend to conduct continuous channel zapping for a short period of time (e.g., several minutes), with the purpose to search for the channels of interest. In addition, we have also noticed the fact that the ends of the TV programs (or the starts of the commercial breaks) on different channels are generally aligned at every half an hour. Therefore, from the perspective of the entire IPTV system, the rate of channel changing events is likely to periodically burst up to double or even triple of its average value, as is illustrated in Figure3 (derived from [10]). Figure 3 presents the diurnal change of the aggregate channel changing events measured in a national-wide IPTV system with over two million clients in a representative working day. Particularly, it shows the timeline of these bursts, which are defined as the total number of channel changes normalized by the number of online clients. We can observe very strong spikes with the period of every 30 minutes, which reflect the correlated user activities due to the temporary alignment of TV programs.Figure 3
An illustration of periodic bursts of channel zapping events (derived from [10]).As already indicated, when the I-frame acceleration mechanism is used, a separate IP unicasting stream is needed to deliver the retained I-frame of the requested TV channel to a client upon the arrival of the client’s channel change request. Thus, each request will consume amount of system resources for a short period of time until the completion of the retained I-frame transmission. This is fundamentally different from the IP multicasting communication where the resource demands are directly determined by the number of multicasting channels. Furthermore, if we take the periodic burst feature of channel changing requests into account, the resource demands of the I-frame acceleration mechanism may become much larger than what the IPTV system can afford. Consequently, the scalability of the original I-frame acceleration mechanism can be severely degraded in practice. In particular, the scalability is mainly restricted by two factors, namely, the CCS’s capacity (e.g., I/O capacity), as well as the bandwidth capacity of the links in the IPTV transmission network (e.g., the links between the CCS and clients). The demands regarding the above two aspects will be linearly increased as the number of concurrently served channel changing requests grows. In general, the CCS’s capacity can be enhanced by employing more powerful servers, which is relatively easy compared to upgrading transmission networks (the second factor). The reason is clear that the transmission networks consist of a tremendous amount of links and intermediate nodes; most of the service providers cannot afford the costs of upgrading them (even in a medium scale). Therefore, it is highly desirable to propose efficient and easy-implementing schemes in order to optimize the scalability of the most widely used I-frame acceleration mechanism, particularly during commercial breaks of peak-hour durations.


## 4. A Fairness-Based Admission Control (FAC) Scheme to Optimize the I-Frame Acceleration Mechanism

In this section, aiming to optimize the scalability of the I-frame acceleration mechanism, we propose a novel admission control scheme by taking the fairness into account. The pros and cons of using this FAC scheme are also discussed.


### 4.1. General Assumptions

We investigate the IPTV service system as illustrated in Figure2, where a CCS is installed as the entity to perform the I-frame acceleration mechanism based FCC methods. In addition, we assume the following.(i)
The service provider has reserved sufficient bandwidth in the delivery network for the concurrent multicasting of all the provided TV channels. If there are in totalK different TV channels provided and assume that all of them are constant bit-rate (CBR) or near CBR encoded, then the bandwidth reservation B
multi on each link in the delivery path from the Video Source to every Access Node is fixed and is equal to the summation of all the channels’ bandwidth demands. Particularly, B
multi
=
∑
i
=
1
K
‍
r
multi
,
i, where r
multi
,
i is the bit-rate for channel i. Note that B
multi is irrelevant to the number of online clients but only the number of provided TV channels.
(ii)
Upon receiving a channel change request from an IPTV client, the CCS immediately transmits a retained I-frame of the requested TV channeli to the client by means of IP unicasting, with a CBR, which is generally higher than the channel’s multicasting bit-rate.
(iii)
In order to deploy the I-frame acceleration mechanism based FCC methods, the service provider also reserves extra bandwidth on each link in the delivery path from the CCS to every Access Node to unicast the retained I-frames. However, due to resource limitations, the I-frame acceleration mechanism may run out of the reserved bandwidth on some bottleneck links. As a result, a portion of the unicasting flows carrying the retained I-frames for FCC may be blocked. Consequently, QoE degradation will be introduced to the clients downstream of the bottleneck link(s), especially during commercial breaks in peak-hours.
(iv)
At a random instant of time, an online IPTV client is in one of the two modes, namely,zapping mode and viewing mode. In zapping mode a client continuously changes channels in a short time, while the viewing mode denotes a client keeping to watch a channel for a sufficiently long period of time (e.g., over 5 minutes).
(v)
The number of channel change events generated by clients is correlated with the timeline of TV programs; that is, they burst during every commercial break with the interval of half an hour (cf. Figure3).


### 4.2. A Fairness-Based Admission Control Scheme

In practice, an IPTV client may zap TV channels quite frequently during certain periods of time. We define this as the client’sheavy zapping behaviour, which introduces a large amount of extra traffic loads to the transmission networks. The bandwidth reservation for deploying the FCC methods is limited in the transmission networks. Therefore, we believe it is not fair that the heavy zapping behaviour demands too much bandwidth resource and accordingly incurs negative influences on the clients who just occasionally zap channels. Taking this into consideration, we propose an optimization solution called fairness-based access control (FAC) scheme to restrict the heavy zapping behaviours of some clients and, consequently, to eliminate their negative impacts on the underlying transmission networks. The principle of this scheme can be depicted by the following three points.Point 1. Monitor all the online IPTV clients by recording their recent channel changing histories.Point 2. Based on Point 1, dynamically categorize a client into either the Heavy Zapper group or the Light Zapper group at instants this client changes channels.Point 3. Taking the fairness into account, actively disable the unicasting of the retained I-frame to a client who is currently in the Heavy Zapper group.More specifically, two logical modules are newly introduced into the IPTV service architecture as presented in Figure2. They are Monitoring and Statistics Module (MSM) and Access Control Module (ACM), respectively. Due to the fact that both of them are logical modules, they can be installed close to or even be directly implemented on the CCS in practice.MSM is adopted to conduct the following two tasks. First, for all the online clients, MSM monitors and calculates the frequency of the channel changing requests arriving at the CCS in real-time. Second, for each single client, MSM monitors its channel changing history by tracking the information of the client’s most recent channel zapping events (excluding possible channel viewing events). More specifically, MSM continuously records and updates thezapping dwell time (i.e., the duration a client browses a channel in the zapping mode) for each of the online clients; for client i, the zapping dwell time corresponding to the most recent N channel zapping events will be written into an array Z
i
,
j
(
1
≤
j
≤
N
). Besides, MSM introduces a different weight α for the zapping dwell time connecting to the most recent channel zapping event (i.e., Z
i
,
1), which is usually considered to be more important than the other elements in Z
i
,
j to reflect the client’s most recent behaviour and to predict the future trend. On that basis, the average zapping dwell time T
i can be expressed by (1). In particular, three more detailed situations are presented in Figure 4. The first situation is demonstrated in Figure 4(a) where the client’s past N zapping events are continuous, and T
i can be evaluated straightforward by (1). Figure 4(b) considers another situation with channel viewing event(s) amongst the N zapping events. Thus, the view events should be eliminated when T
i is evaluated. Figure 4(c) illustrates the third situation with the client just turned on the TV, and currently the total number of zapping events n is smaller than N. Thus, (2) is employed to replace (1) for the calculation of T
i as follows:
(1)
T
i
=
α
·
Z
i
,
1
+
(
1
-
α
)
∑
j
=
2
N
Z
i
,
j
N
-
1
,
(2)
T
i
=
∑
j
=
1
n
Z
i
,
j
n
.Three more detailed situations for applying the FAC scheme.
(a)
(b)
(c)ACM is a logical entity to conduct the FAC scheme for all the I-frame unicasting flows served by the CCS. It is clear that each unicasting flow carries a retained I-frame of a requested TV channel with the aim to accelerate the channel changing process for the client requesting that channel. However, each unicasting flow consumes a considerable large amount of network bandwidth resources (although each unicasting flow may not last for a long time). When there is a burst of channel change requests arriving at the CCS, ACM is responsible for making sure that the limited network bandwidth resources can be used more fairly and efficiently, so that acceptable QoE can still be maintained for the clients. The implementation of our proposed FAC scheme can be demonstrated by the flow chart in Figure5. As can be seen, the key step is to compare the evaluated T
i and a threshold value T
thd, which is used to decide whether the current client is a heavy zapper or not.Figure 5
Flow chart to illustrate the FAC scheme.Similar toT
i, the value of T
thd is also dynamically determined and updated by the MSM. There are many different solutions to do this. One exemplary method may be time interval based. More precisely, after one fixed period of time, T
thd should be recalculated according to the most recent updates of client requests arriving intensity. Another exemplary method could be based on the change of the client requests arriving intensity. In this case, if a currently updated requests intensity becomes significantly different than the mean value of several most recently evaluated intensities, either absolutely or relatively, T
thd should be updated. The flow chart in Figure 6 demonstrates the process to determine and update T
thd with algorithm X. Note that looking for a decent algorithm X is outside of the scope of this paper and is left for further study. To summarise, Figure 7 demonstrates the functionalities and the relations between the two logical models (i.e., MSM and ACM).Figure 6
Flow chart to show the determination ofT
thrd.Figure 7
The functionalities and the relations between the MSM and the ACM modules.


### 4.3. Advantages and Disadvantages of the FAC Scheme

The advantage of using our FAC scheme is obvious. With the FAC scheme, the network bandwidth demands by the I-frame acceleration mechanism can be decreased; the CBP on the CCS due to bandwidth limitation can also be reduced. Accordingly, the scalability of the original I-frame acceleration mechanism can be effectively optimized.On the other hand, the above advantages are not achieved without cost. Our FAC scheme sacrifices the profits of certain clients who are currently conducting heavy zapping (i.e., in the Heavy Zapper group), by means of actively and intelligently blocking the retained I-frame transmissions for FCC. However, we believe that this punishment for the heavy zapping behaviour preserves the profits for the clients in the light zapper group. As a result, the I-frame acceleration mechanism can treat different clients more fairly with adopting this proposed FAC scheme.


## 4.1. General Assumptions

We investigate the IPTV service system as illustrated in Figure2, where a CCS is installed as the entity to perform the I-frame acceleration mechanism based FCC methods. In addition, we assume the following.(i)
The service provider has reserved sufficient bandwidth in the delivery network for the concurrent multicasting of all the provided TV channels. If there are in totalK different TV channels provided and assume that all of them are constant bit-rate (CBR) or near CBR encoded, then the bandwidth reservation B
multi on each link in the delivery path from the Video Source to every Access Node is fixed and is equal to the summation of all the channels’ bandwidth demands. Particularly, B
multi
=
∑
i
=
1
K
‍
r
multi
,
i, where r
multi
,
i is the bit-rate for channel i. Note that B
multi is irrelevant to the number of online clients but only the number of provided TV channels.
(ii)
Upon receiving a channel change request from an IPTV client, the CCS immediately transmits a retained I-frame of the requested TV channeli to the client by means of IP unicasting, with a CBR, which is generally higher than the channel’s multicasting bit-rate.
(iii)
In order to deploy the I-frame acceleration mechanism based FCC methods, the service provider also reserves extra bandwidth on each link in the delivery path from the CCS to every Access Node to unicast the retained I-frames. However, due to resource limitations, the I-frame acceleration mechanism may run out of the reserved bandwidth on some bottleneck links. As a result, a portion of the unicasting flows carrying the retained I-frames for FCC may be blocked. Consequently, QoE degradation will be introduced to the clients downstream of the bottleneck link(s), especially during commercial breaks in peak-hours.
(iv)
At a random instant of time, an online IPTV client is in one of the two modes, namely,zapping mode and viewing mode. In zapping mode a client continuously changes channels in a short time, while the viewing mode denotes a client keeping to watch a channel for a sufficiently long period of time (e.g., over 5 minutes).
(v)
The number of channel change events generated by clients is correlated with the timeline of TV programs; that is, they burst during every commercial break with the interval of half an hour (cf. Figure3).


## 4.2. A Fairness-Based Admission Control Scheme

In practice, an IPTV client may zap TV channels quite frequently during certain periods of time. We define this as the client’sheavy zapping behaviour, which introduces a large amount of extra traffic loads to the transmission networks. The bandwidth reservation for deploying the FCC methods is limited in the transmission networks. Therefore, we believe it is not fair that the heavy zapping behaviour demands too much bandwidth resource and accordingly incurs negative influences on the clients who just occasionally zap channels. Taking this into consideration, we propose an optimization solution called fairness-based access control (FAC) scheme to restrict the heavy zapping behaviours of some clients and, consequently, to eliminate their negative impacts on the underlying transmission networks. The principle of this scheme can be depicted by the following three points.Point 1. Monitor all the online IPTV clients by recording their recent channel changing histories.Point 2. Based on Point 1, dynamically categorize a client into either the Heavy Zapper group or the Light Zapper group at instants this client changes channels.Point 3. Taking the fairness into account, actively disable the unicasting of the retained I-frame to a client who is currently in the Heavy Zapper group.More specifically, two logical modules are newly introduced into the IPTV service architecture as presented in Figure2. They are Monitoring and Statistics Module (MSM) and Access Control Module (ACM), respectively. Due to the fact that both of them are logical modules, they can be installed close to or even be directly implemented on the CCS in practice.MSM is adopted to conduct the following two tasks. First, for all the online clients, MSM monitors and calculates the frequency of the channel changing requests arriving at the CCS in real-time. Second, for each single client, MSM monitors its channel changing history by tracking the information of the client’s most recent channel zapping events (excluding possible channel viewing events). More specifically, MSM continuously records and updates thezapping dwell time (i.e., the duration a client browses a channel in the zapping mode) for each of the online clients; for client i, the zapping dwell time corresponding to the most recent N channel zapping events will be written into an array Z
i
,
j
(
1
≤
j
≤
N
). Besides, MSM introduces a different weight α for the zapping dwell time connecting to the most recent channel zapping event (i.e., Z
i
,
1), which is usually considered to be more important than the other elements in Z
i
,
j to reflect the client’s most recent behaviour and to predict the future trend. On that basis, the average zapping dwell time T
i can be expressed by (1). In particular, three more detailed situations are presented in Figure 4. The first situation is demonstrated in Figure 4(a) where the client’s past N zapping events are continuous, and T
i can be evaluated straightforward by (1). Figure 4(b) considers another situation with channel viewing event(s) amongst the N zapping events. Thus, the view events should be eliminated when T
i is evaluated. Figure 4(c) illustrates the third situation with the client just turned on the TV, and currently the total number of zapping events n is smaller than N. Thus, (2) is employed to replace (1) for the calculation of T
i as follows:
(1)
T
i
=
α
·
Z
i
,
1
+
(
1
-
α
)
∑
j
=
2
N
Z
i
,
j
N
-
1
,
(2)
T
i
=
∑
j
=
1
n
Z
i
,
j
n
.Three more detailed situations for applying the FAC scheme.
(a)
(b)
(c)ACM is a logical entity to conduct the FAC scheme for all the I-frame unicasting flows served by the CCS. It is clear that each unicasting flow carries a retained I-frame of a requested TV channel with the aim to accelerate the channel changing process for the client requesting that channel. However, each unicasting flow consumes a considerable large amount of network bandwidth resources (although each unicasting flow may not last for a long time). When there is a burst of channel change requests arriving at the CCS, ACM is responsible for making sure that the limited network bandwidth resources can be used more fairly and efficiently, so that acceptable QoE can still be maintained for the clients. The implementation of our proposed FAC scheme can be demonstrated by the flow chart in Figure5. As can be seen, the key step is to compare the evaluated T
i and a threshold value T
thd, which is used to decide whether the current client is a heavy zapper or not.Figure 5
Flow chart to illustrate the FAC scheme.Similar toT
i, the value of T
thd is also dynamically determined and updated by the MSM. There are many different solutions to do this. One exemplary method may be time interval based. More precisely, after one fixed period of time, T
thd should be recalculated according to the most recent updates of client requests arriving intensity. Another exemplary method could be based on the change of the client requests arriving intensity. In this case, if a currently updated requests intensity becomes significantly different than the mean value of several most recently evaluated intensities, either absolutely or relatively, T
thd should be updated. The flow chart in Figure 6 demonstrates the process to determine and update T
thd with algorithm X. Note that looking for a decent algorithm X is outside of the scope of this paper and is left for further study. To summarise, Figure 7 demonstrates the functionalities and the relations between the two logical models (i.e., MSM and ACM).Figure 6
Flow chart to show the determination ofT
thrd.Figure 7
The functionalities and the relations between the MSM and the ACM modules.


## 4.3. Advantages and Disadvantages of the FAC Scheme

The advantage of using our FAC scheme is obvious. With the FAC scheme, the network bandwidth demands by the I-frame acceleration mechanism can be decreased; the CBP on the CCS due to bandwidth limitation can also be reduced. Accordingly, the scalability of the original I-frame acceleration mechanism can be effectively optimized.On the other hand, the above advantages are not achieved without cost. Our FAC scheme sacrifices the profits of certain clients who are currently conducting heavy zapping (i.e., in the Heavy Zapper group), by means of actively and intelligently blocking the retained I-frame transmissions for FCC. However, we believe that this punishment for the heavy zapping behaviour preserves the profits for the clients in the light zapper group. As a result, the I-frame acceleration mechanism can treat different clients more fairly with adopting this proposed FAC scheme.


## 5. Performance Evaluation by Means of Simulation

In this section, the performance of our proposed FAC scheme is evaluated by means of simulation. In particular, we present a case study concerning a typical commercial break in peak-hours.


### 5.1. Simulation Introduction

We focus on a single bottleneck linkLN between the CCS and a certain Access Node and assume that there is no other bottleneck links in the channel delivery path. On the link LN, two different performance metrics, that is, the real-time bandwidth demand and the CBP for FCC introduced by the I-frame acceleration mechanism; are evaluated. Here the second metrics are defined as the probability of blocking the retained I-frame unicasting streams due to resource limitation. To this end, we have developed a trace-driven simulation model based on the n-dimensional state vector below:
(3)
(
UserBW
_
1
,
UserBW
_
2
,
…
,
UserBW
_
n
)
,
where n is the total number of clients downstream of the link LN. The vector is used for recording the current status of the clients; that is, the ith element UserBW_i in the vector represents the current bandwidth requirement introduced by FCC for client i. Note that UserBW_i should be 0 except in the duration when the CCS is expected to deliver a retained I-frame to client i. Thus, the summation of all the elements is the aggregate bandwidth demand on LN for all the downstream clients. The simulation consists of the following four steps.Step 1.
Generate a traffic trace for each of the clients downstream of the linkLN, which should include channel request arriving events, as well as FCC completion events (i.e., the finish of transmitting a retained I-frame). Besides, the length of each single trace should be larger than or at least equal to T
cb, the time duration will be simulated.Step 2.
Derive an aggregate trace for all the clients by combining all the single traces generated in Step1.Step 3.
Start to simulate client channel changing events as well as FCC completion events according to the aggregate trace. During the simulation, the bandwidth requirement on the linkLN for I-frame accelerations is monitored and recorded in real-time.Step 4.
At the end of the simulation, CBPs for FCC in both the entire simulation durationT
cb and in a certain portion of it are evaluated based on the recorded call blocking events and the total number of channel change requests during the simulation.We need to study two different types of situations, namely, the situations with and without using our proposed FAC scheme, with the aim to demonstrate that to what extent our FAC scheme can improve the scalability of the original I-frame acceleration mechanism.During the simulation, the transmission of a retained I-frame (for FCC) may be blocked either due to bandwidth resource constraints or caused by using the proposed FAC scheme. In that case, the channel changing acceleration for a specific client request is failed, and the client has to wait for extra time to get the first I-frame (in the multicasting stream of the requested channel) to be displayed on the screen. We call this extra time directly introduced by the FAC scheme as FCC failure delay (FFD). TheAverage FFD is monitored as the third performance metric, which is defined as the sum of FFDs normalized by the total number of channel requests in the simulated time slot.


### 5.2. Case Study: Application of the FAC Scheme in a Typical Commercial Break in Peak-Hours

Based on the above simulation model, we conduct performance evaluations for the FAC scheme when it is applied to a typical commercial break (with lengthT
cb) in peak-hours. When a large number of channel requests burst, the heavy traffic load introduced by using the I-frame acceleration mechanism based FCC methods can strongly impact on IPTV systems. Below are some additional assumptions for this case study.(i)
The system provides both SDTV and HDTV channels, both of which are CBR encoded with the multicasting transmission bit-ratesR
Multi
,
SD and R
Multi
,
HD, respectively.
(ii)
When a client conducts a channel change for an SDTV (or HDTV) channel, the CCS promptly unicasts a retained I-frame of the requested channel to the client with CBRR
Uni
,
SD (or R
Uni
,
HD), which is generally larger than the channel’s multicasting bit-rate R
Multi
,
SD and satisfies (4) (or (5) for HDTV channel). Consider
(4)
R
Uni
,
SD
=
α
SD
·
R
Multi
,
SD
(
α
SD
>
1
)
,
(5)
R
Uni
,
HD
=
α
HD
·
R
Multi
,
HD
(
α
HD
>
1
)
.
(iii)
The bandwidth reservation on the bottleneck linkLN for unicasting the retained I-frames is fixed as BW (in practical IPTV systems, BW should be determined by the service providers with considering other factors, such as the average offered traffic).
(iv)
The number of IPTV clients downstream of the linkLN is fixed as N
client during the considered commercial break, which means that there is no client entering into or leaving from the system. The clients can choose both SDTV and HDTV channels (i.e., with the probability β to select SDTV channels). In addition, these clients behave independently.
(v)
Each of the clients begins to zap TV channels once the commercial break starts. A client continues to zap channels forL times. L conforms to a truncated Poisson distribution with the mean value L
¯, the maximum value L
MAX, and the minimum value L
MIN. After each round of channel zapping, a client enters into view model (i.e., watches a channel for a relatively long time). Thus, the probability mass function (PMF) of L can be expressed by (6), where L
MIN
≤
k
≤
L
MAX should be satisfied. Consider
(6)
f
(
k
;
L
¯
)
=
Pr
(
L
=
k
)
=
(
L
¯
k
·
e
-
L
¯
)
/
k
!
∑
j
=
L
MIN
L
MAX
(
(
L
¯
j
·
e
-
L
¯
)
/
j
!
)
.
(vi)
For each single client, the zapping dwell timeT
zdt (denoting the duration a client browses a certain channel in the zapping mode) conforms to a truncated negative Exponential distribution with the average value T
¯
zdt, the maximum value T
zdt
,
MAX, and the minimum value T
zdt
,
MIN. Thus, the probability density function (PDF) of T
zdt can be expressed by (7), where T
zdt
,
MIN
≤
x
≤
T
zdt
,
MAX should be satisfied
(7)
f
(
x
;
1
T
¯
zdt
)
=
T
¯
zdt
·
e
-
T
¯
zdt
·
x
∫
T
zdt
,
MIN
T
zdt
,
MAX
‍
(
T
¯
zdt
·
e
-
T
¯
zdt
·
x
)
.
(vii)
Assume that the size of the retained I-frames conforms to a truncatedNormal distribution. More specifically, for an SDTV channel the mean value, the maximum value, and the minimum value of the I-frame size S
SD are S
¯
SD, S
SD
,
MAX, and S
SD
,
MIN, respectively. The standard deviation of S
SD is σ
sd. On the other hand, for an HDTV channel the mean value, the maximum value, and the minimum value of the I-frame size S
HD is S
¯
HD, S
HD
,
MAX and S
HD
,
MIN, respectively. The standard deviation of S
HD is σ
hd. Thus, the PDFs of S
SD and S
HD can be expressed by (8) and (9), respectively. Besides, the inequalities S
SD
,
MIN
≤
x
≤
S
SD
,
MAX, and S
HD
,
MIN
≤
y
≤
S
HD
,
MAX should be respected. Consider
(8)
f
(
x
)
=
(
1
/
2
π
σ
sd
2
)
·
e
-
(
(
x
-
S
¯
SD
)
2
/
2
σ
sd
2
)
∫
S
SD
,
MIN
S
SD
,
MAX
‍
[
(
1
/
2
π
σ
sd
2
)
·
e
-
(
(
x
-
S
¯
SD
)
2
/
2
σ
sd
2
)
]
,
(9)
f
(
y
)
=
(
1
/
2
π
σ
sd
2
)
·
e
-
(
(
y
-
S
¯
HD
)
2
/
(
2
σ
hd
2
)
)
∫
S
HD
,
MIN
S
HD
,
MAX
‍
[
(
1
/
2
π
σ
hd
2
)
·
e
-
(
(
y
-
S
¯
HD
)
2
/
2
σ
hd
2
)
]
.
(viii)
The time needed to transmit the retained I-frame is denoted asT
I-frame,SD and T
I-frame,HD for the SDTV and the HDTV channels, respectively. T
I-frame,SD and T
I-frame,HD can be directly determined by the size of the I-frame and the unicasting bit-rate. Consequently, (10) should be fulfilled as follows:
(10)
T
I-frame
,
SD
=
S
SD
R
Uni
,
SD
,
T
I-frame,HD
=
S
HD
R
Uni
,
HD
.
(ix)
As discussed in the previous subsection, FFD is defined as the extra channel changing latency brought by the FAC scheme. A set of factors including those listed in Table1 can contribute to FFD. Therefore, it is reasonable to assume that FFD subjects to a truncated negative Exponential distribution. For the SDTV and HDTV channels, we denote FFD as D
SD and D
HD, respectively.Table2 lists the parameter values we used for this case study. In the simulation experiments, we have applied our FAC scheme with setting the parameters N
=
3, α
=
0.5 (cf. Section 4.2). Besides, three different values for the threshold T
thd are tested. The simulation results are plotted in Figures 8–11. More specifically, Figures 8, 9, and 10 present the bandwidth demand variations during the simulated commercial break for the three different values of T
thd, respectively. In each of these figures, the upper curve represents the situation with only using the original I-frame acceleration mechanism. As can be seen, the aggregate bandwidth demand increases dynamically once the simulation starts. As time goes, it reaches a relatively stable status; namely, the bandwidth demand vibrates around a fixed value. After that, the bandwidth demand starts to decrease slowly and gradually gets close to zero at the end of the commercial break. The other curve located underneath is for the situation of using our FAC scheme with a specific value of T
thd. The lower curve illustrates similar features as the upper one. However, it demands much less bandwidth (e.g., up to 50% percent less in Figure 10) compared to the situation when FAC scheme is not applied. In addition, when comparing all the lower curves in the three figures, we observed that our FAC scheme with a larger value of T
thd can introduce a more significant reduction of bandwidth demands. In Figure 11, we present the results of the CBPs for FCC evaluated for the intervals of every 30 seconds (in this case, we get 10 (=5 min/30 s) sampling points on each curve) in the simulated commercial break. There are in total four curves presented, including the uppermost one for the situation without using the FAC scheme and the three lower ones using the FAC scheme but corresponding to the three different values of T
thd. We can observe that the larger the T
thd is, the lower the corresponding curve locates, that is, the smaller the CBPs for FCC are.Table 2
Parameter values for the case study.
Notation
Description
Values
T
cb
Length of the considered commercial break
5 Minutes
BW
Bandwidth reserved for unicasting the retained I-frames for FCC on the bottleneck linkLN
500 Mbps
N
client
The number of IPTV clients downstream of the linkLN
4000
β
The probability a client chooses an SDTV channel when conducting the channel changing
0.7
R
Multi,SD
CBR of multicasting an SDTV channel
4 Mbps
R
Multi,HD
CBR of multicasting an HDTV channel
8 Mbps
α
SD
I-frame acceleration ratio for an SDTV channel
1.2
α
HD
I-frame acceleration ratio for an HDTV channel
1.4
R
Uni,SD
CBR of unicasting the retained I-frame for SDTV channels
4.8 Mbps (=α
SD
·
R
Multi,SD)
R
Uni,HD
CBR of unicasting the retained I-frame for HDTV channels
11.2 Mbps (=α
HD
·
R
Multi,HD)
L
Number of zapping times in the commercial break; conforming to a truncatedPoisson distribution (L
- is the mean, L
MAX is the upper bound, and L
MIN is the lower bound)
L
-
=
15; L
MAX
=
100; L
MIN
=
5
T
zdt
Zapping dwell time (i.e., the duration a client browses a certain channel in the zapping mode) conforms to a truncatednegative Exponential distribution (T
-
zdt is the mean, T
zdt
,
MAX is the upper bound, and T
zdt
,
MIN is the lower bound)
T
-
zdt
=
10
s; T
zdt
,
MAX
=
20
s; T
zdt
,
MIN
=
1.5
s
S
SD
Size of an I-frame in an SDTV channel, which conforms to  truncatedNormal distributions (S
-
SD is the mean, S
SD,MAX is the upper bound, S
SD,MIN is the lower bound, and σ
sd is the standard deviation)
S
-
SD
=
800
Kb; S
SD
,
MAX
=
960
Kb; S
SD
,
MIN
=
640
Kb; σ
sd
=
100
Kb
S
HD
Size of an I-frame in an HDTV channel, which conforms to  truncatedNormal distributions (S
-
HD is the mean, S
HD,MAX is the upper bound, S
HD,MIN is the lower bound, and σ
hd is the standard deviation)
S
-
HD
=
1.6
Mb; S
HD,MAX
=
1.92
Mb; S
HD,MIN
=
1.28
Mb; σ
hd
=
0.2
Mb
T
Iframe,SD
Time needed to transmit a retained I-frame of an SDTV channel
T
Iframe,SD
=
S
SD
R
Uni,SD
T
Iframe,HD
Time needed to transmit a retained I-frame of an HDTV channel
T
Iframe,HD
=
S
HD
R
Uni,HD
D
SD
FCC failure delay (FFD) for an SDTV channel; subjects to a truncatednegative Exponential distribution (D
-
SD is the mean, D
SD,MAX is the upper bound, and D
SD,MIN is the lower bound)
D
-
SD
=
0.6
s; D
SD,MIN
=
0.2
s; D
SD,MAX
=
1
s
D
HD
FCC failure delay (FFD) for an HDTV channel; subjects to a truncatednegative Exponential distribution (D
-
HD is the mean, D
HD,MAX is the upper bound, and D
HD,MIN is the lower bound)
D
-
HD
=
0.8
s; D
HD,MIN
=
0.3
s; D
HD,MAX
=
1.3
sFigure 8
Bandwidth demand on linkLN for transmitting the retained I-frames w/ and w/o using the FAC scheme (T
thd
=
4
seconds).Figure 9
Bandwidth demand on linkLN for transmitting the retained I-frames w/ and w/o using the FAC scheme (T
thd
=
5
seconds).Figure 10
Bandwidth demand on linkLN for transmitting the retained I-frames w/ and w/o using the FAC scheme (T
thd
=
6
seconds).Figure 11
FCC CBP evaluated on linkLN w/ and w/o applying the FAC scheme for different values of T
thd.The four figures above illustrate the benefits of using our FAC scheme. Those gains are achieved by riding the cost of increasing channel changing delay for the heavy zappers. It is agreed that a thorough investigation of the cost is indispensable for a complete study. We therefore evaluate the Average FFD in a scenario where limited bandwidth reservation is assumed on the bottleneck linkLN (i.e., B
W
=
500
Mbps). This indicates that an FCC failure event can be either attributed to the bandwidth limits or incurred by using the FAC scheme. The simulation results for the three different values of T
thd are plotted on Figure 12. As can be seen, the average FFD linearly increases as T
thd grows. The general trend of each curve is to slowly decrease as the time goes in the simulation duration. The maximum value is around 0.27 second in the curve T
thd
=
6
s. Since it appears just at the beginning of the commercial break when increasingly more clients start to zap channels, we believe it is acceptable as an average FFD value. And we also note that for heavy zappers the situation would be worse, while for clients not addicted to channel zapping, the average delay would be much shorter.Figure 12
Average FFC failure delay (FFD) for different values ofT
thd in bandwidth limited scenarios (B
W
=
500
Mbps).To summarise, the simulation results imply that our FAC scheme can effectively optimize the scalability of the original I-frame acceleration mechanism based FCC methods by dramatically decreasing the bandwidth demands. In particular, if the bandwidth reservation for transmitting the retained I-frames is limited in the delivery network, the FAC scheme is capable of significantly reducing the CBPs for FCC, with only slightly increasing the average channel changing delay (i.e., average FFD). It is also observed that, when the reserved bandwidth is fixed, our proposed FAC scheme performs better in terms of reducing bandwidth requirements and CBP for larger values ofT
thd. It is however not true for the average FFD, which just gets worse as T
thd increases. In addition, we emphasis that, as an important scalability optimization method for the original I-frame acceleration mechanism, the FAC scheme is easy to be implemented by IPTV service providers in reality; the performance of the FAC scheme is closely related to both the bandwidth reservation for the I-frame acceleration mechanism, as well as the value of T
thd. Therefore, IPTV service providers should carefully choose the values for these parameters based on their practical needs.


## 5.1. Simulation Introduction

We focus on a single bottleneck linkLN between the CCS and a certain Access Node and assume that there is no other bottleneck links in the channel delivery path. On the link LN, two different performance metrics, that is, the real-time bandwidth demand and the CBP for FCC introduced by the I-frame acceleration mechanism; are evaluated. Here the second metrics are defined as the probability of blocking the retained I-frame unicasting streams due to resource limitation. To this end, we have developed a trace-driven simulation model based on the n-dimensional state vector below:
(3)
(
UserBW
_
1
,
UserBW
_
2
,
…
,
UserBW
_
n
)
,
where n is the total number of clients downstream of the link LN. The vector is used for recording the current status of the clients; that is, the ith element UserBW_i in the vector represents the current bandwidth requirement introduced by FCC for client i. Note that UserBW_i should be 0 except in the duration when the CCS is expected to deliver a retained I-frame to client i. Thus, the summation of all the elements is the aggregate bandwidth demand on LN for all the downstream clients. The simulation consists of the following four steps.Step 1.
Generate a traffic trace for each of the clients downstream of the linkLN, which should include channel request arriving events, as well as FCC completion events (i.e., the finish of transmitting a retained I-frame). Besides, the length of each single trace should be larger than or at least equal to T
cb, the time duration will be simulated.Step 2.
Derive an aggregate trace for all the clients by combining all the single traces generated in Step1.Step 3.
Start to simulate client channel changing events as well as FCC completion events according to the aggregate trace. During the simulation, the bandwidth requirement on the linkLN for I-frame accelerations is monitored and recorded in real-time.Step 4.
At the end of the simulation, CBPs for FCC in both the entire simulation durationT
cb and in a certain portion of it are evaluated based on the recorded call blocking events and the total number of channel change requests during the simulation.We need to study two different types of situations, namely, the situations with and without using our proposed FAC scheme, with the aim to demonstrate that to what extent our FAC scheme can improve the scalability of the original I-frame acceleration mechanism.During the simulation, the transmission of a retained I-frame (for FCC) may be blocked either due to bandwidth resource constraints or caused by using the proposed FAC scheme. In that case, the channel changing acceleration for a specific client request is failed, and the client has to wait for extra time to get the first I-frame (in the multicasting stream of the requested channel) to be displayed on the screen. We call this extra time directly introduced by the FAC scheme as FCC failure delay (FFD). TheAverage FFD is monitored as the third performance metric, which is defined as the sum of FFDs normalized by the total number of channel requests in the simulated time slot.


## 5.2. Case Study: Application of the FAC Scheme in a Typical Commercial Break in Peak-Hours

Based on the above simulation model, we conduct performance evaluations for the FAC scheme when it is applied to a typical commercial break (with lengthT
cb) in peak-hours. When a large number of channel requests burst, the heavy traffic load introduced by using the I-frame acceleration mechanism based FCC methods can strongly impact on IPTV systems. Below are some additional assumptions for this case study.(i)
The system provides both SDTV and HDTV channels, both of which are CBR encoded with the multicasting transmission bit-ratesR
Multi
,
SD and R
Multi
,
HD, respectively.
(ii)
When a client conducts a channel change for an SDTV (or HDTV) channel, the CCS promptly unicasts a retained I-frame of the requested channel to the client with CBRR
Uni
,
SD (or R
Uni
,
HD), which is generally larger than the channel’s multicasting bit-rate R
Multi
,
SD and satisfies (4) (or (5) for HDTV channel). Consider
(4)
R
Uni
,
SD
=
α
SD
·
R
Multi
,
SD
(
α
SD
>
1
)
,
(5)
R
Uni
,
HD
=
α
HD
·
R
Multi
,
HD
(
α
HD
>
1
)
.
(iii)
The bandwidth reservation on the bottleneck linkLN for unicasting the retained I-frames is fixed as BW (in practical IPTV systems, BW should be determined by the service providers with considering other factors, such as the average offered traffic).
(iv)
The number of IPTV clients downstream of the linkLN is fixed as N
client during the considered commercial break, which means that there is no client entering into or leaving from the system. The clients can choose both SDTV and HDTV channels (i.e., with the probability β to select SDTV channels). In addition, these clients behave independently.
(v)
Each of the clients begins to zap TV channels once the commercial break starts. A client continues to zap channels forL times. L conforms to a truncated Poisson distribution with the mean value L
¯, the maximum value L
MAX, and the minimum value L
MIN. After each round of channel zapping, a client enters into view model (i.e., watches a channel for a relatively long time). Thus, the probability mass function (PMF) of L can be expressed by (6), where L
MIN
≤
k
≤
L
MAX should be satisfied. Consider
(6)
f
(
k
;
L
¯
)
=
Pr
(
L
=
k
)
=
(
L
¯
k
·
e
-
L
¯
)
/
k
!
∑
j
=
L
MIN
L
MAX
(
(
L
¯
j
·
e
-
L
¯
)
/
j
!
)
.
(vi)
For each single client, the zapping dwell timeT
zdt (denoting the duration a client browses a certain channel in the zapping mode) conforms to a truncated negative Exponential distribution with the average value T
¯
zdt, the maximum value T
zdt
,
MAX, and the minimum value T
zdt
,
MIN. Thus, the probability density function (PDF) of T
zdt can be expressed by (7), where T
zdt
,
MIN
≤
x
≤
T
zdt
,
MAX should be satisfied
(7)
f
(
x
;
1
T
¯
zdt
)
=
T
¯
zdt
·
e
-
T
¯
zdt
·
x
∫
T
zdt
,
MIN
T
zdt
,
MAX
‍
(
T
¯
zdt
·
e
-
T
¯
zdt
·
x
)
.
(vii)
Assume that the size of the retained I-frames conforms to a truncatedNormal distribution. More specifically, for an SDTV channel the mean value, the maximum value, and the minimum value of the I-frame size S
SD are S
¯
SD, S
SD
,
MAX, and S
SD
,
MIN, respectively. The standard deviation of S
SD is σ
sd. On the other hand, for an HDTV channel the mean value, the maximum value, and the minimum value of the I-frame size S
HD is S
¯
HD, S
HD
,
MAX and S
HD
,
MIN, respectively. The standard deviation of S
HD is σ
hd. Thus, the PDFs of S
SD and S
HD can be expressed by (8) and (9), respectively. Besides, the inequalities S
SD
,
MIN
≤
x
≤
S
SD
,
MAX, and S
HD
,
MIN
≤
y
≤
S
HD
,
MAX should be respected. Consider
(8)
f
(
x
)
=
(
1
/
2
π
σ
sd
2
)
·
e
-
(
(
x
-
S
¯
SD
)
2
/
2
σ
sd
2
)
∫
S
SD
,
MIN
S
SD
,
MAX
‍
[
(
1
/
2
π
σ
sd
2
)
·
e
-
(
(
x
-
S
¯
SD
)
2
/
2
σ
sd
2
)
]
,
(9)
f
(
y
)
=
(
1
/
2
π
σ
sd
2
)
·
e
-
(
(
y
-
S
¯
HD
)
2
/
(
2
σ
hd
2
)
)
∫
S
HD
,
MIN
S
HD
,
MAX
‍
[
(
1
/
2
π
σ
hd
2
)
·
e
-
(
(
y
-
S
¯
HD
)
2
/
2
σ
hd
2
)
]
.
(viii)
The time needed to transmit the retained I-frame is denoted asT
I-frame,SD and T
I-frame,HD for the SDTV and the HDTV channels, respectively. T
I-frame,SD and T
I-frame,HD can be directly determined by the size of the I-frame and the unicasting bit-rate. Consequently, (10) should be fulfilled as follows:
(10)
T
I-frame
,
SD
=
S
SD
R
Uni
,
SD
,
T
I-frame,HD
=
S
HD
R
Uni
,
HD
.
(ix)
As discussed in the previous subsection, FFD is defined as the extra channel changing latency brought by the FAC scheme. A set of factors including those listed in Table1 can contribute to FFD. Therefore, it is reasonable to assume that FFD subjects to a truncated negative Exponential distribution. For the SDTV and HDTV channels, we denote FFD as D
SD and D
HD, respectively.Table2 lists the parameter values we used for this case study. In the simulation experiments, we have applied our FAC scheme with setting the parameters N
=
3, α
=
0.5 (cf. Section 4.2). Besides, three different values for the threshold T
thd are tested. The simulation results are plotted in Figures 8–11. More specifically, Figures 8, 9, and 10 present the bandwidth demand variations during the simulated commercial break for the three different values of T
thd, respectively. In each of these figures, the upper curve represents the situation with only using the original I-frame acceleration mechanism. As can be seen, the aggregate bandwidth demand increases dynamically once the simulation starts. As time goes, it reaches a relatively stable status; namely, the bandwidth demand vibrates around a fixed value. After that, the bandwidth demand starts to decrease slowly and gradually gets close to zero at the end of the commercial break. The other curve located underneath is for the situation of using our FAC scheme with a specific value of T
thd. The lower curve illustrates similar features as the upper one. However, it demands much less bandwidth (e.g., up to 50% percent less in Figure 10) compared to the situation when FAC scheme is not applied. In addition, when comparing all the lower curves in the three figures, we observed that our FAC scheme with a larger value of T
thd can introduce a more significant reduction of bandwidth demands. In Figure 11, we present the results of the CBPs for FCC evaluated for the intervals of every 30 seconds (in this case, we get 10 (=5 min/30 s) sampling points on each curve) in the simulated commercial break. There are in total four curves presented, including the uppermost one for the situation without using the FAC scheme and the three lower ones using the FAC scheme but corresponding to the three different values of T
thd. We can observe that the larger the T
thd is, the lower the corresponding curve locates, that is, the smaller the CBPs for FCC are.Table 2
Parameter values for the case study.
Notation
Description
Values
T
cb
Length of the considered commercial break
5 Minutes
BW
Bandwidth reserved for unicasting the retained I-frames for FCC on the bottleneck linkLN
500 Mbps
N
client
The number of IPTV clients downstream of the linkLN
4000
β
The probability a client chooses an SDTV channel when conducting the channel changing
0.7
R
Multi,SD
CBR of multicasting an SDTV channel
4 Mbps
R
Multi,HD
CBR of multicasting an HDTV channel
8 Mbps
α
SD
I-frame acceleration ratio for an SDTV channel
1.2
α
HD
I-frame acceleration ratio for an HDTV channel
1.4
R
Uni,SD
CBR of unicasting the retained I-frame for SDTV channels
4.8 Mbps (=α
SD
·
R
Multi,SD)
R
Uni,HD
CBR of unicasting the retained I-frame for HDTV channels
11.2 Mbps (=α
HD
·
R
Multi,HD)
L
Number of zapping times in the commercial break; conforming to a truncatedPoisson distribution (L
- is the mean, L
MAX is the upper bound, and L
MIN is the lower bound)
L
-
=
15; L
MAX
=
100; L
MIN
=
5
T
zdt
Zapping dwell time (i.e., the duration a client browses a certain channel in the zapping mode) conforms to a truncatednegative Exponential distribution (T
-
zdt is the mean, T
zdt
,
MAX is the upper bound, and T
zdt
,
MIN is the lower bound)
T
-
zdt
=
10
s; T
zdt
,
MAX
=
20
s; T
zdt
,
MIN
=
1.5
s
S
SD
Size of an I-frame in an SDTV channel, which conforms to  truncatedNormal distributions (S
-
SD is the mean, S
SD,MAX is the upper bound, S
SD,MIN is the lower bound, and σ
sd is the standard deviation)
S
-
SD
=
800
Kb; S
SD
,
MAX
=
960
Kb; S
SD
,
MIN
=
640
Kb; σ
sd
=
100
Kb
S
HD
Size of an I-frame in an HDTV channel, which conforms to  truncatedNormal distributions (S
-
HD is the mean, S
HD,MAX is the upper bound, S
HD,MIN is the lower bound, and σ
hd is the standard deviation)
S
-
HD
=
1.6
Mb; S
HD,MAX
=
1.92
Mb; S
HD,MIN
=
1.28
Mb; σ
hd
=
0.2
Mb
T
Iframe,SD
Time needed to transmit a retained I-frame of an SDTV channel
T
Iframe,SD
=
S
SD
R
Uni,SD
T
Iframe,HD
Time needed to transmit a retained I-frame of an HDTV channel
T
Iframe,HD
=
S
HD
R
Uni,HD
D
SD
FCC failure delay (FFD) for an SDTV channel; subjects to a truncatednegative Exponential distribution (D
-
SD is the mean, D
SD,MAX is the upper bound, and D
SD,MIN is the lower bound)
D
-
SD
=
0.6
s; D
SD,MIN
=
0.2
s; D
SD,MAX
=
1
s
D
HD
FCC failure delay (FFD) for an HDTV channel; subjects to a truncatednegative Exponential distribution (D
-
HD is the mean, D
HD,MAX is the upper bound, and D
HD,MIN is the lower bound)
D
-
HD
=
0.8
s; D
HD,MIN
=
0.3
s; D
HD,MAX
=
1.3
sFigure 8
Bandwidth demand on linkLN for transmitting the retained I-frames w/ and w/o using the FAC scheme (T
thd
=
4
seconds).Figure 9
Bandwidth demand on linkLN for transmitting the retained I-frames w/ and w/o using the FAC scheme (T
thd
=
5
seconds).Figure 10
Bandwidth demand on linkLN for transmitting the retained I-frames w/ and w/o using the FAC scheme (T
thd
=
6
seconds).Figure 11
FCC CBP evaluated on linkLN w/ and w/o applying the FAC scheme for different values of T
thd.The four figures above illustrate the benefits of using our FAC scheme. Those gains are achieved by riding the cost of increasing channel changing delay for the heavy zappers. It is agreed that a thorough investigation of the cost is indispensable for a complete study. We therefore evaluate the Average FFD in a scenario where limited bandwidth reservation is assumed on the bottleneck linkLN (i.e., B
W
=
500
Mbps). This indicates that an FCC failure event can be either attributed to the bandwidth limits or incurred by using the FAC scheme. The simulation results for the three different values of T
thd are plotted on Figure 12. As can be seen, the average FFD linearly increases as T
thd grows. The general trend of each curve is to slowly decrease as the time goes in the simulation duration. The maximum value is around 0.27 second in the curve T
thd
=
6
s. Since it appears just at the beginning of the commercial break when increasingly more clients start to zap channels, we believe it is acceptable as an average FFD value. And we also note that for heavy zappers the situation would be worse, while for clients not addicted to channel zapping, the average delay would be much shorter.Figure 12
Average FFC failure delay (FFD) for different values ofT
thd in bandwidth limited scenarios (B
W
=
500
Mbps).To summarise, the simulation results imply that our FAC scheme can effectively optimize the scalability of the original I-frame acceleration mechanism based FCC methods by dramatically decreasing the bandwidth demands. In particular, if the bandwidth reservation for transmitting the retained I-frames is limited in the delivery network, the FAC scheme is capable of significantly reducing the CBPs for FCC, with only slightly increasing the average channel changing delay (i.e., average FFD). It is also observed that, when the reserved bandwidth is fixed, our proposed FAC scheme performs better in terms of reducing bandwidth requirements and CBP for larger values ofT
thd. It is however not true for the average FFD, which just gets worse as T
thd increases. In addition, we emphasis that, as an important scalability optimization method for the original I-frame acceleration mechanism, the FAC scheme is easy to be implemented by IPTV service providers in reality; the performance of the FAC scheme is closely related to both the bandwidth reservation for the I-frame acceleration mechanism, as well as the value of T
thd. Therefore, IPTV service providers should carefully choose the values for these parameters based on their practical needs.


## 6. Summary and Outlook

In this paper, we focused on optimizing the scalability of the I-frame acceleration mechanism, which is currently most widely used in IPTV systems to decrease channel change delay caused by I-frame acquisition. Existing literature indicates that channel changing events in an IPTV system are temporally correlated and tend to be periodically bursting (cf. Figure3). Due to this phenomenon, applying the I-frame acceleration mechanism may introduce a large amount of extra traffic loads which can run out of the available resources (in particular, the limited network bandwidth) in IPTV systems. Accordingly, the scalability of the I-frame acceleration mechanism can be largely degraded, especially during commercial breaks in peak-hours. Aiming to solve this problem (i.e., optimize the scalability), we proposed an easy-implementing fairness-based admission control (FAC) scheme, as a scalability optimization method for the original I-frame acceleration mechanism. The performance of the FAC scheme is evaluated by comprehensive simulation experiments. The simulation results show that our proposed FAC scheme has the ability to significantly decrease the bandwidth demand as well as the CBP for FCC. Hence it can optimize the scalability of the I-frame acceleration mechanism, with only slightly increasing the average channel changing delay by temporarily disabling FCC for the clients who are addicted to frequent channel zapping.Our planned work in the future will be the derivation of an optimized algorithm to dynamically determine the threshold valueT
thd, with the purpose to further improve the performance of the FAC scheme. On the other hand, more realistic user behaviour models in terms of channel changing events during commercial breaks are desired and should be proposed for the performance evaluation for the FAC scheme, when more practical measurement data become available for us.



---

*Source: 207402-2014-02-04.xml*