• DocumentCode
    3528735
  • Title

    On zap time minimization in IPTV networks

  • Author

    Long, Matthew ; Radhakrishnan, Sridhar ; Karabuk, Suleyman ; Antonio, John

  • Author_Institution
    Sch. of Comput. Sci., Univ. of Oklahoma, Norman, OK, USA
  • fYear
    2012
  • fDate
    Jan. 30 2012-Feb. 2 2012
  • Firstpage
    713
  • Lastpage
    718
  • Abstract
    Digital television systems have a clear disadvantage relative to analog systems in users´ quality of experience, most notably in the time required to change channels, or zap time. The goal of this research is to improve the performance of a multicasting IPTV network, both in user experience and in resource consumption. We formulate the problem of assigning IPTV clients to servers as an integer programming model, in variants which minimize channel-change times, overall network capacity consumption, or both. This problem is shown to be computationally hard, and the performance of the models is tested on problems of different sizes. Polynomial-time heuristics are presented which address a relaxed version of the problem, and the performance of these heuristics is measured.
  • Keywords
    IPTV; computational complexity; integer programming; IPTV clients; analog systems; channel-change times; digital television systems; integer programming model; multicasting IPTV network; network capacity consumption; polynomial-time heuristics; resource consumption; user quality of experience; zap time minimization; Bandwidth; Delay; Educational institutions; IPTV; Runtime; Servers; Streaming media; IPTV Networks; Integer Programming; Multicast; NP-Hardness;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computing, Networking and Communications (ICNC), 2012 International Conference on
  • Conference_Location
    Maui, HI
  • Print_ISBN
    978-1-4673-0008-7
  • Electronic_ISBN
    978-1-4673-0723-9
  • Type

    conf

  • DOI
    10.1109/ICCNC.2012.6167515
  • Filename
    6167515