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


DOI: 10.1007/s11107-008-0150-1

Cite this article as:
Saberi, N. & Coates, M.J. Photon Netw Commun (2009) 17: 157. doi:10.1007/s11107-008-0150-1


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 

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Division of Engineering and Applied SciencesHarvard UniversityCambridgeUSA
  2. 2.Department of Electrical and Computer EngineeringMcGill UniversityMontrealCanada

Personalised recommendations