Abstract

We introduce an optimal routing and horizon scheduling algorithm for Time-Shift Advance Reservation. The proposed algorithm minimizes latency for each request, reduces request blocking, and increases link utilization compared to standard advance reservation approaches.

© 2009 Optical Society of America

PDF Article