Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
On choosing a task assignment policy for a distributed server system
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
GTP: group transport protocol for lambda-Grids
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
DWDM-RAM: enabling Grid services with dynamic optical networks
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Proceedings of the first international conference on Networks for grid applications
| Hi-index | 0.00 |
Advance-reservation requests are an essential feature of LambdaGrids, where resources may need to be co-allocated at pre-determined times. In this paper, we discuss unconstrained advance reservations, which use flexible time-windows to lower blocking probability and, consequently, increase resource utilization. We claim and show using simulations that the minimum window size, which theoretically brings the blocking probability to 0, in a first-come-first-served advance reservation model without time-slots, equals the waiting time in a queue-based on-demand model. We also show, with simulations, the window sizes, which bring the blocking probability to its minimum, for an advance reservation model with time-slots.