Advance reservations for predictive service in the Internet |
| |
Authors: | Mikael Degermark Torsten Köhler Stephen Pink Olov Schelén |
| |
Affiliation: | Department of Computer Science, Lule? University, S-971 87 Lule?, Sweden; {micke,olov}@sm.luth.se, SE Swedish Institute of Computer Science, PO Box 1263, S-164 28 Kista, Sweden; {steve,tk}@sics.se, US
|
| |
Abstract: | We extend a measurement-based admission control algorithm suggested for predictive service to provide advance reservations
for guaranteed and predictive service, while retaining the attractive features of predictive service. The admission decision
for advance reservations is based on information about flows that overlap in time. For flows that have not yet started, the
requested values are used, and for those that have already started measurements are used. This allows us to estimate the network
load accurately for the near future. To provide advance reservations we ask users to include durations in their requests.
We present simulation results to show that predictive service with advance reservations provides utilization levels significantly
higher than those for guaranteed service, and comparable to those for predicted service without advance reservations. Those
utilization levels are reached without any preemption of other admitted flows. Finally, we discuss how to setup advance reservations
over multiple hops in the Internet using resource reservation setup protocols. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|