Advance Reservation in Distributed Multidomain Networks

Alazemi, Hamed M. K.; Gu, Feng; Xie, Chengyu; Ghani, Nasir

doi:10.1109/jsyst.2013.2265185

Cited by 5 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The AR scheduling problem has been well studied in literature. While some have focused on rescheduling and multidomain reservation, others specifically take into account real‐world deployments, and Wavelength Division Multiplexing (WDM) optical networks . Nevertheless, only 2 AR algorithms support elastic reservations, and both considered fixed start time for the requests, while we consider flexible or unspecified start times.…”

Section: Related Workmentioning

confidence: 99%

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

et al. 2018

View full text Add to dashboard Cite

Summary Media‐centric networks deal with exchanging large media files between geographical distributed locations with strict deadlines. In such networks, resources need to be available at predetermined timeslots in the future and thus need to be reserved in advance, based on either flexible or fixed timeslot sizes. Reliability of the transfers is also important and can be attained by advance provisioning of redundant reservations. This, however, imposes additional costs, because redundant reservations are rarely in use, causing network resources to be wasted. Further adaptation and network utilization can be achieved at runtime by reutilizing unused reservations for transferring extra data as long as no failure has been detected. In this article, we design, implement, and evaluate a resilient advance bandwidth‐reservation approach based on flexible timeslots, in combination with a runtime adaptation approach. We take into account the specific characteristics of media transfers. Quality and complexity of the proposed approach have been extensively compared with that of a fixed timeslot algorithm. Our simulation results reveal that the highest admittance ratio and percentage of fully transferred requests in case of failures are almost always achieved by flexible timeslots, while the execution time of this approach is up to 17.5 times lower, compared with the approaches with fixed timeslot sizes.

show abstract

Section: Related Workmentioning

confidence: 99%

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

et al. 2018

View full text Add to dashboard Cite

show abstract

“…While some have focused on rescheduling [5], [6], [7] and multi domain reservation [8], others particularly take into account real-world deployments [9], [10], [11], [12], and WDM optical networks [3]. Nevertheless, only two advance reservation algorithms [13], [14] support elastic reservation, and both consider fixed start time for the requests [3], while we consider flexible or unspecified start times.…”

Section: Related Workmentioning

confidence: 99%

Design and evaluation of a flexible Advance bandwidth Reservation Algorithm for media production networks

Barshan

Moens

Volckaert

et al. 2017

2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)

View full text Add to dashboard Cite

Abstract-In media production companies, exchanging large media files is daily business. Due to the predictable nature of network transfers in the media production industry, timeslotbased advance bandwidth reservation results in higher bandwidth utilization and improved network performance. Timeslot-based advance reservation can be based on flexible or fixed timeslot sizes. As the flexible approach is highly beneficial under bursty and limited network traffic conditions, this paper focuses on that approach. We design, implement and evaluate a novel algorithm based on flexible timeslots, taking into account the specific characteristics of media transfers and compare it with a fixed timeslot algorithm to quantitatively study the quality and complexity of both scenarios. We have defined a set of realistic media production use cases that serve as a basis for the evaluations. Results shows that the highest admittance ratio is consistently achieved by using the flexible time interval algorithm, while the execution time of this approach is up to 12 times lower, compared to the approach with fixed timeslot sizes.

show abstract

“…While both approaches consider a fixed start time for the requests, all four classes for requests with specified or unspecified time and duration are supported in our work. Current research on AR scheduling mostly focuses on rescheduling [6][7][8], multi-domain reservations [9], and real-life deployments [10][11][12][13]. Nevertheless, reliability and fault tolerance properties have not been investigated.…”

Section: Related Workmentioning

confidence: 99%

An Optimized Resilient Advance Bandwidth Scheduling for Media Delivery Services

Barshan

Moens

Volckaert

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In IP-based media delivery services, we often deal with predictable network load and traffic, making it beneficial to use advance reservations even when network failure occurs. In such a network, to offer reliable reservations, fault-tolerance related features should be incorporated in the advance reservation system. In this paper, we propose an optimized protection mechanism in which backup paths are selected in advance to protect the transfers when any failure happens in the network. Using a shared backup path protection, the proposed approach minimizes the backup capacity of the requests while guaranteeing 100% single link failure recovery. We have evaluated the quality and complexity of our proposed solution and the impact of different percentages of backup demands and timeslot sizes have been investigated in depth. The presented approach has been compared to our previously-designed algorithm as a baseline. Our simulation results reveal a noticeable improvement in request acceptance rate, up to 9.2%. Moreover, with fine-grained timeslot sizes and under limited network capacity, the time complexity of the proposed solution is up to 14% lower.

show abstract

Advance Reservation in Distributed Multidomain Networks

Cited by 5 publications

References 27 publications

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

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

Design and evaluation of a flexible Advance bandwidth Reservation Algorithm for media production networks

An Optimized Resilient Advance Bandwidth Scheduling for Media Delivery Services

Contact Info

Product

Resources

About