End-to-end network QoS via scheduling of flexible resource reservation requests

Authors:
Sushant Sharma;Dimitrios Katramatos;Dantong Yu
Affiliations:
Computational Science Center, Brookhaven National Laboratory, Upton, NY;Computational Science Center, Brookhaven National Laboratory, Upton, NY;Computational Science Center, Brookhaven National Laboratory, Upton, NY
Venue:
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Year:
2011

Citing 5
Cited 2

A PTAS for the multiple knapsack problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Elastic reservations for efficient bandwidth utilization in LambdaGrids

Future Generation Computer Systems - Special section: Data mining in grid computing environments
Advance Reservations and Scheduling for Bulk Transfers in Research Networks

IEEE Transactions on Parallel and Distributed Systems
Constraint-based routing in the internet: Basic principles and recent research

IEEE Communications Surveys & Tutorials

Virtual network on demand: dedicating network resources to distributed scientific workflows

Proceedings of the fifth international workshop on Data-Intensive Distributed Computing Date
Design and implementation of an intelligent end-to-end network QoS system

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modern data-intensive applications move vast amounts of data between multiple locations around the world. To enable predictable and reliable data transfers, next generation networks allow such applications to reserve network resources for exclusive use. In this paper, we solve an important problem (called SMR3) to accommodate multiple and concurrent network reservation requests between a pair of end sites. Given the varying availability of bandwidth within the network, our goal is to accommodate as many reservation requests as possible while minimizing the total time needed to complete the data transfers. First, we prove that SMR3 is an NP-hard problem. Then, we solve it by developing a polynomial-time heuristic called RRA. The RRA algorithm hinges on an efficient mechanism to accommodate large number of requests in an iterative manner. Finally, we show via numerical results that RRA constructs schedules that accommodate significantly larger number of requests compared to other, seemingly efficient, heuristics.