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

References

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription