Design and evaluation of a dual dynamic adaptive reservation approach in media production networks

Abstract

Media production networks require an ecient collaboration between geographically distributed actors and oer predictable workloads, making it possible to exploit this predictability and use advance bandwidth reservation services to achieve greater bandwidth utilization and service guarantees. To oer reliable reservations, the incorporation of fault-tolerance related features in bandwidth reservation strategies is a necessity, although this imposes a waste of capacity and extra performance overhead. As a rst provisional stage to oer a robust reservation system, deploying protection mechanisms ensures that the reservations remain valid when the system is in operation. To maximally utilize the network, and to ensure there is a quick response in a dynamic network environment, constant monitoring and optimization is needed. In this article, we propose an ecient dual optimization approach consisting of two consecutive processes. First, a schedule is produced by a resilient advance reservation algorithm. Then, the generated schedule is continually updated over time using a runtime adaptation approach in order to be capable of dynamically adapting the network to changing conditions and mitigating the side eects of provisioned reliability. This step uses the interconnecting network links' leftover capacity, resulting in an increased performance both in steady and unsteady network conditions. Our evaluations show that in failure-prone environments, the proposed approach leads to signicant increase in the success rate of admitted requests, up to 6.77 times, compared to the resilient advance reservation algorithms.

An Advance Reservation System to Improve Network Resource Utilization in Software-Defined Networks

“…Additionally, two studies by Chung et al [24], [31] aim at developing a multi-domain solution relying on the information provided by software-defined exchanges where scheduling and actual bandwidth reservation are performed internally by each domain controller. As to scheduling, among the studies that allow for advance reservations, only a few are based on fixed time slots [17], [34]. Most of them opt for the flexibility provided by dynamic time slots even if managing such structures is more complex.…”

“…In [34], Barshan et al add reliability guarantees to their previous approach. To this end, apart from the primary data transmission path, a totally disjoint backup path is also computed for each reservation request.…”

A flexible, reliable, and adaptive timeslot‐based advance bandwidth‐reservation mechanism for media delivery services

“…To maximally utilize the network, and to ensure a quick response in a dynamic network environment, constant monitoring and optimization are needed. We have previously proposed an efficient dual optimization approach, referred to as the RA approach, consisting of 2 consecutive processes . In the RA approach, first, a schedule is produced by a resilient AR algorithm.…”

“…We have previously proposed an efficient dual optimization approach, referred to as the RA approach, consisting of 2 consecutive processes. 6 In the RA approach, first, a schedule is produced by a resilient AR algorithm. Then, the generated schedule is continually updated over time in order to be capable of dynamically adapting the schedule to changing conditions.…”

“…To offer predictable complexity, easier hardware implementation, and systematic reconfiguration of network devices, we have previously designed several timeslot‐based algorithms using fixed time slots and taking into account the characteristics of requests in media‐centric networks . The resilient version of this solution has been proposed in Sahhaf et al, and adaptability has been added to the above‐mentioned fixed‐size timeslot‐based approaches in Barshan et al, by introducing the runtime adaptation (RA) approach.…”