1 / 15

Efficient Channel Scheduling Algorithms in Optical Burst Switched Network

Efficient Channel Scheduling Algorithms in Optical Burst Switched Network. Jinhui Xu, Chunming Qiao, Jikai Li and Guang Xu Dep. Of CS, State University of New york at Buffalo. Horizon Algorithm. LAUC-VF Algorithm. Void Intervals Map to Points. Feasible Region. Min-EV Scheduling.

corin
Télécharger la présentation

Efficient Channel Scheduling Algorithms in Optical Burst Switched Network

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Efficient Channel Scheduling Algorithms in Optical Burst Switched Network Jinhui Xu, Chunming Qiao, Jikai Li and Guang Xu Dep. Of CS, State University of New york at Buffalo

  2. Horizon Algorithm

  3. LAUC-VF Algorithm

  4. Void Intervals Map to Points

  5. Feasible Region

  6. Min-EV Scheduling

  7. Best-fit Scheduling

  8. Allocation Search For Min-SV Fit

  9. Time Complexity • Searching: O(log m) • Insertion, deleting: O(log m) • Clean-up: O(log m)

  10. Searching A Batch of Offset Times

  11. Scheduling Time vs. Link Load

  12. Loss Rate vs. Offset Time Range

  13. Min-SV vs. Min-EV

  14. Batching FDL Algorithm

  15. Conclusion • Several channel scheduling algorithms are presented. • Unlike LAUC-VF or Horizon, these algorithms perform well in running time and loss rate.

More Related