By Topic

Routing and Scheduling for Variable Bandwidth Advance Reservation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Patel, A.N. ; Erik Jonsson Sch. of Eng. & Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA ; Jue, J.P.

Emerging elastic applications generate voluminous datasets, which are often required to be transferred across the network irrespective of flow level bandwidth guarantees. The primary concern in efficient transfers of such bulk data is to minimize the net transfer time. Variable bandwidth advance reservation (VBAR) can efficiently support such applications by reserving time variant bandwidth over the duration of a connection in advance. In this work, we address the routing and bandwidth scheduling problem in VBAR with the objective of minimizing the data transfer time. We propose three heuristic algorithms, and evaluate their performance for a single request under a given network state. We also evaluate the performance of the heuristics in a network under a dynamic traffic scenario. We demonstrate that VBAR outperforms conventional standard advance reservation and immediate reservation approaches in terms of delay, blocking probability, and network throughput. Furthermore, the performance of the proposed heuristic outperforms existing solutions in the dynamic traffic scenario with significantly lower time and storage complexities.

Published in:

Optical Communications and Networking, IEEE/OSA Journal of  (Volume:3 ,  Issue: 12 )