University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Optimized Resource Distribution for Interactive TV Applications

Kodikara Arachchi, H, Kulupana, G, Talagala, DS and Fernando, WAC (2015) Optimized Resource Distribution for Interactive TV Applications IEEE Transactions on Consumer Electronics. pp. 70-71.

[img]
Preview
Text
kulupana_2015-01-09_1569999749.pdf - ["content_typename_Submitted version (pre-print)" not defined]
Available under License : See the attached licence file.

Download (1MB) | Preview
[img]
Preview
PDF (licence)
SRI_deposit_agreement.pdf
Available under License : See the attached licence file.

Download (33kB) | Preview

Abstract

Though ubiquitous, the full potential of consumer electronic devices in the home, as content creators, remains underutilized due to the limited interaction between the consumers and the existing on-demand application and media services. Although services such as interactive television could change this, the geographic distribution of groups of consumers and the need for on-the-fly media processing that this entails, makes the efficient utilization of resources a complex optimization task requiring mechanisms to simultaneously allocate processing and network resources to groups of users. However, these technologies have not yet been developed, and brute force methods remain prohibitively complex. In order to overcome this problem, this paper proposes heuristic algorithms to both generate end-to-end delay bound multicast trees for individual groups of users and to co-locate multiple multicast trees, such that a minimum group quality metric can be satisfied. The performance of the proposed heuristic solution is evaluated in terms of the serving probability, i.e., the resource utilization efficiency, and computation time of the resource allocation decision making process. Simulation results show that improvements in the serving probability of up to 50%, in comparison with existing generic resource allocation schemes, and several orders of magnitude reduction of the computation time, in comparison to an optimal linear programming solution approach, can be achieved.

Item Type: Article
Authors :
AuthorsEmailORCID
Kodikara Arachchi, HUNSPECIFIEDUNSPECIFIED
Kulupana, GUNSPECIFIEDUNSPECIFIED
Talagala, DSUNSPECIFIEDUNSPECIFIED
Fernando, WACUNSPECIFIEDUNSPECIFIED
Date : 1 September 2015
Identification Number : 10.1109/ICCE.2015.7066322
Additional Information : © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Depositing User : Symplectic Elements
Date Deposited : 27 Oct 2015 10:10
Last Modified : 27 Oct 2015 10:10
URI: http://epubs.surrey.ac.uk/id/eprint/808979

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800