Photonic Network Communications

, Volume 17, Issue 2, pp 157-169

Scheduling in overlaid star all-photonic networks with large propagation delays

  • N. SaberiAffiliated withDivision of Engineering and Applied Sciences, Harvard University Email author 
  • , M. J. CoatesAffiliated withDepartment of Electrical and Computer Engineering, McGill University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


This paper describes a framework for fixed- length frame scheduling in all-photonic networks with large propagation delays. We introduce the Fair Matching Algorithm a novel scheduling approach that results in weighted max-min fair allocation of extra slots, achieves zero rejection for admissible demands, and minimizes the maximum percentage rejection of any connection. We also propose the Minimum Rejection Algorithm, which minimizes total rejection but treats non-critical connections in a fair manner. Finally, we introduce a feedback control system based on Smith’s principle that reduces the effect of prediction errors and increases the speed of the response to the sudden changes in traffic arrival rates. Simulations performed using OPNET Modeler explore the performance of the scheduling and control algorithms we propose.


All-photonic networks Scheduling Max-min fairness Star topology