Article: Designing two-list group program driven algorithm for channel navigation in internet protocol television Journal: International Journal of Advanced Media and Communication (IJAMC) 2019 Vol.7 No.4 pp.251 - 263 Abstract: The internet protocol television took the advantage of the convergence of internet services to provide seamless interactivity, time shifting, video on demand and pay per view services. However, zapping delay is a critical problem that deters the switching intention of terrestrial subscribers and widespread of internet protocol television services. This article presents the design of an effective two-list group program driven algorithm that minimises the channel seek distance and channel seek time in order to reduce zapping delay in internet protocol television. The algorithm groups similar channel programs in related service categories such as news, movies, sports, music and documentary to make it easier for channels with similarly aired programs to be identified rapidly among several channels that an internet protocol television offers. The simulated results of the proposed algorithm show that the average seek distance is significantly reduced by 58% when benchmarked with the state of the art numerical ordering, frequency circular ordering and frequency interleaved ordering. Inderscience Publishers - linking academia, business and industry through research

Title: Designing two-list group program driven algorithm for channel navigation in internet protocol television

Authors: Timothy T. Adeliyi; Oludayo O. Olugbara

Addresses: ICT and Society Research Group, Durban University of Technology, Durban, 4001, South Africa ' ICT and Society Research Group, Durban University of Technology, Durban, 4001, South Africa

Abstract: The internet protocol television took the advantage of the convergence of internet services to provide seamless interactivity, time shifting, video on demand and pay per view services. However, zapping delay is a critical problem that deters the switching intention of terrestrial subscribers and widespread of internet protocol television services. This article presents the design of an effective two-list group program driven algorithm that minimises the channel seek distance and channel seek time in order to reduce zapping delay in internet protocol television. The algorithm groups similar channel programs in related service categories such as news, movies, sports, music and documentary to make it easier for channels with similarly aired programs to be identified rapidly among several channels that an internet protocol television offers. The simulated results of the proposed algorithm show that the average seek distance is significantly reduced by 58% when benchmarked with the state of the art numerical ordering, frequency circular ordering and frequency interleaved ordering.

Keywords: channel navigation; internet protocol television; program-driven; zapping delay.

DOI: 10.1504/IJAMC.2019.105440

International Journal of Advanced Media and Communication, 2019 Vol.7 No.4, pp.251 - 263

Received: 17 Feb 2017
Accepted: 17 May 2018
Published online: 29 Feb 2020 *

Title: Designing two-list group program driven algorithm for channel navigation in internet protocol television

Keep up-to-date