Dynamic scheduling of network resources with advance reservations in optical grids

Tanwir, Savera; Battestilli, Lina; Perros, Harry G.; Karmous-Edwards, Gigi

doi:10.1002/nem.680

Cited by 47 publications

(29 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [24] a resilient advance reservation mechanism is proposed in optical grids. Due to the lower cost of restoration mechanisms, they use the latter.…”

Section: Resilient Reservationmentioning

confidence: 99%

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

Barshan

Moens

Volckaert

et al. 2017

Journal of Network and Computer Applications

View full text Add to dashboard Cite

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.

show abstract

“…In [24] a resilient advance reservation mechanism is proposed in optical grids. Due to the lower cost of restoration mechanisms, they use the latter.…”

Section: Resilient Reservationmentioning

confidence: 99%

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

Barshan

Moens

Volckaert

et al. 2017

Journal of Network and Computer Applications

View full text Add to dashboard Cite

show abstract

“…The former results in more resource consumption but the recovery time is quite fast. In [15], the authors propose a restoration technique to deal with link failures. In their work, the active requests and the scheduled requests for the future which are affected by a failure are restored.…”

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

“…The scheduling window defines the time period within which the requestor would like to make a resource reservation. The scheduling window must be bigger than the reservation duration d. Thus the scheduler must check if a path is available during interval [s + t, s + t + d] where t = 0, 1, 2, ...., e -s -d [7]. This is an online scheduling problem because the requests arrive dynamically and for each request R, the DNRM must compute a path and then check if a wavelength on each link of this path can be reserved for duration d within the scheduling window [s, e].…”

Section: Problem Descriptionmentioning

confidence: 99%

“…If a wavelength along the path for the specified period of time is not available, another path has to be determined. In order to do this, the DNRM maintains a schedule of the reservations called the Reservation Table. It contains all current and future reservations and it is used to search for available resources for new advance reservations [7]. Table 1 shows an example of the reservation table for two light path requests for the network shown in figure 2.…”

Section: Problem Descriptionmentioning

confidence: 99%