Abstract
In high-performance networks with both advance and immediate reservations, activating an advance reservation may result in the preemption of some ongoing data transfers based on immediate reservations due to insufficient bandwidth. To minimize such service disruption, we explore the interactions between advance and immediate reservations, and propose an integrated reservation solution with two components: (i) a scheduling algorithm based on statistical analysis of reservation dynamics that routes deadline-constrained advance reservations to minimize the probabilistic number of immediate reservation preemptions, (ii) a runtime preemption scheme to minimize the actual number of immediate reservation preemptions at the activation of an advance reservation. Simulation results show that the proposed reservation solution exhibits a superior performance over existing methods.
| Original language | English (US) |
|---|---|
| Pages | 1041-1045 |
| Number of pages | 5 |
| DOIs | |
| State | Published - 2014 |
| Externally published | Yes |
| Event | 2014 International Conference on Computing, Networking and Communications, ICNC 2014 - Honolulu, HI, United States Duration: Feb 3 2014 → Feb 6 2014 |
Other
| Other | 2014 International Conference on Computing, Networking and Communications, ICNC 2014 |
|---|---|
| Country/Territory | United States |
| City | Honolulu, HI |
| Period | 2/3/14 → 2/6/14 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
Keywords
- bandwidth scheduling
- high-performance networks
- reservation preemption