1. Seamless Channel Transition for Pyramid- based Near-VOD Services Student: Wei-De Chien Advisor: Prof. Ja-Shung Wang

2. Channel Transition The service delay of a popular movie should be shortened to satisfy a large number of clients. If a movie is no longer popular, part of the assigned channels can be released for other movies. Once a bottleneck occurs in the broadcasting network, the server must decrease the bandwidth usage to conform the limitation.

3. Seamless Property of a Channel Transition Any proceeding service should not be interrupted or broken off during the channel transition. The maximum service delay should be restricted by an acceptable value during the channel transition.

4. Fast Broadcasting (FB)

5. Skyscraper Broadcasting (SB)

6. Harmonic Broadcasting (HB)

7. Seamless Channel Transition (SCT) Scheme

8. Seamless Channel Transition (SCT) Scheme (continued)

9. Stairway Channel Transition (SWCT) A channel may broadcast with old video segmentation now and new segmentation later. We will refer this channel as an “ old channel ” or a “ new channel ” according to the segments it broadcasts. Old channels should be finished gradually to satisfy the requests with old video segmentation. This is the reason why we choose “ stairway ” as the name of our scheme. To coordinate with the termination of old channels, new channels should be created progressively. The starting time of a new channel should not be earlier than the ending time of its coincident old channel.

10. SWCT in FB – Negative Channel Transition C j => C j+m, 1 ≤ j ≤ k-m

11. SWCT in FB – Positive Channel Transition C i+m => C i, 1 ≤ i ≤ k

12. SWCT in FB – Positive Channel Transition (continued) In a positive channel transition d = L/(2 k -1) and d = L/(2 k+m -1), d/d = (2 k -1)/(2 k+m -1). C i+m starts (2 i+m-1 -1)∙d later than T b, and C i finishes (2 i-1 -1)∙d later than T b. (2 i+m -1 -1)∙d- (2 i -1 -1)∙d = d∙(2 i+m-1 -1)∙(2 k -1)/(2 k+m -1) - d∙(2 i-1 -1) = d∙(2 k -2 i-1 )∙(2 m-1 )/(2 k+m -1) > 0, given i ≤ k; i, k and m are positive integers.

13. SWCT in FB – Buffer Requirement T R (i): received time of S i. T P (i): played time of S i. T R (1)=T P (1)

14. SWCT in FB – Buffer Requirement (continued) Lemma 1: The maximum buffer requirement in C k is 2 k-1 -1 segments for the last cycle in our channel transition scheme. Lemma 2: The overall buffer requirement is decided by the maximum buffer requirement respecting to the last channel C k. Theorem 1: The maximum buffer requirement for our proposed channel transition scheme is 2 k-1 -1 segments, which does not exceed the maximum buffer requirement in FB scheme.

15. SWCT in SB – Definition of The Last Cycle T R (i)= T P (i) - (f(i)-1)∙d

16. SWCT in SB – Definition of The Last Cycle (continued)

17. SWCT in SB – Negative Channel Transition

18. SWCT in SB – Failure in Positive Channel Transition

19. SWCT in SB – Failure in Positive Channel Transition (continued)

20. SWCT in SB – Solution One

21. SWCT in SB – Solution Two

22. SWCT in HB – Negative Channel Transition

23. SWCT in SB – Positive Channel Transition

24. Simulations – Bandwidth Waste (SWCT in FB)

25. Simulations – Bandwidth Waste (SWCT vs. SCT)

26. Simulations – Service Delay (SWCT vs. SCT) SCT: longer service delay due to dummy video. SWCT: either d or d’.

27. Simulations – Buffer Requirement (SWCT vs. SCT)

28. Simulations – Bandwidth Waste (SWCT in SB)

29. Conclusion In this paper, we propose a new channel transition scheme over three different broadcasting schemes. According to the simulation results, our proposed SWCT scheme is suitable for the regularly scheduled channel re-allocation in half or full day scale. In comparison to the existing SCT scheme, our scheme causes smaller bandwidth waste. The client waiting time and buffering space requirement are kept the same as the performances in original FB scheme, and therefore smaller than those in SCT scheme. The d and d restrict the service delay for any request issued during the channel transition.