Rerouting in advance reservation networks

Authors:
Chongyang Xie;Hamed Alazemi;Nasir Ghani
Affiliations:
Department of Electrical and Computer Engineering, University of New Mexico, USA;Computer Engineering Department, Kuwait University, Kuwait;Department of Electrical and Computer Engineering, University of New Mexico, USA
Venue:
Computer Communications
Year:
2012

Citing 9
Cited 0

Resource sharing for book-ahead and instantaneous-request calls

IEEE/ACM Transactions on Networking (TON)
Introduction to algorithms

Introduction to algorithms
Analysis of Data Structures for Admission Control of Advance Reservation Requests

IEEE Transactions on Knowledge and Data Engineering
Rerouting Strategies for Networks with Advance Reservations

E-SCIENCE '05 Proceedings of the First International Conference on e-Science and Grid Computing
Networks with Advance Reservations: Applications, Architecture, and Performance

Journal of Network and Systems Management
Efficient distributed bandwidth management for MPLS fast reroute

IEEE/ACM Transactions on Networking (TON)
Advance reservations for service-aware GMPLS-based optical networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Path computation with variable bandwidth for bulk data transfer in high-performance networks

INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Toward automated provisioning of advance reservation service in next-generation optical internet

IEEE Communications Magazine

Quantified Score

Hi-index	0.24

Visualization

Abstract

The advance reservation of network connections is an area of growing interest and a range of service models and algorithms have been proposed to achieve various scheduling objectives, i.e., including optimization-based strategies and heuristic schemes. Now given the time-shifted nature of future requests, rerouting strategies have also been considered to improve resource allocation and carried loads. However, most existing rerouting schemes have focused on minimizing connection disruptions and have not considered further link load information. Along these lines, this paper develops novel rerouting strategies to improve connection scheduling in advance reservation networks. Specifically, a dynamic optimization formulation is presented to handle ''on-line'' arrivals along with a new heuristic load-balancing strategy. The performance of these proposed solutions is then evaluated for a wide range of network topologies and also compared against some existing rerouting schemes.