|
Title
|
|
|
|
Deadline-aware advance reservation scheduling algorithms for media production networks
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| In the media production process a substrate network can be shared by many users simultaneously when different media actors are geographically distributed. This allows sophisticated media productions involving numerous producers to be concurrently created and transferred. Due to the predictable nature of media transfers, the collaboration among different actors could be significantly improved by deploying an efficient advance reservation system. In this paper, we propose a model for the advance bandwidth reservation problem, which takes the specific characteristics of media production networks into account. Flexible and time variable bandwidth reservations, meeting delivery deadlines, supporting splittable flows and interdependent transfers and all types of advance reservation requests imposed by the media production transfers are incorporated into this model. In addition to the optimal scheduling algorithms, which are presented based on this model, near optimal alternatives are also proposed. The experimental results show that the proposed algorithms are scalable in terms of physical topology and granularity of time intervals and obtain a satisfactory performance, executing significantly faster than an optimal algorithm and within 8.78% of the optimal results. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Computer communications. - London
|
|
|
Publication
|
|
|
|
London
:
2016
|
|
|
ISSN
|
|
|
|
0140-3664
|
|
|
DOI
|
|
|
|
10.1016/J.COMCOM.2015.10.016
|
|
|
Volume/pages
|
|
|
|
77
(2016)
, p. 26-40
|
|
|
ISI
|
|
|
|
000371941700003
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (open access)
|
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|