%0 Conference Proceedings
%T An Optimized Resilient Advance Bandwidth Scheduling for Media Delivery Services
%+ Department of Information Technology
%A Barshan, Maryam
%A Moens, Hendrik
%A Volckaert, Bruno
%A Turck, Filip, De
%Z Part 3: Evaluation and Experimental Study of Rich Network Services
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th IFIP International Conference on Autonomous Infrastructure, Management and Security (AIMS)
%C Zurich, Switzerland
%Y Daphne Tuncer
%Y Robert Koch
%Y Rémi Badonnel
%Y Burkhard Stiller
%I Springer International Publishing
%3 Security of Networks and Services in an All-Connected World
%V LNCS-10356
%P 79-93
%8 2017-07-10
%D 2017
%R 10.1007/978-3-319-60774-0_6
%K Advance bandwidth reservation
%K Resilient reservation
%K Fixed timeslot size
%K Media delivery service
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.6
%2 https://inria.hal.science/hal-01806052/document
%2 https://inria.hal.science/hal-01806052/file/452969_1_En_6_Chapter.pdf
%L hal-01806052
%U https://inria.hal.science/hal-01806052
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-AIMS
%~ IFIP-WG6-6
%~ IFIP-LNCS-10356